Volume 40: Conference on Learning Theory, 3-6 July 2015, Paris, France

[edit]

Editors: Peter Grünwald, Elad Hazan, Satyen Kale

[bib][citeproc]

Contents:

Preface

Conference on Learning Theory 2015: Preface

Peter Grünwald, Elad Hazan ; PMLR 40:1-3

Regular Papers

Open Problems

Open Problem: Restricted Eigenvalue Condition for Heavy Tailed Designs

Arindam Banerjee, Sheng Chen, Vidyashankar Sivakumar ; PMLR 40:1752-1755

Open Problem: The landscape of the loss surfaces of multilayer networks

Anna Choromanska, Yann LeCun, Gérard Ben Arous ; PMLR 40:1756-1760

Open Problem: The Oracle Complexity of Smooth Convex Optimization in Nonstandard Settings

Cristóbal Guzmán ; PMLR 40:1761-1763

Open Problem: Online Sabotaged Shortest Path

Wouter M. Koolen, Manfred K. Warmuth, Dmitri Adamskiy ; PMLR 40:1764-1766

Open Problem: Learning Quantum Circuits with Queries

Jeremy Kun, Lev Reyzin ; PMLR 40:1767-1769

Open Problem: Recursive Teaching Dimension Versus VC Dimension

Hans U. Simon, Sandra Zilles ; PMLR 40:1770-1772

On Consistent Surrogate Risk Minimization and Property Elicitation

Arpit Agarwal, Shivani Agarwal ; PMLR 40:4-22

Online Learning with Feedback Graphs: Beyond Bandits

Noga Alon, Nicolò Cesa-Bianchi, Ofer Dekel, Tomer Koren ; PMLR 40:23-35

Learning Overcomplete Latent Variable Models through Tensor Methods

Animashree Anandkumar, Rong Ge, Majid Janzamin ; PMLR 40:36-112

Simple, Efficient, and Neural Algorithms for Sparse Coding

Sanjeev Arora, Rong Ge, Tengyu Ma, Ankur Moitra ; PMLR 40:113-149

Label optimal regret bounds for online local learning

Pranjal Awasthi, Moses Charikar, Kevin A Lai, Andrej Risteski ; PMLR 40:150-166

Efficient Learning of Linear Separators under Bounded Noise

Pranjal Awasthi, Maria-Florina Balcan, Nika Haghtalab, Ruth Urner ; PMLR 40:167-190

Efficient Representations for Lifelong Learning and Autoencoding

Maria-Florina Balcan, Avrim Blum, Santosh Vempala ; PMLR 40:191-210

Optimally Combining Classifiers Using Unlabeled Data

Akshay Balsubramani, Yoav Freund ; PMLR 40:211-225

Minimax Fixed-Design Linear Regression

Peter L. Bartlett, Wouter M. Koolen, Alan Malek, Eiji Takimoto, Manfred K. Warmuth ; PMLR 40:226-239

Escaping the Local Minima via Simulated Annealing: Optimization of Approximately Convex Functions

Alexandre Belloni, Tengyuan Liang, Hariharan Narayanan, Alexander Rakhlin ; PMLR 40:240-265

Bandit Convex Optimization: \sqrtT Regret in One Dimension

Sébastien Bubeck, Ofer Dekel, Tomer Koren, Yuval Peres ; PMLR 40:266-278

The entropic barrier: a simple and optimal universal self-concordant barrier

Sébastien Bubeck, Ronen Eldan ; PMLR 40:279-279

Optimum Statistical Estimation with Strategic Data Sources

Yang Cai, Constantinos Daskalakis, Christos Papadimitriou ; PMLR 40:280-296

On the Complexity of Learning with Kernels

Nicolò Cesa-Bianchi, Yishay Mansour, Ohad Shamir ; PMLR 40:297-325

Learnability of Solutions to Conjunctive Queries: The Full Dichotomy

Hubie Chen, Matthew Valeriote ; PMLR 40:326-337

Sequential Information Maximization: When is Greedy Near-optimal?

Yuxin Chen, S. Hamed Hassani, Amin Karbasi, Andreas Krause ; PMLR 40:338-363

Efficient Sampling for Gaussian Graphical Models via Spectral Sparsification

Dehua Cheng, Yu Cheng, Yan Liu, Richard Peng, Shang-Hua Teng ; PMLR 40:364-390

Stochastic Block Model and Community Detection in Sparse Graphs: A spectral algorithm with optimal rate of recovery

Peter Chin, Anup Rao, Van Vu ; PMLR 40:391-423

On-Line Learning Algorithms for Path Experts with Non-Additive Losses

Corinna Cortes, Vitaly Kuznetsov, Mehryar Mohri, Manfred Warmuth ; PMLR 40:424-447

Truthful Linear Regression

Rachel Cummings, Stratis Ioannidis, Katrina Ligett ; PMLR 40:448-483

A PTAS for Agnostically Learning Halfspaces

Amit Daniely ; PMLR 40:484-502

S2: An Efficient Graph Based Active Learning Algorithm with Application to Nonparametric Classification

Gautam Dasarathy, Robert Nowak, Xiaojin Zhu ; PMLR 40:503-522

Improved Sum-of-Squares Lower Bounds for Hidden Clique and Hidden Submatrix Problems

Yash Deshpande, Andrea Montanari ; PMLR 40:523-562

Contextual Dueling Bandits

Miroslav Dudík, Katja Hofmann, Robert E. Schapire, Aleksandrs Slivkins, Masrour Zoghi ; PMLR 40:563-587

Beyond Hartigan Consistency: Merge Distortion Metric for Hierarchical Clustering

Justin Eldridge, Mikhail Belkin, Yusu Wang ; PMLR 40:588-606

Faster Algorithms for Testing under Conditional Sampling

Moein Falahatgar, Ashkan Jafarpour, Alon Orlitsky, Venkatadheeraj Pichapati, Ananda Theertha Suresh ; PMLR 40:607-636

Learning and inference in the presence of corrupted inputs

Uriel Feige, Yishay Mansour, Robert Schapire ; PMLR 40:637-657

From Averaging to Acceleration, There is Only a Step-size

Nicolas Flammarion, Francis Bach ; PMLR 40:658-695

Variable Selection is Hard

Dean Foster, Howard Karloff, Justin Thaler ; PMLR 40:696-709

Vector-Valued Property Elicitation

Rafael Frongillo, Ian A. Kash ; PMLR 40:710-727

Competing with the Empirical Risk Minimizer in a Single Pass

Roy Frostig, Rong Ge, Sham M. Kakade, Aaron Sidford ; PMLR 40:728-763

A Chaining Algorithm for Online Nonparametric Regression

Pierre Gaillard, Sébastien Gerchinovitz ; PMLR 40:764-796

Escaping From Saddle Points — Online Stochastic Gradient for Tensor Decomposition

Rong Ge, Furong Huang, Chi Jin, Yang Yuan ; PMLR 40:797-842

Learning the dependence structure of rare events: a non-asymptotic study

Nicolas Goix, Anne Sabourin, Stéphan Clémen\ccon ; PMLR 40:843-860

Thompson Sampling for Learning Parameterized Markov Decision Processes

Aditya Gopalan, Shie Mannor ; PMLR 40:861-898

Computational Lower Bounds for Community Detection on Random Graphs

Bruce Hajek, Yihong Wu, Jiaming Xu ; PMLR 40:899-928

Adaptive Recovery of Signals by Convex Optimization

Zaid Harchaoui, Anatoli Juditsky, Arkadi Nemirovski, Dmitry Ostrovsky ; PMLR 40:929-955

Tensor principal component analysis via sum-of-square proofs

Samuel B. Hopkins, Jonathan Shi, David Steurer ; PMLR 40:956-1006

Fast Exact Matrix Completion with Finite Samples

Prateek Jain, Praneeth Netrapalli ; PMLR 40:1007-1034

Exp-Concavity of Proper Composite Losses

Parameswaran Kamalaruban, Robert Williamson, Xinhua Zhang ; PMLR 40:1035-1065

On Learning Distributions from their Samples

Sudeep Kamath, Alon Orlitsky, Dheeraj Pichapati, Ananda Theertha Suresh ; PMLR 40:1066-1100

MCMC Learning

Varun Kanade, Elchanan Mossel ; PMLR 40:1101-1128

Online PCA with Spectral Bounds

Zohar Karnin, Edo Liberty ; PMLR 40:1129-1140

Regret Lower Bound and Optimal Algorithm in Dueling Bandit Problem

Junpei Komiyama, Junya Honda, Hisashi Kashima, Hiroshi Nakagawa ; PMLR 40:1141-1154

Second-order Quantile Methods for Experts and Combinatorial Games

Wouter M. Koolen, Tim Van Erven ; PMLR 40:1155-1175

Hierarchical Label Queries with Data-Dependent Partitions

Samory Kpotufe, Ruth Urner, Shai Ben-David ; PMLR 40:1176-1189

Algorithms for Lipschitz Learning on Graphs

Rasmus Kyng, Anup Rao, Sushant Sachdeva, Daniel A. Spielman ; PMLR 40:1190-1223

Low Rank Matrix Completion with Exponential Family Noise

Jean Lafond ; PMLR 40:1224-1243

Bad Universal Priors and Notions of Optimality

Jan Leike, Marcus Hutter ; PMLR 40:1244-1259

Learning with Square Loss: Localization through Offset Rademacher Complexity

Tengyuan Liang, Alexander Rakhlin, Karthik Sridharan ; PMLR 40:1260-1285

Achieving All with No Parameters: AdaNormalHedge

Haipeng Luo, Robert E. Schapire ; PMLR 40:1286-1304

Lower and Upper Bounds on the Generalization of Stochastic Exponentially Concave Optimization

Mehrdad Mahdavi, Lijun Zhang, Rong Jin ; PMLR 40:1305-1320

Correlation Clustering with Noisy Partial Information

Konstantin Makarychev, Yury Makarychev, Aravindan Vijayaraghavan ; PMLR 40:1321-1342

Online Density Estimation of Bradley-Terry Models

Issei Matsumoto, Kohei Hatano, Eiji Takimoto ; PMLR 40:1343-1359

First-order regret bounds for combinatorial semi-bandits

Gergely Neu ; PMLR 40:1360-1375

Norm-Based Capacity Control in Neural Networks

Behnam Neyshabur, Ryota Tomioka, Nathan Srebro ; PMLR 40:1376-1401

Cortical Learning via Prediction

Christos H. Papadimitriou, Santosh S. Vempala ; PMLR 40:1402-1422

Partitioning Well-Clustered Graphs: Spectral Clustering Works!

Richard Peng, He Sun, Luca Zanetti ; PMLR 40:1423-1455

Batched Bandit Problems

Vianney Perchet, Philippe Rigollet, Sylvain Chassang, Erik Snowberg ; PMLR 40:1456-1456

Hierarchies of Relaxations for Online Prediction Problems with Evolving Constraints

Alexander Rakhlin, Karthik Sridharan ; PMLR 40:1457-1479

Fast Mixing for Discrete Point Processes

Patrick Rebeschini, Amin Karbasi ; PMLR 40:1480-1500

Generalized Mixability via Entropic Duality

Mark D. Reid, Rafael M. Frongillo, Robert C. Williamson, Nishant Mehta ; PMLR 40:1501-1522

On the Complexity of Bandit Linear Optimization

Ohad Shamir ; PMLR 40:1523-1551

An Almost Optimal PAC Algorithm

Hans U. Simon ; PMLR 40:1552-1563

Minimax rates for memory-bounded sparse linear regression

Jacob Steinhardt, John Duchi ; PMLR 40:1564-1587

Interactive Fingerprinting Codes and the Hardness of Preventing False Discovery

Thomas Steinke, Jonathan Ullman ; PMLR 40:1588-1628

Convex Risk Minimization and Conditional Probability Estimation

Matus Telgarsky, Miroslav Dudík, Robert Schapire ; PMLR 40:1629-1682

Regularized Linear Regression: A Precise Analysis of the Estimation Error

Christos Thrampoulidis, Samet Oymak, Babak Hassibi ; PMLR 40:1683-1709

Max vs Min: Tensor Decomposition and ICA with nearly Linear Sample Complexity

Santosh S. Vempala, Ying. Xiao ; PMLR 40:1710-1723

On Convergence of Emphatic Temporal-Difference Learning

H. Yu ; PMLR 40:1724-1751

subscribe via RSS

This site last compiled Sun, 12 Mar 2017 18:19:22 +0000
Github Account Copyright © PMLR 2017. All rights reserved.