Home Page





Editorial Board



Open Source Software



RSS Feed

JMLR Workshop and Conference Proceedings

Volume 30 : Conference on Learning Theory

Editors: Shai Shalev-Shwartz and Ingo Steinwart




Shai Shalev-Shwartz, Ingo Steinwart ; JMLR W&CP 30:1-2, 2013

Regular Papers

On the Complexity of Bandit and Derivative-Free Stochastic Convex Optimization

Ohad Shamir ; JMLR W&CP 30:3-24, 2013

A Theoretical Analysis of NDCG Type Ranking Measures

Yining Wang, Liwei Wang, Yuanzhi Li, Di He, Tie-Yan Liu ; JMLR W&CP 30:25-54, 2013

Excess risk bounds for multitask learning with trace norm regularization

Massimiliano Pontil, Andreas Maurer ; JMLR W&CP 30:55-76, 2013

Honest Compressions and Their Application to Compression Schemes

Roi Livni, Pierre Simon ; JMLR W&CP 30:77-92, 2013

The price of bandit information in multiclass online classification

Amit Daniely, Tom Helbertal ; JMLR W&CP 30:93-104, 2013

Estimation of Extreme Values and Associated Level Sets of a Regression Function via Selective Sampling

Stanislav Minsker ; JMLR W&CP 30:105-121, 2013

Bounded regret in stochastic multi-armed bandits

Sébastien Bubeck, Vianney Perchet, Philippe Rigollet ; JMLR W&CP 30:122-134, 2013

Recovering the Optimal Solution by Dual Random Projection

Lijun Zhang, Mehrdad Mahdavi, Rong Jin, Tianbao Yang, Shenghuo Zhu ; JMLR W&CP 30:135-157, 2013

Opportunistic Strategies for Generalized No-Regret Problems

Andrey Bernstein, Shie Mannor, Nahum Shimkin ; JMLR W&CP 30:158-171, 2013

Online Learning for Time Series Prediction

Oren Anava, Elad Hazan, Shie Mannor, Ohad Shamir ; JMLR W&CP 30:172-184, 2013

Sharp analysis of low-rank kernel matrix approximations

Francis Bach ; JMLR W&CP 30:185-209, 2013

Beating Bandits in Gradually Evolving Worlds

Chao-Kai Chiang, Chia-Jung Lee, Chi-Jen Lu ; JMLR W&CP 30:210-227, 2013

Information Complexity in Bandit Subset Selection

Emilie Kaufmann, Shivaram Kalyanakrishnan ; JMLR W&CP 30:228-251, 2013

Passive Learning with Target Risk

Mehrdad Mahdavi, Rong Jin ; JMLR W&CP 30:252-269, 2013

Blind Signal Separation in the Presence of Gaussian Noise

Mikhail Belkin, Luis Rademacher, James Voss ; JMLR W&CP 30:270-287, 2013

Active and passive learning of linear separators under log-concave distributions

Maria-Florina Balcan, Phil Long ; JMLR W&CP 30:288-316, 2013

Randomized partition trees for exact nearest neighbor search

Sanjoy Dasgupta, Kaushik Sinha ; JMLR W&CP 30:317-337, 2013

Surrogate Regret Bounds for the Area Under the ROC Curve via Strongly Proper Losses

Shivani Agarwal ; JMLR W&CP 30:338-353, 2013

Algorithms and Hardness for Robust Subspace Recovery

Moritz Hardt, Ankur Moitra ; JMLR W&CP 30:354-375, 2013

PLAL: Cluster-based active learning

Ruth Urner, Sharon Wulff, Shai Ben-David ; JMLR W&CP 30:376-397, 2013

Learning Using Local Membership Queries

Pranjal Awasthi, Vitaly Feldman, Varun Kanade ; JMLR W&CP 30:398-431, 2013

Sparse Adaptive Dirichlet-Multinomial-like Processes

Marcus Hutter ; JMLR W&CP 30:432-459, 2013

Prediction by random-walk perturbation

Luc Devroye, Gábor Lugosi, Gergely Neu ; JMLR W&CP 30:460-473, 2013

Approachability, fast and slow

Vianney Perchet, Shie Mannor ; JMLR W&CP 30:474-488, 2013

Classification with Asymmetric Label Noise: Consistency and Maximal Denoising

Clayton Scott, Gilles Blanchard, Gregory Handy ; JMLR W&CP 30:489-511, 2013

General Oracle Inequalities for Gibbs Posterior with Application to Ranking

Cheng Li, Wenxin Jiang, Martin Tanner ; JMLR W&CP 30:512-521, 2013

Learning Halfspaces Under Log-Concave Densities: Polynomial Approximations and Moment Matching

Daniel Kane, Adam Klivans, Raghu Meka ; JMLR W&CP 30:522-545, 2013

Subspace Embeddings and \(\ell_p\)-Regression Using Exponential Random Variables

David Woodruff, Qin Zhang ; JMLR W&CP 30:546-567, 2013

Consistency of Robust Kernel Density Estimators

Robert Vandermeulen, Clayton Scott ; JMLR W&CP 30:568-591, 2013

Divide and Conquer Kernel Ridge Regression

Yuchen Zhang, John Duchi, Martin Wainwright ; JMLR W&CP 30:592-617, 2013

Regret Minimization for Branching Experts

Eyal Gofer, Nicolò Cesa-Bianchi, Claudio Gentile, Yishay Mansour ; JMLR W&CP 30:618-638, 2013

Horizon-Independent Optimal Prediction with Log-Loss in Exponential Families

Peter Bartlett, Peter Grünwald, Peter Harremoës, Fares Hedayati, Wojciech Kotlowski ; JMLR W&CP 30:639-661, 2013

Online Similarity Prediction of Networked Data from Known and Unknown Graphs

Claudio Gentile, Mark Herbster, Stephen Pasteris ; JMLR W&CP 30:662-695, 2013

A near-optimal algorithm for finite partial-monitoring games against adversarial opponents

Gábor Bartók ; JMLR W&CP 30:696-710, 2013

Representation, Approximation and Learning of Submodular Functions Using Low-rank Decision Trees

Vitaly Feldman, Pravesh Kothari, Jan Vondrák ; JMLR W&CP 30:711-740, 2013

A Tale of Two Metrics: Simultaneous Bounds on Competitiveness and Regret

Lachlan Andrew, Siddharth Barman, Katrina Ligett, Minghong Lin, Adam Meyerson, Alan Roytman, Adam Wierman ; JMLR W&CP 30:741-763, 2013

Optimal Probability Estimation with Applications to Prediction and Classification

Jayadev Acharya, Ashkan Jafarpour, Alon Orlitsky, Ananda Theertha Suresh ; JMLR W&CP 30:764-796, 2013

Polynomial Time Optimal Query Algorithms for Finding Graphs with Arbitrary Real Weights

Sung-Soon Choi ; JMLR W&CP 30:797-818, 2013

Differentially Private Feature Selection via Stability Arguments, and the Robustness of the Lasso

Abhradeep Guha Thakurta, Adam Smith ; JMLR W&CP 30:819-850, 2013

Learning a set of directions

Wouter M. Koolen, Jiazhong Nie, Manfred Warmuth ; JMLR W&CP 30:851-866, 2013

A Tensor Spectral Approach to Learning Mixed Membership Community Models

Animashree Anandkumar, Rong Ge, Daniel Hsu, Sham Kakade ; JMLR W&CP 30:867-881, 2013

Adaptive Crowdsourcing Algorithms for the Bandit Survey Problem

Ittai Abraham, Omar Alonso, Vasilis Kandylas, Aleksandrs Slivkins ; JMLR W&CP 30:882-910, 2013

Boosting with the Logistic Loss is Consistent

Matus Telgarsky ; JMLR W&CP 30:911-965, 2013

Competing With Strategies

Wei Han, Alexander Rakhlin, Karthik Sridharan ; JMLR W&CP 30:966-992, 2013

Online Learning with Predictable Sequences

Alexander Rakhlin, Karthik Sridharan ; JMLR W&CP 30:993-1019, 2013

Efficient Learning of Simplices

Joseph Anderson, Navin Goyal, Luis Rademacher ; JMLR W&CP 30:1020-1045, 2013

Complexity Theoretic Lower Bounds for Sparse Principal Component Detection

Quentin Berthet, Philippe Rigollet ; JMLR W&CP 30:1046-1066, 2013

Open Problems

Open Problem: Adversarial Multiarmed Bandits with Limited Advice

Yevgeny Seldin, Koby Crammer, Peter Bartlett ; JMLR W&CP 30:1067-1072, 2013

Open Problem: Fast Stochastic Exp-Concave Optimization

Tomer Koren ; JMLR W&CP 30:1073-1075, 2013

Open Problem: Lower bounds for Boosting with Hadamard Matrices

Jiazhong Nie, Manfred K. Warmuth, S.V.N. Vishwanathan, Xinhua Zhang ; JMLR W&CP 30:1076-1079, 2013