Home Page

Papers

Submissions

News

Editorial Board

Announcements

Proceedings

Open Source Software

Search

Login



RSS Feed

JMLR Workshop and Conference Proceedings

Volume 35: Proceedings of The 27th Conference on Learning Theory

Editors: Maria Florina Balcan, Vitaly Feldman, Csaba Szepesvári

Contents:

Preface

Preface

Maria Florina Balcan, Csaba Szepesvári ; JMLR W&CP 35 :1-2, 2014

Regular Papers

Distribution-independent Reliable Learning

Varun Kanade, Justin Thaler ; JMLR W&CP 35 :3-24, 2014

Learning without concentration

Shahar Mendelson ; JMLR W&CP 35 :25-39, 2014

Uniqueness of Ordinal Embedding

Matthäus Kleindessner, Ulrike von Luxburg ; JMLR W&CP 35 :40-67, 2014

Bayes-Optimal Scorers for Bipartite Ranking

Aditya Krishna Menon, Robert C. Williamson ; JMLR W&CP 35 :68-106, 2014

Multiarmed Bandits With Limited Expert Advice

Satyen Kale ; JMLR W&CP 35 :107-122, 2014

Learning Sparsely Used Overcomplete Dictionaries

Alekh Agarwal, Animashree Anandkumar, Prateek Jain, Praneeth Netrapalli, Rashish Tandon ; JMLR W&CP 35 :123-137, 2014

Community Detection via Random and Adaptive Sampling

Se-Young Yun, Alexandre Proutiere ; JMLR W&CP 35 :138-175, 2014

A second-order bound with excess losses

Pierre Gaillard, Gilles Stoltz, Tim van Erven ; JMLR W&CP 35 :176-196, 2014

Logistic Regression: Tight Bounds for Stochastic and Online Optimization

Elad Hazan, Tomer Koren, Kfir Y. Levy ; JMLR W&CP 35 :197-209, 2014

Higher-Order Regret Bounds with Switching Costs

Eyal Gofer ; JMLR W&CP 35 :210-243, 2014

The Complexity of Learning Halfspaces using Generalized Linear Methods

Amit Daniely, Nati Linial, Shai Shalev-Shwartz ; JMLR W&CP 35 :244-286, 2014

Optimal learners for multiclass problems

Amit Daniely, Shai Shalev-Shwartz ; JMLR W&CP 35 :287-316, 2014

Stochastic Regret Minimization via Thompson Sampling

Sudipto Guha, Kamesh Munagala ; JMLR W&CP 35 :317-338, 2014

Approachability in unknown games: Online learning meets multi-objective optimization

Shie Mannor, Vianney Perchet, Gilles Stoltz ; JMLR W&CP 35 :339-355, 2014

Belief propagation, robust reconstruction and optimal recovery of block models

Elchanan Mossel, Joe Neeman, Allan Sly ; JMLR W&CP 35 :356-370, 2014

Sample Compression for Multi-label Concept Classes

Rahim Samei, Pavel Semukhin, Boting Yang, Sandra Zilles ; JMLR W&CP 35 :371-393, 2014

Finding a most biased coin with fewest flips

Karthekeyan Chandrasekaran, Richard Karp ; JMLR W&CP 35 :394-407, 2014

Volumetric Spanners: an Efficient Exploration Basis for Learning

Elad Hazan, Zohar Karnin, Raghu Meka ; JMLR W&CP 35 :408-422, 2014

lil’ UCB : An Optimal Exploration Algorithm for Multi-Armed Bandits

Kevin Jamieson, Matthew Malloy, Robert Nowak, Sébastien Bubeck ; JMLR W&CP 35 :423-439, 2014

An Inequality with Applications to Structured Sparsity and Multitask Dictionary Learning

Andreas Maurer, Massimiliano Pontil, Bernardino Romera-Paredes ; JMLR W&CP 35 :440-460, 2014

On the Complexity of A/B Testing

Emilie Kaufmann, Olivier Cappé, Aurélien Garivier ; JMLR W&CP 35 :461-481, 2014

Elicitation and Identification of Properties

Ingo Steinwart, Chloé Pasin, Robert Williamson, Siyu Zhang ; JMLR W&CP 35 :482-526, 2014

The sample complexity of agnostic learning under deterministic labels

Shai Ben-David, Ruth Urner ; JMLR W&CP 35 :527-542, 2014

Density-preserving quantization with application to graph downsampling

Morteza Alamgir, Gábor Lugosi, Ulrike von Luxburg ; JMLR W&CP 35 :543-559, 2014

A Convex Formulation for Mixed Regression with Two Components: Minimax Optimal Rates

Yudong Chen, Xinyang Yi, Constantine Caramanis ; JMLR W&CP 35 :560-604, 2014

Efficiency of conformalized ridge regression

Evgeny Burnaev, Vladimir Vovk ; JMLR W&CP 35 :605-622, 2014

Most Correlated Arms Identification

Che-Yu Liu, Sébastien Bubeck ; JMLR W&CP 35 :623-637, 2014

Fast matrix completion without the condition number

Moritz Hardt, Mary Wootters ; JMLR W&CP 35 :638-678, 2014

Learning Coverage Functions and Private Release of Marginals

Vitaly Feldman, Pravesh Kothari ; JMLR W&CP 35 :679-702, 2014

Computational Limits for Matrix Completion

Moritz Hardt, Raghu Meka, Prasad Raghavendra, Benjamin Weitz ; JMLR W&CP 35 :703-725, 2014

Robust Multi-objective Learning with Mentor Feedback

Alekh Agarwal, Ashwinkumar Badanidiyuru, Miroslav Dudík, Robert E. Schapire, Aleksandrs Slivkins ; JMLR W&CP 35 :726-741, 2014

Uniqueness of Tensor Decompositions with Applications to Polynomial Identifiability

Aditya Bhaskara, Moses Charikar, Aravindan Vijayaraghavan ; JMLR W&CP 35 :742-778, 2014

New Algorithms for Learning Incoherent and Overcomplete Dictionaries

Sanjeev Arora, Rong Ge, Ankur Moitra ; JMLR W&CP 35 :779-806, 2014

Online Linear Optimization via Smoothing

Jacob Abernethy, Chansoo Lee, Abhinav Sinha, Ambuj Tewari ; JMLR W&CP 35 :807-823, 2014

Learning Mixtures of Discrete Product Distributions using Spectral Decompositions

Prateek Jain, Sewoong Oh ; JMLR W&CP 35 :824-856, 2014

Localized Complexities for Transductive Learning

Ilya Tolstikhin, Gilles Blanchard, Marius Kloft ; JMLR W&CP 35 :857-884, 2014

On the Consistency of Output Code Based Learning Algorithms for Multiclass Learning Problems

Harish G. Ramaswamy, Balaji Srinivasan Babu, Shivani Agarwal, Robert C. Williamson ; JMLR W&CP 35 :885-902, 2014

Edge Label Inference in Generalized Stochastic Block Models: from Spectral Theory to Impossibility Results

Jiaming Xu, Laurent Massoulié, Marc Lelarge ; JMLR W&CP 35 :903-920, 2014

Lower bounds on the performance of polynomial-time algorithms for sparse linear regression

Yuchen Zhang, Martin J. Wainwright, Michael I. Jordan ; JMLR W&CP 35 :921-948, 2014

Follow the Leader with Dropout Perturbations

Tim Van Erven, Wojciech Kotłowski, Manfred K. Warmuth ; JMLR W&CP 35 :949-974, 2014

Lipschitz Bandits: Regret Lower Bound and Optimal Algorithms

Stefan Magureanu, Richard Combes, Alexandre Proutiere ; JMLR W&CP 35 :975-999, 2014

Sample Complexity Bounds on Differentially Private Learning via Communication Complexity

Vitaly Feldman, David Xiao ; JMLR W&CP 35 :1000-1019, 2014

Unconstrained Online Linear Learning in Hilbert Spaces: Minimax Algorithms and Normal Approximations

H. Brendan McMahan, Francesco Orabona ; JMLR W&CP 35 :1020-1039, 2014

Principal Component Analysis and Higher Correlations for Distributed Data

Ravi Kannan, Santosh Vempala, David Woodruff ; JMLR W&CP 35 :1040-1057, 2014

Compressed Counting Meets Compressed Sensing

Ping Li, Cun-Hui Zhang, Tong Zhang ; JMLR W&CP 35 :1058-1077, 2014

The Geometry of Losses

Robert C. Williamson ; JMLR W&CP 35 :1078-1108, 2014

Resourceful Contextual Bandits

Ashwinkumar Badanidiyuru, John Langford, Aleksandrs Slivkins ; JMLR W&CP 35 :1109-1134, 2014

The More, the Merrier: the Blessing of Dimensionality for Learning Large Gaussian Mixtures

Joseph Anderson, Mikhail Belkin, Navin Goyal, Luis Rademacher, James Voss ; JMLR W&CP 35 :1135-1164, 2014

Near-Optimal Herding

Nick Harvey, Samira Samadi ; JMLR W&CP 35 :1165-1182, 2014

Faster and Sample Near-Optimal Algorithms for Proper Learning Mixtures of Gaussians

Constantinos Daskalakis, Gautam Kamath ; JMLR W&CP 35 :1183-1213, 2014

Online Learning with Composite Loss Functions

Ofer Dekel, Jian Ding, Tomer Koren, Yuval Peres ; JMLR W&CP 35 :1214-1231, 2014

Online Non-Parametric Regression

Alexander Rakhlin, Karthik Sridharan ; JMLR W&CP 35 :1232-1264, 2014

Open Problems

Open Problem: Tightness of maximum likelihood semidefinite relaxations

Afonso S. Bandeira, Yuehaw Khoo, Amit Singer ; JMLR W&CP 35 :1265-1267, 2014

Open Problem: A (missing) boosting-type convergence result for AdaBoost.MH with factorized multi-class classifiers

Balázs Kégl ; JMLR W&CP 35 :1268-1275, 2014

Open Problem: Finding Good Cascade Sampling Processes for the Network Inference Problem

Manuel Gomez-Rodriguez, Le Song, Bernhard Schoelkopf ; JMLR W&CP 35 :1276-1279, 2014

Open Problem: Tensor Decompositions: Algorithms up to the Uniqueness Threshold?

Aditya Bhaskara, Moses Charikar, Ankur Moitra, Aravindan Vijayaraghavan ; JMLR W&CP 35 :1280-1282, 2014

Open Problem: The Statistical Query Complexity of Learning Sparse Halfspaces

Vitaly Feldman ; JMLR W&CP 35 :1283-1289, 2014

Open Problem: Online Local Learning

Paul Christiano ; JMLR W&CP 35 :1290-1294, 2014

Open Problem: Shifting Experts on Easy Data

Manfred K. Warmuth, Wouter M. Koolen ; JMLR W&CP 35 :1295-1298, 2014

Open Problem: Efficient Online Sparse Regression

Satyen Kale ; JMLR W&CP 35 :1299-1301, 2014