ResearchTrend.AI
  • Communities
  • Connect sessions
  • AI calendar
  • Organizations
  • Join Slack
  • Contact Sales
Papers
Communities
Social Events
Terms and Conditions
Pricing
Contact Sales
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2026 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
v1v2 (latest)

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

8 August 2019
Matthew Brennan
Guy Bresler
ArXiv (abs)PDFHTML

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

11 / 11 papers shown
Sparse Mean Estimation in Adversarial Settings via Incremental Learning
Sparse Mean Estimation in Adversarial Settings via Incremental Learning
Jianhao Ma
Ruidi Chen
Yinghui He
Salar Fattahi
Wei Hu
385
0
0
24 May 2023
Statistical-Computational Tradeoffs in Mixed Sparse Linear Regression
Statistical-Computational Tradeoffs in Mixed Sparse Linear RegressionAnnual Conference Computational Learning Theory (COLT), 2023
Gabriel Arpino
R. Venkataramanan
288
7
0
03 Mar 2023
Subspace clustering in high-dimensions: Phase transitions &
  Statistical-to-Computational gap
Subspace clustering in high-dimensions: Phase transitions & Statistical-to-Computational gapNeural Information Processing Systems (NeurIPS), 2022
Luca Pesce
Bruno Loureiro
Florent Krzakala
Lenka Zdeborová
397
4
0
26 May 2022
High-dimensional logistic entropy clustering
High-dimensional logistic entropy clustering
Edouard Genetay
Adrien Saumard
Rémi Coulaud
166
0
0
16 Dec 2021
Average-Case Communication Complexity of Statistical Problems
Average-Case Communication Complexity of Statistical Problems
Cyrus Rashtchian
David P. Woodruff
Peng Ye
Hanlin Zhu
183
6
0
03 Jul 2021
Computationally efficient sparse clustering
Computationally efficient sparse clustering
Matthias Löffler
Alexander S. Wein
Afonso S. Bandeira
359
18
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
579
52
0
21 May 2020
Reducibility and Statistical-Computational Gaps from Secret Leakage
Reducibility and Statistical-Computational Gaps from Secret Leakage
Matthew Brennan
Guy Bresler
409
102
0
16 May 2020
Counterexamples to the Low-Degree Conjecture
Counterexamples to the Low-Degree ConjectureInformation Technology Convergence and Services (ITCS), 2020
Justin Holmgren
Alexander S. Wein
217
17
0
17 Apr 2020
Recent Advances in Algorithmic High-Dimensional Robust Statistics
Recent Advances in Algorithmic High-Dimensional Robust Statistics
Ilias Diakonikolas
D. Kane
OOD
358
192
0
14 Nov 2019
Phase Transitions for Detecting Latent Geometry in Random Graphs
Phase Transitions for Detecting Latent Geometry in Random GraphsProbability theory and related fields (PTRF), 2019
Matthew Brennan
Guy Bresler
Dheeraj M. Nagaraj
355
38
0
30 Oct 2019
1
Page 1 of 1