Papers
316 papers found
Efficient sampling from the Bingham distribution
Rong Ge, Holden Lee, Jianfeng Lu et al.
Episodic Reinforcement Learning in Finite MDPs: Minimax Lower Bounds Revisited
Omar Darwiche Domingues, Pierre Ménard, Emilie Kaufmann et al.
Estimating Smooth GLM in Non-interactive Local Differential Privacy Model with Public Unlabeled Data
Di Wang, Huangyu Zhang, Marco Gaboardi et al.
Estimating Sparse Discrete Distributions Under Privacy and Communication Constraints
Jayadev Acharya, Peter Kairouz, Yuhan Liu et al.
Exponential Lower Bounds for Planning in MDPs With Linearly-Realizable Optimal Action-Value Functions
Gellért Weisz, Philip Amortila, Csaba Szepesvári
Intervention Efficient Algorithms for Approximate Learning of Causal Graphs
Raghavendra Addanki, Andrew McGregor, Cameron Musco
Last-Iterate Convergence Rates for Min-Max Optimization: Convergence of Hamiltonian Gradient Descent and Consensus Optimization
Jacob Abernethy, Kevin A. Lai, Andre Wibisono
Last Round Convergence and No-Dynamic Regret in Asymmetric Repeated Games
Le Cong Dinh, Tri-Dung Nguyen, Alain B. Zemhoho et al.
Learning a mixture of two subspaces over finite fields
Aidao Chen, Anindya De, Aravindan Vijayaraghavan
Learning and Testing Irreducible Markov Chains via the $k$-Cover Time
Siu On Chan, Qinghua Ding, Sing Hei Li
Learning with Comparison Feedback: Online Estimation of Sample Statistics
Michela Meister, Sloan Nietert
Near-tight Closure Bounds for the Littlestone and Threshold Dimensions
Badih Ghazi, Noah Golowich, Ravi Kumar et al.
Non-uniform Consistency of Online Learning with Random Sampling
Changlong Wu, Narayana Santhanam
No-substitution k-means Clustering with Adversarial Order
Robi Bhattacharjee, Michal Moshkovitz
Online Boosting with Bandit Feedback
Nataly Brukhim, Elad Hazan
Online Learning of Facility Locations
Stephen Pasteris, Ting He, Fabio Vitale et al.
On the Sample Complexity of Privately Learning Unbounded High-Dimensional Gaussians
Ishaq Aden-Ali, Hassan Ashtiani, Gautam Kamath
Precise Minimax Regret for Logistic Regression with Categorical Feature Values
Philippe Jacquet, Gil Shamir, Wojciech Szpankowski
Sample Complexity Bounds for Stochastic Shortest Path with a Generative Model
Jean Tarbouriech, Matteo Pirotta, Michal Valko et al.
Self-Tuning Bandits over Unknown Covariate-Shifts
Joseph Suk, Samory Kpotufe
Sequential prediction under log-loss with side information
Alankrita Bhatt, Young-Han Kim
Stable Sample Compression Schemes: New Applications and an Optimal SVM Margin Bound
Steve Hanneke, Aryeh Kontorovich
Statistical guarantees for generative models without domination
Nicolas Schreuder, Victor-Emmanuel Brunel, Arnak Dalalyan
Stochastic Dueling Bandits with Adversarial Corruption
Arpit Agarwal, Shivani Agarwal, Prathamesh Patil
Stochastic Top-$K$ Subset Bandits with Linear Space and Non-Linear Feedback
Mridul Agarwal, Vaneet Aggarwal, Christopher J. Quinn et al.