Papers
316 papers found
Online Non-Convex Learning: Following the Perturbed Leader is Optimal
Arun Sai Suggala, Praneeth Netrapalli
On the Analysis of EM for truncated mixtures of two Gaussians
Sai Ganesh Nagarajan, Ioannis Panageas
On the Complexity of Proper Distribution-Free Learning of Linear Classifiers
Philip M. Long, Raphael J. Long
On the Expressive Power of Kernel Methods and the Efficiency of Kernel Learning by Association Schemes
Kothari K. Pravesh, Livni Roi
Optimal $δ$-Correct Best-Arm Selection for Heavy-Tailed Distributions
Shubhada Agrawal, Sandeep Juneja, Peter Glynn
Optimal multiclass overfitting by sequence reconstruction from Hamming queries
Jayadev Acharya, Ananda Theertha Suresh
Planning in Hierarchical Reinforcement Learning: Guarantees for Using Local Policies
Tom Zahavy, Avinatan Hasidim, Haim Kaplan et al.
Privately Answering Classification Queries in the Agnostic PAC Model
Anupama Nandi, Raef Bassily
Robust Algorithms for Online $k$-means Clustering
Aditya Bhaskara, Aravinda Kanchana Ruwanpathirana
Robust guarantees for learning an autoregressive filter
Holden Lee, Cyril Zhang
Sampling Without Compromising Accuracy in Adaptive Data Analysis
Benjamin Fish, Lev Reyzin, Benjamin I. P. Rubinstein
Solving Bernoulli Rank-One Bandits with Unimodal Thompson Sampling
Cindy Trinh, Emilie Kaufmann, Claire Vernade et al.
The Nonstochastic Control Problem
Elad Hazan, Sham Kakade, Karan Singh
Thompson Sampling for Adversarial Bit Prediction
Yuval Lewi, Haim Kaplan, Yishay Mansour
Top-$k$ Combinatorial Bandits with Full-Bandit Feedback
Idan Rejwan, Yishay Mansour
Toward universal testing of dynamic network models
Abram Magner, Wojciech Szpankowski
What relations are reliably embeddable in Euclidean space?
Robi Bhattacharjee, Sanjoy Dasgupta
Adaptive Exact Learning of Decision Trees from Membership Queries
Nader H. Bshouty, Catherine A. Haddad-Zaknoon
A minimax near-optimal algorithm for adaptive rejection sampling
Juliette Achddou, Joseph Lam-Weil, Alexandra Carpentier et al.
An Exponential Efron-Stein Inequality for $L_q$ Stable Learning Rules
Karim Abou-Moustafa, Csaba Szepesvári
A Sharp Lower Bound for Agnostic Learning with Sample Compression Schemes
Steve Hanneke, Aryeh Kontorovich
A simple parameter-free and adaptive approach to optimization under a minimal local smoothness assumption
Peter L. Bartlett, Victor Gabillon, Michal Valko
A tight excess risk bound via a unified PAC-Bayesian–Rademacher–Shtarkov–MDL complexity
Peter D. Grünwald, Nishant A. Mehta