Papers
Prediction by random-walk perturbation
Luc Devroye, Gábor Lugosi, Gergely Neu
Sparse Adaptive Dirichlet-Multinomial-like Processes
Marcus Hutter
Learning Using Local Membership Queries
Pranjal Awasthi, Vitaly Feldman, Varun Kanade
PLAL: Cluster-based active learning
Ruth Urner, Sharon Wulff, Shai Ben-David
Algorithms and Hardness for Robust Subspace Recovery
Moritz Hardt, Ankur Moitra
Randomized partition trees for exact nearest neighbor search
Sanjoy Dasgupta, Kaushik Sinha
Active and passive learning of linear separators under log-concave distributions
Maria-Florina Balcan, Phil Long
Blind Signal Separation in the Presence of Gaussian Noise
Mikhail Belkin, Luis Rademacher, James Voss
Passive Learning with Target Risk
Mehrdad Mahdavi, Rong Jin
Information Complexity in Bandit Subset Selection
Emilie Kaufmann, Shivaram Kalyanakrishnan
Beating Bandits in Gradually Evolving Worlds
Chao-Kai Chiang, Chia-Jung Lee, Chi-Jen Lu
Online Learning for Time Series Prediction
Oren Anava, Elad Hazan, Shie Mannor et al.
Opportunistic Strategies for Generalized No-Regret Problems
Andrey Bernstein, Shie Mannor, Nahum Shimkin
Recovering the Optimal Solution by Dual Random Projection
Lijun Zhang, Mehrdad Mahdavi, Rong Jin et al.
Bounded regret in stochastic multi-armed bandits
Sébastien Bubeck, Vianney Perchet, Philippe Rigollet
The price of bandit information in multiclass online classification
Amit Daniely, Tom Helbertal
Honest Compressions and Their Application to Compression Schemes
Roi Livni, Pierre Simon
Excess risk bounds for multitask learning with trace norm regularization
Massimiliano Pontil, Andreas Maurer
A Theoretical Analysis of NDCG Type Ranking Measures
Yining Wang, Liwei Wang, Yuanzhi Li et al.
Open Problem: Lower bounds for Boosting with Hadamard Matrices
Jiazhong Nie, Manfred K. Warmuth, S.V.N. Vishwanathan et al.