COLT 2020
125 papers
A Greedy Anytime Algorithm for Sparse PCA
Guy Holtzman, Adam Soffer, Dan Vilenchik Active Local Learning
Arturs Backurs, Avrim Blum, Neha Gupta Approximation Schemes for ReLU Regression
Ilias Diakonikolas, Surbhi Goel, Sushrut Karmalkar, Adam R. Klivans, Mahdi Soltanolkotabi Balancing Gaussian Vectors in High Dimension
Paxton Turner, Raghu Meka, Philippe Rigollet Bounds in Query Learning
Hunter Chase, James Freitag Complexity Guarantees for Polyak Steps with Momentum
Mathieu Barré, Adrien Taylor, Alexandre d’Aspremont Costly Zero Order Oracles
Renato Paes Leme, Jon Schneider Embedding Dimension of Polyhedral Losses
Jessie Finocchiaro, Rafael Frongillo, Bo Waggoner Gradient Descent Algorithms for Bures-Wasserstein Barycenters
Sinho Chewi, Tyler Maunu, Philippe Rigollet, Austin J. Stromme How to Trap a Gradient Flow
Sébastien Bubeck, Dan Mikulincer Kernel and Rich Regimes in Overparametrized Models
Blake Woodworth, Suriya Gunasekar, Jason D. Lee, Edward Moroshko, Pedro Savarese, Itay Golan, Daniel Soudry, Nathan Srebro Learning Halfspaces with Massart Noise Under Structured Distributions
Ilias Diakonikolas, Vasilis Kontonis, Christos Tzamos, Nikos Zarifis Locally Private Hypothesis Selection
Sivakanth Gopi, Gautam Kamath, Janardhan Kulkarni, Aleksandar Nikolov, Zhiwei Steven Wu, Huanyu Zhang No-Regret Prediction in Marginally Stable Systems
Udaya Ghai, Holden Lee, Karan Singh, Cyril Zhang, Yi Zhang Open Problem: Fast and Optimal Online Portfolio Selection
Tim Van Erven, Dirk Van der Hoeven, Wojciech Kotłowski, Wouter M. Koolen Optimal Group Testing
Amin Coja-Oghlan, Oliver Gebhard, Max Hahn-Klimroth, Philipp Loick Pan-Private Uniformity Testing
Kareem Amin, Matthew Joseph, Jieming Mao Privately Learning Thresholds: Closing the Exponential Gap
Haim Kaplan, Katrina Ligett, Yishay Mansour, Moni Naor, Uri Stemmer Proper Learning, Helly Number, and an Optimal SVM Bound
Olivier Bousquet, Steve Hanneke, Shay Moran, Nikita Zhivotovskiy Second-Order Information in Non-Convex Stochastic Optimization: Power and Limitations
Yossi Arjevani, Yair Carmon, John C. Duchi, Dylan J. Foster, Ayush Sekhari, Karthik Sridharan Sharper Bounds for Uniformly Stable Algorithms
Olivier Bousquet, Yegor Klochkov, Nikita Zhivotovskiy The Gradient Complexity of Linear Regression
Mark Braverman, Elad Hazan, Max Simchowitz, Blake Woodworth Wasserstein Control of Mirror Langevin Monte Carlo
Kelvin Shuangjian Zhang, Gabriel Peyré, Jalal Fadili, Marcelo Pereyra Winnowing with Gradient Descent
Ehsan Amid, Manfred K. Warmuth