Papers
Tensor principal component analysis via sum-of-square proofs
Samuel B. Hopkins, Jonathan Shi, David Steurer
Adaptive Recovery of Signals by Convex Optimization
Zaid Harchaoui, Anatoli Juditsky, Arkadi Nemirovski et al.
Computational Lower Bounds for Community Detection on Random Graphs
Bruce Hajek, Yihong Wu, Jiaming Xu
Thompson Sampling for Learning Parameterized Markov Decision Processes
Aditya Gopalan, Shie Mannor
Learning the dependence structure of rare events: a non-asymptotic study
Nicolas Goix, Anne Sabourin, Stéphan Clémen\ccon
Escaping From Saddle Points — Online Stochastic Gradient for Tensor Decomposition
Rong Ge, Furong Huang, Chi Jin et al.
A Chaining Algorithm for Online Nonparametric Regression
Pierre Gaillard, Sébastien Gerchinovitz
Competing with the Empirical Risk Minimizer in a Single Pass
Roy Frostig, Rong Ge, Sham M. Kakade et al.
Vector-Valued Property Elicitation
Rafael Frongillo, Ian A. Kash
Variable Selection is Hard
Dean Foster, Howard Karloff, Justin Thaler
From Averaging to Acceleration, There is Only a Step-size
Nicolas Flammarion, Francis Bach
Learning and inference in the presence of corrupted inputs
Uriel Feige, Yishay Mansour, Robert Schapire
Faster Algorithms for Testing under Conditional Sampling
Moein Falahatgar, Ashkan Jafarpour, Alon Orlitsky et al.
Beyond Hartigan Consistency: Merge Distortion Metric for Hierarchical Clustering
Justin Eldridge, Mikhail Belkin, Yusu Wang
Contextual Dueling Bandits
Miroslav Dudík, Katja Hofmann, Robert E. Schapire et al.
Improved Sum-of-Squares Lower Bounds for Hidden Clique and Hidden Submatrix Problems
Yash Deshpande, Andrea Montanari
S2: An Efficient Graph Based Active Learning Algorithm with Application to Nonparametric Classification
Gautam Dasarathy, Robert Nowak, Xiaojin Zhu
A PTAS for Agnostically Learning Halfspaces
Amit Daniely
Truthful Linear Regression
Rachel Cummings, Stratis Ioannidis, Katrina Ligett
On-Line Learning Algorithms for Path Experts with Non-Additive Losses
Corinna Cortes, Vitaly Kuznetsov, Mehryar Mohri et al.
Stochastic Block Model and Community Detection in Sparse Graphs: A spectral algorithm with optimal rate of recovery
Peter Chin, Anup Rao, Van Vu
Efficient Sampling for Gaussian Graphical Models via Spectral Sparsification
Dehua Cheng, Yu Cheng, Yan Liu et al.
Sequential Information Maximization: When is Greedy Near-optimal?
Yuxin Chen, S. Hamed Hassani, Amin Karbasi et al.
Learnability of Solutions to Conjunctive Queries: The Full Dichotomy
Hubie Chen, Matthew Valeriote
On the Complexity of Learning with Kernels
Nicolò Cesa-Bianchi, Yishay Mansour, Ohad Shamir