Papers
316 papers found
Distributed Online Learning for Joint Regret with Communication Constraints
Dirk Van der Hoeven, Hédi Hadiji, Tim van Erven
Efficient and Optimal Algorithms for Contextual Dueling Bandits under Realizability
Aadirupa Saha, Akshay Krishnamurthy
Efficient and Optimal Fixed-Time Regret with Two Experts
Laura Greenstreet, Nicholas J. A. Harvey, Victor Sanches Portella
Efficient local planning with linear function approximation
Dong Yin, Botao Hao, Yasin Abbasi-Yadkori et al.
Efficient Methods for Online Multiclass Logistic Regression
Naman Agarwal, Satyen Kale, Julian Zimmert
Faster Noisy Power Method
Zhiqiang Xu, Ping Li
Faster Perturbed Stochastic Gradient Methods for Finding Local Minima
Zixiang Chen, Dongruo Zhou, Quanquan Gu
Faster Rates of Private Stochastic Convex Optimization
Jinyan Su, Lijie Hu, Di Wang
Global Riemannian Acceleration in Hyperbolic and Spherical Spaces
David Martínez-Rubio
Implicit Parameter-free Online Learning with Truncated Linear Models
Keyi Chen, Ashok Cutkosky, Francesco Orabona
Inductive Bias of Gradient Descent for Weight Normalized Smooth Homogeneous Neural Nets
Depen Morwani, Harish G. Ramaswamy
Infinitely Divisible Noise in the Low Privacy Regime
Rasmus Pagh, Nina Mesing Stausholm
Iterated Vector Fields and Conservatism, with Applications to Federated Learning
Zachary Charles, Keith Rush
Learning what to remember
Robi Bhattacharjee, Gaurav Mahajan
Learning with Distributional Inverters
Eric Binnendyk, Marco Carmosino, Antonina Kolokolova et al.
Leveraging Initial Hints for Free in Stochastic Linear Bandits
Ashok Cutkosky, Chris Dann, Abhimanyu Das et al.
Limiting Behaviors of Nonconvex-Nonconcave Minimax Optimization via Continuous-Time Systems
Benjamin Grimmer, Haihao Lu, Pratik Worah et al.
Lower Bounds on the Total Variation Distance Between Mixtures of Two Gaussians
Sami Davies, Arya Mazumdar, Soumyabrata Pal et al.
Metric Entropy Duality and the Sample Complexity of Outcome Indistinguishability
Lunjia Hu, Charlotte Peale, Omer Reingold
Minimization by Incremental Stochastic Surrogate Optimization for Large Scale Nonconvex Problems
Belhal Karimi, Hoi-To Wai, Eric Moulines et al.
Multicalibrated Partitions for Importance Weights
Parikshit Gopalan, Omer Reingold, Vatsal Sharan et al.
On the Initialization for Convex-Concave Min-max Problems
Mingrui Liu, Francesco Orabona
On the Last Iterate Convergence of Momentum Methods
Xiaoyu Li, Mingrui Liu, Francesco Orabona
Polynomial-Time Sum-of-Squares Can Robustly Estimate Mean and Covariance of Gaussians Optimally
Pravesh K. Kothari, Peter Manohar, Brian Hu Zhang