| 2019 | General parallel optimization a without metric. | Xuedong Shang, Emilie Kaufmann, Michal Valko |
| 2019 | Minimax Learning of Ergodic Markov Chains. | Geoffrey Wolfer, Aryeh Kontorovich |
| 2019 | Stochastic Nonconvex Optimization with Large Minibatches. | Weiran Wang, Nathan Srebro |
| 2019 | Noninteractive Locally Private Learning of Linear Models via Polynomial Approximations. | Di Wang, Adam D. Smith, Jinhui Xu |
| 2019 | Online Linear Optimization with Sparsity Constraints. | Jun-Kun Wang, Chi-Jen Lu, Shou-De Lin |
| 2019 | PeerReview4All: Fair and Accurate Reviewer Assignment in Peer Review. | Ivan Stelmakh, Nihar B. Shah, Aarti Singh |
| 2019 | Old Techniques in Differentially Private Linear Regression. | Or Sheffet |
| 2019 | A Generalized Neyman-Pearson Criterion for Optimal Domain Adaptation. | Clayton Scott |
| 2019 | PAC Battling Bandits in the Plackett-Luce Model. | Aadirupa Saha, Aditya Gopalan |
| 2019 | Exploiting geometric structure in mixture proportion estimation with generalised Blanchard-Lee-Scott estimators. | Henry W. J. Reeve, Ata Kabn |
| 2019 | Ising Models with Latent Conditional Gaussian Variables. | Frank Nussbaum, Joachim Giesen |
| 2019 | Interplay of minimax estimation and minimax support recovery under sparsity. | Mohamed Ndaoud |
| 2019 | Average-Case Information Complexity of Learning. | Ido Nachum, Amir Yehudayoff |
| 2019 | Sequential change-point detection: Laplace concentration of scan statistics and non-asymptotic delay bounds. | Odalric-Ambrym Maillard |
| 2019 | Can Adversarially Robust Learning LeverageComputational Hardness? | Saeed Mahloujifar, Mohammad Mahmoody |
| 2019 | Online Influence Maximization with Local Observations. | Gbor Lugosi, Gergely Neu, Julia Olkhovskaya |
| 2019 | Cleaning up the neighborhood: A full classification for adversarial partial monitoring. | Tor Lattimore, Csaba Szepesvri |
| 2019 | Optimal Collusion-Free Teaching. | David G. Kirkpatrick, Hans Ulrich Simon, Sandra Zilles |
| 2019 | Sample Compression for Real-Valued Learners. | Steve Hanneke, Aryeh Kontorovich, Menachem Sadigurschi |
| 2019 | A Sharp Lower Bound for Agnostic Learning with Sample Compression Schemes. | Steve Hanneke, Aryeh Kontorovich |
| 2019 | A tight excess risk bound via a unified PAC-Bayesian-Rademacher-Shtarkov-MDL complexity. | Peter D. Grnwald, Nishant A. Mehta |
| 2019 | Algorithmic Learning Theory 2019: Preface. | Aurlien Garivier, Satyen Kale |
| 2019 | Uniform regret bounds over R | Pierre Gaillard, Sbastien Gerchinovitz, Malo Huard, Gilles Stoltz |
| 2019 | Limit Learning Equivalence Structures. | Ekaterina B. Fokina, Timo Ktzing, Luca San Mauro |
| 2019 | Hardness of Improper One-Sided Learning of Conjunctions For All Uniformly Falsifiable CSPs. | Alexander Durgin, Brendan Juba |