Papers
1,396 papers found
Thresholding Based Outlier Robust PCA
Yeshwanth Cherapanamjeri, Prateek Jain, Praneeth Netrapalli
Tight Bounds for Bandit Combinatorial Optimization
Alon Cohen, Tamir Hazan, Tomer Koren
Towards Instance Optimal Bounds for Best Arm Identification
Lijie Chen, Jian Li, Mingda Qiao
Two-Sample Tests for Large Random Graphs Using Network Statistics
Debarghya Ghoshdastidar, Maurilio Gutzeit, Alexandra Carpentier et al.
ZigZag: A New Approach to Adaptive Online Learning
Dylan J. Foster, Alexander Rakhlin, Karthik Sridharan
Adaptive Learning with Robust Generalization Guarantees
Rachel Cummings, Katrina Ligett, Kobbi Nissim et al.
Aggregation of supports along the Lasso path
Pierre C. Bellec
A Guide to Learning Arithmetic Circuits
Ilya Volkovich
A Light Touch for Heavily Constrained SGD
Andrew Cotter, Maya Gupta, Jan Pfeifer
An algorithm with nearly optimal pseudo-regret for both stochastic and adversarial bandits
Peter Auer, Chao-Kai Chiang
An efficient algorithm for contextual bandits with knapsacks, and an extension to concave objectives
Shipra Agrawal, Nikhil R. Devanur, Lihong Li
An Improved Gap-Dependency Analysis of the Noisy Power Method
Maria-Florina Balcan, Simon Shaolei Du, Yining Wang et al.
Asymptotic behavior of \ell_p-based Laplacian regularization in semi-supervised learning
Ahmed El Alaoui, Xiang Cheng, Aaditya Ramdas et al.
Basis Learning as an Algorithmic Primitive
Mikhail Belkin, Luis Rademacher, James Voss
benefits of depth in neural networks
Matus Telgarsky
Best-of-K-bandits
Max Simchowitz, Kevin Jamieson, Benjamin Recht
Complexity Theoretic Limitations on Learning DNF’s
Amit Daniely, Shai Shalev-Shwartz
Cortical Computation via Iterative Constructions
Christos Papadimitriou, Samantha Petti, Santosh Vempala
Delay and Cooperation in Nonstochastic Bandits
Nicol‘o Cesa-Bianchi, Claudio Gentile, Yishay Mansour et al.
Density Evolution in the Degree-correlated Stochastic Block Model
Elchanan Mossel, Jiaming Xu
Dropping Convexity for Faster Semi-definite Optimization
Srinadh Bhojanapalli, Anastasios Kyrillidis, Sujay Sanghavi
Efficient approaches for escaping higher order saddle points in non-convex optimization
Animashree Anandkumar, Rong Ge
First-order Methods for Geodesically Convex Optimization
Hongyi Zhang, Suvrit Sra
Gradient Descent Only Converges to Minimizers
Jason D. Lee, Max Simchowitz, Michael I. Jordan et al.
Highly-Smooth Zero-th Order Online Optimization
Francis Bach, Vianney Perchet