| 2023 | Limitations of Information-Theoretic Generalization Bounds for Gradient Descent Methods in Stochastic Convex Optimization. | Mahdi Haghifam, Borja Rodrguez Glvez, Ragnar Thobaben, Mikael Skoglund, Daniel M. Roy, Gintare Karolina Dziugaite |
| 2023 | Online Learning for Traffic Navigation in Congested Networks. | Sreenivas Gollapudi, Kostas Kollias, Chinmay Maheshwari, Manxi Wu |
| 2023 | Online Learning with Off-Policy Feedback. | Germano Gabbianelli, Gergely Neu, Matteo Papini |
| 2023 | SQ Lower Bounds for Random Sparse Planted Vector Problem. | Jingqiu Ding, Yiding Hua |
| 2023 | A Unified Algorithm for Stochastic Path Problems. | Christoph Dann, Chen-Yu Wei, Julian Zimmert |
| 2023 | Pseudonorm Approachability and Applications to Regret Minimization. | Christoph Dann, Yishay Mansour, Mehryar Mohri, Jon Schneider, Balasubramanian Sivan |
| 2023 | Wide stochastic networks: Gaussian limit and PAC-Bayesian training. | Eugenio Clerico, George Deligiannidis, Arnaud Doucet |
| 2023 | Robust Estimation of Discrete Distributions under Local Differential Privacy. | Julien Chhor, Flore Sentenac |
| 2023 | Fisher information lower bounds for sampling. | Sinho Chewi, Patrik Gerber, Holden Lee, Chen Lu |
| 2023 | On the complexity of finding stationary points of smooth functions in one dimension. | Sinho Chewi, Sbastien Bubeck, Adil Salim |
| 2023 | Reaching Goals is Hard: Settling the Sample Complexity of the Stochastic Shortest Path. | Liyu Chen, Andrea Tirinzoni, Matteo Pirotta, Alessandro Lazaric |
| 2023 | Spatially Adaptive Online Prediction of Piecewise Regular Functions. | Sabyasachi Chatterjee, Subhajit Goswami |
| 2023 | A Query Algorithm for Learning a Spanning Forest in Weighted Undirected Graphs. | Deeparnab Chakrabarty, Hang Liao |
| 2023 | The Replicator Dynamic, Chain Components and the Response Graph. | Oliver Biggar, Iman Shames |
| 2023 | Online k-means Clustering on Arbitrary Data Streams. | Robi Bhattacharjee, Jacob Imola, Michal Moshkovitz, Sanjoy Dasgupta |
| 2023 | Robust Empirical Risk Minimization with Tolerance. | Robi Bhattacharjee, Max Hopkins, Akash Kumar, Hantao Yu, Kamalika Chaudhuri |
| 2023 | On Best-Arm Identification with a Fixed Budget in Non-Parametric Multi-Armed Bandits. | Antoine Barrier, Aurlien Garivier, Gilles Stoltz |
| 2023 | Adversarially Robust Learning with Tolerance. | Hassan Ashtiani, Vinayak Pathak, Ruth Urner |
| 2023 | Reconstructing Ultrametric Trees from Noisy Experiments. | Eshwar Ram Arunachaleswaran, Anindya De, Sampath Kannan |
| 2023 | Testing Tail Weight of a Distribution Via Hazard Rate. | Maryam Aliakbarpour, Amartya Shankha Biswas, Kavya Ravichandran, Ronitt Rubinfeld |
| 2023 | Variance-Reduced Conservative Policy Iteration. | Naman Agarwal, Brian Bullins, Karan Singh |
| 2022 | Efficient local planning with linear function approximation. | Dong Yin, Botao Hao, Yasin Abbasi-Yadkori, Nevena Lazic, Csaba Szepesvri |
| 2022 | Faster Noisy Power Method. | Zhiqiang Xu, Ping Li |
| 2022 | Algorithmic Learning Theory 2022: Preface. | |
| 2022 | TensorPlan and the Few Actions Lower Bound for Planning in MDPs under Linear Realizability of Optimal Value Functions. | Gellrt Weisz, Csaba Szepesvri, Andrs Gyrgy |