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. 1908.06130
  4. Cited By
Average-Case Lower Bounds for Learning Sparse Mixtures, Robust
  Estimation and Semirandom Adversaries

Average-Case Lower Bounds for Learning Sparse Mixtures, Robust Estimation and Semirandom Adversaries

8 August 2019
Matthew Brennan
Guy Bresler
ArXivPDFHTML

Papers citing "Average-Case Lower Bounds for Learning Sparse Mixtures, Robust Estimation and Semirandom Adversaries"

5 / 5 papers shown
Title
Robust Sparse Mean Estimation via Incremental Learning
Robust Sparse Mean Estimation via Incremental Learning
Jianhao Ma
Ruidi Chen
Yinghui He
S. Fattahi
Wei Hu
32
0
0
24 May 2023
Subspace clustering in high-dimensions: Phase transitions &
  Statistical-to-Computational gap
Subspace clustering in high-dimensions: Phase transitions & Statistical-to-Computational gap
Luca Pesce
Bruno Loureiro
Florent Krzakala
Lenka Zdeborová
30
1
0
26 May 2022
Computationally efficient sparse clustering
Computationally efficient sparse clustering
Matthias Löffler
Alexander S. Wein
Afonso S. Bandeira
25
14
0
21 May 2020
Tensor Clustering with Planted Structures: Statistical Optimality and
  Computational Limits
Tensor Clustering with Planted Structures: Statistical Optimality and Computational Limits
Yuetian Luo
Anru R. Zhang
24
44
0
21 May 2020
Reducibility and Statistical-Computational Gaps from Secret Leakage
Reducibility and Statistical-Computational Gaps from Secret Leakage
Matthew Brennan
Guy Bresler
19
85
0
16 May 2020
1