Papers
Flickering Multi-Armed Bandits
Sourav Chakraborty, Amit Kiran Rege, Claire Monteleoni et al.
Invited Open Problem: Does Differential Privacy Make PAC Learning Much Harder?
Kobbi Nissim, Uri Stemmer, Eliad Tsfadia
Open Problem: Is Interaction Necessary for Order-Optimal 1-bit Mean Estimation?
Ivan Lau, Jonathan Scarlett
Invited Open Problem: Is the Power of Deep Learning over Linear Models Inherently Distribution Dependent?
Vitaly Feldman, Pritish Kamath, Nathan Srebro
Invited Open Problem: Online Optimization of Piecewise-Lipschitz Functions with Applications to Data-Driven Algorithm Design
Maria-Florina Balcan, Wesley Pegden, Dravyansh Sharma
Open Problem: How much overparametrization is needed for ALS in tensor decomposition?
Dionysis Arvanitakis, Vaidehi Srinivas, Aravindan Vijayaraghavan
Gradient-Variation Regret Bounds for Unconstrained Online Learning
Yuheng Zhao, Andrew Jacobsen, Nicolò Cesa-Bianchi et al.
Optimal Variance-Dependent Regret Bounds for Infinite-Horizon MDPs
Guy Zamir, Matthew Zurek, Yudong Chen
Distribution-Free Sequential Prediction with Abstentions
Jialin Yu, Moïse Blanchard
Learning Decision-Sufficient Representations for Linear Optimization
Yuhan Ye, Saurabh Amin, Asuman Özdağlar
Tight Sample Complexity of Transformers
Chenxiao Yang, Nathan Srebro, Zhiyuan Li
Optimism Stabilizes Thompson Sampling for Adaptive Inference
Shunxing Yan, Han Zhong
Worst-case Error Bounds for Online Learning of Smooth Functions
Weian (Andrew) Xie
Lyapunov-Based Sample Complexity Analysis for Weakly-Coupled MDPs (extended abstract)
Wu Tianhao, Matthew Zurek, Weina Wang et al.
Risk Comparisons in Linear Regression: Implicit Regularization Dominates Explicit Regularization (Extended Abstract)
Jingfeng Wu, Peter L. Bartlett, Sham M. Kakade et al.
Minimax Limits of k-Fold Cross-Validation via Majority
Ido Nachum, Ruediger Urbanke, Thomas Weinberger
Accelerated Convex Optimization via Hamiltonian Dynamics with Deterministic Integration Time
Xiuyuan Wang, Vishwak Srinivasan, Qiang Fu et al.
A simple, optimal and efficient algorithm for online exp-concave optimization
Yi-Han Wang, Peng Zhao, Zhi-Hua Zhou
Almost sure null bankruptcy of testing-by-betting strategies
Hongjian Wang, Shubhada Agrawal, Aaditya Ramdas
Fast Score-Based Sampling via Log-Concave Reductions
Martin J. Wainwright
Learning with Simulators: No Regret in a Computationally Bounded World
Sasha Voitovych, Abhishek Shetty, Noah Golowich et al.
The Geometry of Efficient Nonconvex Sampling
Santosh S. Vempala, Andre Wibisono
On-Average Stability of Multipass Preconditioned SGD and Effective Dimension
Simon Vary, Tyler Farghly, Ilja Kuzborskij et al.