ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2203.04002
  4. Cited By
Semi-Random Sparse Recovery in Nearly-Linear Time

Semi-Random Sparse Recovery in Nearly-Linear Time

8 March 2022
Jonathan A. Kelner
Jungshian Li
Allen Liu
Aaron Sidford
Kevin Tian
ArXivPDFHTML

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

4 / 4 papers shown
Title
Learning Noisy Halfspaces with a Margin: Massart is No Harder than Random
Gautam Chandrasekaran
Vasilis Kontonis
Konstantinos Stavropoulos
Kevin Tian
87
0
0
20 Jan 2025
ReLU Regression with Massart Noise
ReLU Regression with Massart Noise
Ilias Diakonikolas
Jongho Park
Christos Tzamos
45
11
0
10 Sep 2021
Forster Decomposition and Learning Halfspaces with Noise
Forster Decomposition and Learning Halfspaces with Noise
Ilias Diakonikolas
D. Kane
Christos Tzamos
75
18
0
12 Jul 2021
Improved Graph Clustering
Improved Graph Clustering
Yudong Chen
Sujay Sanghavi
Huan Xu
90
190
0
11 Oct 2012
1