| 2019 | A Generalized Neyman-Pearson Criterion for Optimal Domain Adaptation. Clayton Scott |
| 2019 | A Sharp Lower Bound for Agnostic Learning with Sample Compression Schemes. Steve Hanneke, Aryeh Kontorovich |
| 2019 | A minimax near-optimal algorithm for adaptive rejection sampling. Juliette Achdou, Joseph Lam-Weil, Alexandra Carpentier, Gilles Blanchard |
| 2019 | A simple parameter-free and adaptive approach to optimization under a minimal local smoothness assumption. Peter L. Bartlett, Victor Gabillon, Michal Valko |
| 2019 | A tight excess risk bound via a unified PAC-Bayesian-Rademacher-Shtarkov-MDL complexity. Peter D. Grünwald, Nishant A. Mehta |
| 2019 | Adaptive Exact Learning of Decision Trees from Membership Queries. Nader H. Bshouty, Catherine A. Haddad-Zaknoon |
| 2019 | Algorithmic Learning Theory 2019: Preface. Aurélien Garivier, Satyen Kale |
| 2019 | Algorithmic Learning Theory, ALT 2019, 22-24 March 2019, Chicago, Illinois, USA. Aurélien Garivier, Satyen Kale |
| 2019 | An Exponential Efron-Stein Inequality for Karim T. Abou-Moustafa, Csaba Szepesvári |
| 2019 | Attribute-efficient learning of monomials over highly-correlated variables. Alexandr Andoni, Rishabh Dudeja, Daniel Hsu, Kiran Vodrahalli |
| 2019 | Average-Case Information Complexity of Learning. Ido Nachum, Amir Yehudayoff |
| 2019 | Can Adversarially Robust Learning LeverageComputational Hardness? Saeed Mahloujifar, Mohammad Mahmoody |
| 2019 | Cleaning up the neighborhood: A full classification for adversarial partial monitoring. Tor Lattimore, Csaba Szepesvári |
| 2019 | Competitive ratio vs regret minimization: achieving the best of both worlds. Amit Daniely, Yishay Mansour |
| 2019 | Dimensionality Reduction and (Bucket) Ranking: a Mass Transportation Approach. Mastane Achab, Anna Korba, Stéphan Clémençon |
| 2019 | Dynamic Pricing with Finitely Many Unknown Valuations. Nicolò Cesa-Bianchi, Tommaso Cesari, Vianney Perchet |
| 2019 | Exploiting geometric structure in mixture proportion estimation with generalised Blanchard-Lee-Scott estimators. Henry W. J. Reeve, Ata Kabán |
| 2019 | General parallel optimization a without metric. Xuedong Shang, Emilie Kaufmann, Michal Valko |
| 2019 | Generalize Across Tasks: Efficient Algorithms for Linear Representation Learning. Brian Bullins, Elad Hazan, Adam Kalai, Roi Livni |
| 2019 | Hardness of Improper One-Sided Learning of Conjunctions For All Uniformly Falsifiable CSPs. Alexander Durgin, Brendan Juba |
| 2019 | Improved Generalization Bounds for Robust Learning. Idan Attias, Aryeh Kontorovich, Yishay Mansour |
| 2019 | Interplay of minimax estimation and minimax support recovery under sparsity. Mohamed Ndaoud |
| 2019 | Ising Models with Latent Conditional Gaussian Variables. Frank Nussbaum, Joachim Giesen |
| 2019 | Limit Learning Equivalence Structures. Ekaterina B. Fokina, Timo Kötzing, Luca San Mauro |
| 2019 | Minimax Learning of Ergodic Markov Chains. Geoffrey Wolfer, Aryeh Kontorovich |
| 2019 | Noninteractive Locally Private Learning of Linear Models via Polynomial Approximations. Di Wang, Adam D. Smith, Jinhui Xu |
| 2019 | Old Techniques in Differentially Private Linear Regression. Or Sheffet |
| 2019 | On Learning Graphs with Edge-Detecting Queries. Hasan Abasi, Nader H. Bshouty |
| 2019 | Online Influence Maximization with Local Observations. Gábor Lugosi, Gergely Neu, Julia Olkhovskaya |
| 2019 | Online Linear Optimization with Sparsity Constraints. Jun-Kun Wang, Chi-Jen Lu, Shou-De Lin |
| 2019 | Online Non-Additive Path Learning under Full and Partial Information. Corinna Cortes, Vitaly Kuznetsov, Mehryar Mohri, Holakou Rahmanian, Manfred K. Warmuth |
| 2019 | Optimal Collusion-Free Teaching. David G. Kirkpatrick, Hans Ulrich Simon, Sandra Zilles |
| 2019 | PAC Battling Bandits in the Plackett-Luce Model. Aadirupa Saha, Aditya Gopalan |
| 2019 | PeerReview4All: Fair and Accurate Reviewer Assignment in Peer Review. Ivan Stelmakh, Nihar B. Shah, Aarti Singh |
| 2019 | Sample Compression for Real-Valued Learners. Steve Hanneke, Aryeh Kontorovich, Menachem Sadigurschi |
| 2019 | Sequential change-point detection: Laplace concentration of scan statistics and non-asymptotic delay bounds. Odalric-Ambrym Maillard |
| 2019 | Stochastic Nonconvex Optimization with Large Minibatches. Weiran Wang, Nathan Srebro |
| 2019 | Two-Player Games for Efficient Non-Convex Constrained Optimization. Andrew Cotter, Heinrich Jiang, Karthik Sridharan |
| 2019 | Uniform regret bounds over R Pierre Gaillard, Sébastien Gerchinovitz, Malo Huard, Gilles Stoltz |