Semi-Random Sparse Recovery in Nearly-Linear Time

8 March 2022

Papers citing "Semi-Random Sparse Recovery in Nearly-Linear Time"

6 / 6 papers shown

Title
Learning Noisy Halfspaces with a Margin: Massart is No Harder than Random Gautam Chandrasekaran Vasilis Kontonis Konstantinos Stavropoulos Kevin Tian 92 0 0 20 Jan 2025
Top- $K$ ranking with a monotone adversary Yuepeng Yang Antares Chen Lorenzo Orecchia Cong Ma 37 1 0 12 Feb 2024
ReSQueing Parallel and Private Stochastic Convex Optimization Y. Carmon A. Jambulapati Yujia Jin Y. Lee Daogao Liu Aaron Sidford Kevin Tian FedML 22 12 0 01 Jan 2023
ReLU Regression with Massart Noise Ilias Diakonikolas Jongho Park Christos Tzamos 56 11 0 10 Sep 2021
Forster Decomposition and Learning Halfspaces with Noise Ilias Diakonikolas D. Kane Christos Tzamos 81 18 0 12 Jul 2021
Improved Graph Clustering Yudong Chen Sujay Sanghavi Huan Xu 94 191 0 11 Oct 2012