Papers
316 papers found
Sample Compression for Real-Valued Learners
Steve Hanneke, Aryeh Kontorovich, Menachem Sadigurschi
Stochastic Nonconvex Optimization with Large Minibatches
Weiran Wang, Nathan Srebro
Two-Player Games for Efficient Non-Convex Constrained Optimization
Andrew Cotter, Heinrich Jiang, Karthik Sridharan
Uniform regret bounds over $\mathbb{R}^d$ for the sequential linear regression problem with the square loss
Pierre Gaillard, Sébastien Gerchinovitz, Malo Huard et al.
A Better Resource Allocation Algorithm with Semi-Bandit Feedback
Yuval Dagan, Crammer Koby
Adaptive Group Testing Algorithms to Estimate the Number of Defectives
Nader H. Bshouty, Vivian E. Bshouty-Hurani, George Haddad et al.
An Adaptive Strategy for Active Learning with Smooth Decision Boundary
Andrea Locatelli, Alexandra Carpentier, Samory Kpotufe
Bandit Regret Scaling with the Effective Loss Range
Nicolò Cesa-Bianchi, Ohad Shamir
Clustering Algorithms for the Centralized and Local Models
Kobbi Nissim, Uri Stemmer
Convergence of Langevin MCMC in KL-divergence
Xiang Cheng, Peter Bartlett
Coordinate Descent Faceoff: Primal or Dual?
Dominik Csiba, Peter Richtárik
Corrupt Bandits for Preserving Local Privacy
Pratik Gajane, Tanguy Urvoy, Emilie Kaufmann
Decision making with limited feedback
Danielle Ensign, Frielder Sorelle, Neville Scott et al.
Dimension-free Information Concentration via Exp-Concavity
Ya-ping Hsieh, Volkan Cevher
Efficient coordinate-wise leading eigenvector computation
Jialei Wang, Weiran Wang, Dan Garber et al.
Instrument-Armed Bandits
Nathan Kallus
Learners that Use Little Information
Raef Bassily, Shay Moran, Ido Nachum et al.
Learning Decision Trees with Stochastic Linear Classifiers
Tom Jurgenson, Yishay Mansour
Learning under $p$-Tampering Attacks
Saeed Mahloujifar, Dimitrios I. Diochnos, Mohammad Mahmoody
Markov Decision Processes with Continuous Side Information
Aditya Modi, Nan Jiang, Satinder Singh et al.
Minimax Optimal Bayes Mixtures for Memoryless Sources over Large Alphabets
Elias Jääsaari, Janne Leppä-aho, Tomi Silander et al.
Minimax Rates and Efficient Algorithms for Noisy Sorting
Cheng Mao, Jonathan Weed, Philippe Rigollet
{Multi-Player Bandits Revisited}
Lilian Besson, Emilie Kaufmann
Multi-task {K}ernel {L}earning Based on {P}robabilistic {L}ipschitzness
Anastasia Pentina, Shai Ben-David