Papers
Robust approachability and regret minimization in games with partial monitoring
Shie Mannor, Vianney Perchet, Gilles Stoltz
A Finite-Time Analysis of Multi-armed Bandits Problems with Kullback-Leibler Divergences
Odalric-Ambrym Maillard, Rémi Munos, Gilles Stoltz
Maximum Likelihood vs. Sequential Normalized Maximum Likelihood in On-line Density Estimation
Wojciech Kotłowski, Peter Grünwald
A Close Look to Margin Complexity and Related Parameters
Michael Kallweit, Hans Ulrich Simon
Sparsity Regret Bounds for Individual Sequences in Online Linear Regression
Sébastien Gerchinovitz
The KL-UCB Algorithm for Bounded Stochastic Bandits and Beyond
Aurélien Garivier, Olivier Cappé
On the Consistency of Multi-Label Learning
Wei Gao, Zhi-Hua Zhou
Concentration-Based Guarantees for Low-Rank Matrix Reconstruction
Rina Foygel, Nathan Srebro
Complexity-Based Approach to Calibration with Checking Rules
Dean P. Foster, Alexander Rakhlin, Karthik Sridharan et al.
Lower Bounds and Hardness Amplification for Learning Shallow Monotone Formulas
Vitaly Feldman, Homin K. Lee, Rocco A. Servedio
Mixability is Bayes Risk Curvature Relative to Log Loss
Tim Erven, Mark D. Reid, Robert C. Williamson
Multiclass Learnability and the ERM principle
Amit Daniely, Sivan Sabato, Shai Ben-David et al.
Tight conditions for consistent variable selection in high dimensional nonparametric regression
Laëtitia Comminges, Arnak S. Dalalyan
Sample Complexity Bounds for Differentially Private Learning
Kamalika Chaudhuri, Daniel Hsu
Minimax Regret of Finite Partial-Monitoring Games in Stochastic Environments
Gábor Bartók, Dávid Pál, Csaba Szepesvári
Minimax Policies for Combinatorial Prediction Games
Jean-Yves Audibert, Sébastien Bubeck, Gábor Lugosi
Bandits, Query Learning, and the Haystack Dimension
Kareem Amin, Michael Kearns, Umar Syed
Oracle inequalities for computationally budgeted model selection
Alekh Agarwal, John C. Duchi, Peter L. Bartlett et al.
Competitive Closeness Testing
Jayadev Acharya, Hirakendu Das, Ashkan Jafarpour et al.
Blackwell Approachability and No-Regret Learning are Equivalent
Jacob Abernethy, Peter L. Bartlett, Elad Hazan
Regret Bounds for the Adaptive Control of Linear Quadratic Systems
Yasin Abbasi-Yadkori, Csaba Szepesvári