COLT A*

44 papers

YearTitle / Authors
2011A Close Look to Margin Complexity and Related Parameters.
Michael Kallweit, Hans Ulrich Simon
2011A Finite-Time Analysis of Multi-armed Bandits Problems with Kullback-Leibler Divergences.
Odalric-Ambrym Maillard, Rémi Munos, Gilles Stoltz
2011A New Algorithm for Compressed Counting with Applications in Shannon Entropy Estimation in Dynamic Data.
Ping Li, Cun-Hui Zhang
2011A simple multi-armed bandit algorithm with optimal variation-bounded regret.
Elad Hazan, Satyen Kale
2011Adaptive Density Level Set Clustering.
Ingo Steinwart
2011Agnostic KWIK learning and efficient approximate reinforcement learning.
István Szita, Csaba Szepesvári
2011Bandits, Query Learning, and the Haystack Dimension.
Kareem Amin, Michael J. Kearns, Umar Syed
2011Beyond the regret minimization barrier: an optimal algorithm for stochastic strongly-convex optimization.
Elad Hazan, Satyen Kale
2011Blackwell Approachability and No-Regret Learning are Equivalent.
Jacob D. Abernethy, Peter L. Bartlett, Elad Hazan
2011Bounds on Individual Risk for Log-loss Predictors.
Peter D. Grünwald, Wojciech Kotlowski
2011COLT 2011 - The 24th Annual Conference on Learning Theory, June 9-11, 2011, Budapest, Hungary
Sham M. Kakade, Ulrike von Luxburg
2011Collaborative Filtering with the Trace Norm: Learning, Bounding, and Transducing.
Ohad Shamir, Shai Shalev-Shwartz
2011Competitive Closeness Testing.
Jayadev Acharya, Hirakendu Das, Ashkan Jafarpour, Alon Orlitsky, Shengjun Pan
2011Complexity-Based Approach to Calibration with Checking Rules.
Dean P. Foster, Alexander Rakhlin, Karthik Sridharan, Ambuj Tewari
2011Concentration-Based Guarantees for Low-Rank Matrix Reconstruction.
Rina Foygel, Nathan Srebro
2011Contextual Bandits with Similarity Information.
Aleksandrs Slivkins
2011Distribution-Independent Evolvability of Linear Threshold Functions.
Vitaly Feldman
2011Does an Efficient Calibrated Forecasting Strategy Exist?
Jacob D. Abernethy, Shie Mannor
2011Identifiability of Priors from Bounded Sample Sizes with Applications to Transfer Learning.
Liu Yang, Steve Hanneke, Jaime G. Carbonell
2011Lower Bounds and Hardness Amplification for Learning Shallow Monotone Formulas.
Vitaly Feldman, Homin K. Lee, Rocco A. Servedio
2011Maximum Likelihood vs. Sequential Normalized Maximum Likelihood in On-line Density Estimation.
Wojciech Kotlowski, Peter Grünwald
2011Minimax Algorithm for Learning Rotations.
Wojciech Kotlowski, Manfred K. Warmuth
2011Minimax Policies for Combinatorial Prediction Games.
Jean-Yves Audibert, Sébastien Bubeck, Gábor Lugosi
2011Minimax Regret of Finite Partial-Monitoring Games in Stochastic Environments.
Gábor Bartók, Dávid Pál, Csaba Szepesvári
2011Missing Information Impediments to Learnability.
Loizos Michael
2011Mixability is Bayes Risk Curvature Relative to Log Loss.
Tim van Erven, Mark D. Reid, Robert C. Williamson
2011Monotone multi-armed bandit allocations.
Aleksandrs Slivkins
2011Multiclass Learnability and the ERM principle.
Amit Daniely, Sivan Sabato, Shai Ben-David, Shai Shalev-Shwartz
2011Neyman-Pearson classification under a strict constraint.
Philippe Rigollet, Xin Tong
2011On the Consistency of Multi-Label Learning.
Wei Gao, Zhi-Hua Zhou
2011Online Learning: Beyond Regret.
Alexander Rakhlin, Karthik Sridharan, Ambuj Tewari
2011Optimal aggregation of affine estimators.
Joseph Salmon, Arnak S. Dalalyan
2011Oracle inequalities for computationally budgeted model selection.
Alekh Agarwal, John C. Duchi, Peter L. Bartlett, Clément Levrard
2011Preface.
Sham M. Kakade, Ulrike von Luxburg
2011Regret Bounds for the Adaptive Control of Linear Quadratic Systems.
Yasin Abbasi-Yadkori, Csaba Szepesvári
2011Robust approachability and regret minimization in games with partial monitoring.
Shie Mannor, Vianney Perchet, Gilles Stoltz
2011Safe Learning: bridging the gap between Bayes, MDL and statistical learning theory via empirical convexity.
Peter Grünwald, John Smith Jones, Jane de Winter, Élouise Smith
2011Sample Complexity Bounds for Differentially Private Learning.
Kamalika Chaudhuri, Daniel J. Hsu
2011Sequential Event Prediction with Association Rules.
Cynthia Rudin, Benjamin Letham, Ansaf Salleb-Aouissi, Eugene Kogan, David Madigan
2011Sparsity Regret Bounds for Individual Sequences in Online Linear Regression.
Sébastien Gerchinovitz
2011The KL-UCB Algorithm for Bounded Stochastic Bandits and Beyond.
Aurélien Garivier, Olivier Cappé
2011The Rate of Convergence of Adaboost.
Indraneel Mukherjee, Cynthia Rudin, Robert E. Schapire
2011The Sample Complexity of Dictionary Learning.
Daniel Vainsencher, Shie Mannor, Alfred M. Bruckstein
2011Tight conditions for consistent variable selection in high dimensional nonparametric regression.
Laëtitia Comminges, Arnak S. Dalalyan