Papers
Boosting with List-Decodable Codes
Addison Prairie, Li-Yang Tan
How Many Features Can a Language Model Store Under the Linear Representation Hypothesis?
Nikhil Garg, Jon Kleinberg, Kenny Peng
An Exponential Lower Bound for Spectral Density Estimation on Unweighted Graphs
Pan Peng, Yuyang Wang, Joy Qiping Yang et al.
Graph neural networks extrapolate out-of-distribution for shortest paths
Robert R. Nerem, Samantha Chen, Sanjoy Dasgupta et al.
Optimal Neural Network Approximation of Smooth Compositional Functions on Sets with Low Intrinsic Dimension
Thomas Nagler, Sophie Langer
On the Stability of Nonlinear Dynamics in GD and SGD: Beyond Quadratic Potentials
Rotem Mulayoff, Sebastian U. Stich
Steering diffusion models with quadratic rewards: a fine-grained analysis
Ankur Moitra, Andrej Risteski, Dhruv Rohatgi
On the implicit regularization of Langevin dynamics with projected noise
Govind Menon, Austin Stromme, Adrien Vacher
On the Gradient Complexity of Private Optimization with Private Oracles
Michael Menart, Aleksandar Nikolov
Differentially Private Language Generation and Identification in the Limit (Extended Abstract)
Anay Mehrotra, Grigoris Velegkas, Xifan Yu et al.
Language Generation with Infinite Contamination
Anay Mehrotra, Grigoris Velegkas, Xifan Yu et al.
On The Complexity of Best-Arm Identification in Non-Stationary Linear Bandits
Leo Maynard-Zhang, Zhihan Xiong, Kevin Jamieson et al.
Phase Transition in Convex Relaxations for Graph Alignment
Laurent Massoulié, Sushil Mahavir Varma, Louis Vassaux et al.
Online Market Making and the Value of Observing the Order Book
Davide Maran, Marcello Restelli
On the Power of Adaptivity for ε-Best Arm Identification in Linear Bandits
Arnab Maiti, Yunbei Xu, Kevin Jamieson
Polynomial-time sampling despite disorder chaos
Eric Ma, Tselil Schramm
Wedge Sampling: Efficient Tensor Completion with Nearly-Linear Sample Complexity
Hengrui Luo, Anna Ma, Ludovic Stephan et al.
Regret Minimization with Adaptive Opponents in Repeated Games
Mingyang Liu, Asuman Ozdaglar, Tiancheng Yu et al.
Online Learning for Uninformed Markov Games: Empirical Nash-Value Regret and Non-Stationarity Adaptation
Junyan Liu, Haipeng Luo, Zihan Zhang et al.
Fast algorithms for learning a Gaussian under halfspace truncation with optimal sample complexity
Haitong Liu, Deepak Narayanan Sridharan, David Steurer et al.
Optimal Learning Rate Schedules under Functional Scaling Laws: Power Decay and Warmup–Stable–Decay (Extended Abstract)
Binghui Li, Zilin Wang, Fengling Chen et al.
Second-Order Bounds for $[0,1]$-Valued Regression via Betting Loss
Yinan Li, Sungjoon Yoon, Ethan Huang et al.
Self-Concordant Perturbations for Linear Bandits
Lucas Lévy, Jean-Lou Valeau, Arya Akhavan et al.
A Single Stepsize Suffices for Unprojected Linear TD(0): Simultaneous Robust and Fast Rates via Polyak–Ruppert Averaging
Wei-Cheng Lee, Francesco Orabona