Papers
A Tale of Two Metrics: Simultaneous Bounds on Competitiveness and Regret
Lachlan Andrew, Siddharth Barman, Katrina Ligett et al.
Representation, Approximation and Learning of Submodular Functions Using Low-rank Decision Trees
Vitaly Feldman, Pravesh Kothari, Jan Vondrák
Online Similarity Prediction of Networked Data from Known and Unknown Graphs
Claudio Gentile, Mark Herbster, Stephen Pasteris
Horizon-Independent Optimal Prediction with Log-Loss in Exponential Families
Peter Bartlett, Peter Grünwald, Peter Harremoës et al.
Regret Minimization for Branching Experts
Eyal Gofer, Nicolò Cesa-Bianchi, Claudio Gentile et al.
Divide and Conquer Kernel Ridge Regression
Yuchen Zhang, John Duchi, Martin Wainwright
Consistency of Robust Kernel Density Estimators
Robert Vandermeulen, Clayton Scott
Subspace Embeddings and \ell_p-Regression Using Exponential Random Variables
David Woodruff, Qin Zhang
Learning Halfspaces Under Log-Concave Densities: Polynomial Approximations and Moment Matching
Daniel Kane, Adam Klivans, Raghu Meka
General Oracle Inequalities for Gibbs Posterior with Application to Ranking
Cheng Li, Wenxin Jiang, Martin Tanner
Classification with Asymmetric Label Noise: Consistency and Maximal Denoising
Clayton Scott, Gilles Blanchard, Gregory Handy
Approachability, fast and slow
Vianney Perchet, Shie Mannor
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