| 2020 | A Non-Trivial Algorithm Enumerating Relevant Features over Finite Fields. Mikito Nanashima |
| 2020 | A Tight Convergence Analysis for Stochastic Gradient Descent with Delayed Updates. Yossi Arjevani, Ohad Shamir, Nathan Srebro |
| 2020 | Adversarially Robust Learning Could Leverage Computational Hardness. Sanjam Garg, Somesh Jha, Saeed Mahloujifar, Mohammad Mahmoody |
| 2020 | Algebraic and Analytic Approaches for Parameter Learning in Mixture Models. Akshay Krishnamurthy, Arya Mazumdar, Andrew McGregor, Soumyabrata Pal |
| 2020 | Algorithmic Learning Theory 2020: Preface. Aryeh Kontorovich, Gergely Neu |
| 2020 | Algorithmic Learning Theory, ALT 2020, 8-11 February 2020, San Diego, CA, USA. Aryeh Kontorovich, Gergely Neu |
| 2020 | An adaptive stochastic optimization algorithm for resource allocation. Xavier Fontaine, Shie Mannor, Vianney Perchet |
| 2020 | Approximate Representer Theorems in Non-reflexive Banach Spaces. Kevin Schlegel |
| 2020 | Bandit Algorithms Based on Thompson Sampling for Bounded Reward Distributions. Charles Riou, Junya Honda |
| 2020 | Cautious Limit Learning. Vanja Doskoc, Timo Kötzing |
| 2020 | Cooperative Online Learning: Keeping your Neighbors Updated. Nicolò Cesa-Bianchi, Tommaso Cesari, Claire Monteleoni |
| 2020 | Distribution Free Learning with Local Queries. Galit Bary-Weisberg, Amit Daniely, Shai Shalev-Shwartz |
| 2020 | Don't Jump Through Hoops and Remove Those Loops: SVRG and Katyusha are Better Without the Outer Loop. Dmitry Kovalev, Samuel Horváth, Peter Richtárik |
| 2020 | Efficient Private Algorithms for Learning Large-Margin Halfspaces. Huy Le Nguyen, Jonathan R. Ullman, Lydia Zakynthinou |
| 2020 | Exponentiated Gradient Meets Gradient Descent. Udaya Ghai, Elad Hazan, Yoram Singer |
| 2020 | Feedback graph regret bounds for Thompson Sampling and UCB. Thodoris Lykouris, Éva Tardos, Drishti Wali |
| 2020 | Finding Robust Nash equilibria. Vianney Perchet |
| 2020 | First-Order Bayesian Regret Analysis of Thompson Sampling. Sébastien Bubeck, Mark Sellke |
| 2020 | Interactive Learning of a Dynamic Structure. Ehsan Emamjomeh-Zadeh, David Kempe, Mohammad Mahdian, Robert E. Schapire |
| 2020 | Leverage Score Sampling for Faster Accelerated Regression and ERM. Naman Agarwal, Sham M. Kakade, Rahul Kidambi, Yin Tat Lee, Praneeth Netrapalli, Aaron Sidford |
| 2020 | Mixing Time Estimation in Ergodic Markov Chains from a Single Trajectory with Contraction Methods. Geoffrey Wolfer |
| 2020 | On Learnability wih Computable Learners. Sushant Agarwal, Nivasini Ananthakrishnan, Shai Ben-David, Tosca Lechner, Ruth Urner |
| 2020 | On Learning Causal Structures from Non-Experimental Data without Any Faithfulness Assumption. Hanti Lin, Jiji Zhang |
| 2020 | On the Analysis of EM for truncated mixtures of two Gaussians. Sai Ganesh Nagarajan, Ioannis Panageas |
| 2020 | On the Complexity of Proper Distribution-Free Learning of Linear Classifiers. Philip M. Long, Raphael J. Long |
| 2020 | On the Expressive Power of Kernel Methods and the Efficiency of Kernel Learning by Association Schemes. Pravesh K. Kothari, Roi Livni |
| 2020 | Online Non-Convex Learning: Following the Perturbed Leader is Optimal. Arun Sai Suggala, Praneeth Netrapalli |
| 2020 | Optimal $δ$-Correct Best-Arm Selection for Heavy-Tailed Distributions. Shubhada Agrawal, Sandeep Juneja, Peter W. Glynn |
| 2020 | Optimal multiclass overfitting by sequence reconstruction from Hamming queries. Jayadev Acharya, Ananda Theertha Suresh |
| 2020 | Planning in Hierarchical Reinforcement Learning: Guarantees for Using Local Policies. Tom Zahavy, Avinatan Hassidim, Haim Kaplan, Yishay Mansour |
| 2020 | Privately Answering Classification Queries in the Agnostic PAC Model. Anupama Nandi, Raef Bassily |
| 2020 | Robust Algorithms for Online k-means Clustering. Aditya Bhaskara, Aravinda Kanchana Ruwanpathirana |
| 2020 | Robust guarantees for learning an autoregressive filter. Holden Lee, Cyril Zhang |
| 2020 | Sampling Without Compromising Accuracy in Adaptive Data Analysis. Benjamin Fish, Lev Reyzin, Benjamin I. P. Rubinstein |
| 2020 | Solving Bernoulli Rank-One Bandits with Unimodal Thompson Sampling. Cindy Trinh, Emilie Kaufmann, Claire Vernade, Richard Combes |
| 2020 | The Nonstochastic Control Problem. Elad Hazan, Sham M. Kakade, Karan Singh |
| 2020 | Thompson Sampling for Adversarial Bit Prediction. Yuval Lewi, Haim Kaplan, Yishay Mansour |
| 2020 | Top- Idan Rejwan, Yishay Mansour |
| 2020 | Toward universal testing of dynamic network models. Abram Magner, Wojciech Szpankowski |
| 2020 | What relations are reliably embeddable in Euclidean space? Robi Bhattacharjee, Sanjoy Dasgupta |