Papers
Communities
Events
Blog
Pricing
Search
Open menu
Home
Papers
2112.03898
Cited By
Lattice-Based Methods Surpass Sum-of-Squares in Clustering
7 December 2021
Ilias Zadik
M. Song
Alexander S. Wein
Joan Bruna
Re-assign community
ArXiv
PDF
HTML
Papers citing
"Lattice-Based Methods Surpass Sum-of-Squares in Clustering"
25 / 25 papers shown
Title
Scaling Open-Vocabulary Action Detection
Zhen Hao Sia
Yogesh Singh Rawat
ObjD
VLM
65
0
0
04 Apr 2025
Sum-of-squares lower bounds for Non-Gaussian Component Analysis
Ilias Diakonikolas
Sushrut Karmalkar
Shuo Pang
Aaron Potechin
22
3
0
28 Oct 2024
On the Hardness of Learning One Hidden Layer Neural Networks
Shuchen Li
Ilias Zadik
Manolis Zampetakis
21
2
0
04 Oct 2024
Low-degree Security of the Planted Random Subgraph Problem
Andrej Bogdanov
Chris Jones
Alon Rosen
Ilias Zadik
29
1
0
24 Sep 2024
Improving Lagarias-Odlyzko Algorithm For Average-Case Subset Sum: Modular Arithmetic Approach
Antoine Joux
Karol Węgrzycki
24
1
0
28 Aug 2024
Cryptographic Hardness of Score Estimation
Min Jae Song
25
0
0
04 Apr 2024
SQ Lower Bounds for Non-Gaussian Component Analysis with Weaker Assumptions
Ilias Diakonikolas
Daniel M. Kane
Lisheng Ren
Yuxin Sun
13
10
0
07 Mar 2024
Sparse Linear Regression and Lattice Problems
A. Gupte
Neekon Vafa
Vinod Vaikuntanathan
22
1
0
22 Feb 2024
Computational-Statistical Gaps for Improper Learning in Sparse Linear Regression
Rares-Darius Buhai
Jingqiu Ding
Stefan Tiegel
23
2
0
21 Feb 2024
Sharp Thresholds Imply Circuit Lower Bounds: from random 2-SAT to Planted Clique
D. Gamarnik
Elchanan Mossel
Ilias Zadik
62
1
0
07 Nov 2023
Algorithmic Decorrelation and Planted Clique in Dependent Random Graphs: The Case of Extra Triangles
Guy Bresler
Chenghao Guo
Yury Polyanskiy
34
1
0
17 May 2023
Statistical-Computational Tradeoffs in Mixed Sparse Linear Regression
Gabriel Arpino
R. Venkataramanan
30
4
0
03 Mar 2023
Sparse PCA Beyond Covariance Thresholding
Gleb Novikov
13
1
0
20 Feb 2023
SQ Lower Bounds for Random Sparse Planted Vector Problem
Jingqiu Ding
Yiding Hua
19
4
0
26 Jan 2023
Average-Case Complexity of Tensor Decomposition for Low-Degree Polynomials
Alexander S. Wein
27
9
0
10 Nov 2022
On the well-spread property and its relation to linear regression
Hongjie Chen
Tommaso dÓrsi
15
5
0
16 Jun 2022
Statistical and Computational Phase Transitions in Group Testing
A. Coja-Oghlan
Oliver Gebhard
Max Hahn-Klimroth
Alexander S. Wein
Ilias Zadik
22
18
0
15 Jun 2022
The Franz-Parisi Criterion and Computational Trade-offs in High Dimensional Statistics
Afonso S. Bandeira
A. Alaoui
Samuel B. Hopkins
T. Schramm
Alexander S. Wein
Ilias Zadik
40
28
0
19 May 2022
Hardness of Noise-Free Learning for Two-Hidden-Layer Neural Networks
Sitan Chen
Aravind Gollakota
Adam R. Klivans
Raghu Meka
21
30
0
10 Feb 2022
Optimal Estimation and Computational Limit of Low-rank Gaussian Mixtures
Zhongyuan Lyu
Dong Xia
29
8
0
22 Jan 2022
Non-Gaussian Component Analysis via Lattice Basis Reduction
Ilias Diakonikolas
D. Kane
28
18
0
16 Dec 2021
Beyond Parallel Pancakes: Quasi-Polynomial Time Guarantees for Non-Spherical Gaussian Mixtures
Rares-Darius Buhai
David Steurer
CoGe
24
3
0
10 Dec 2021
Logspace Reducibility From Secret Leakage Planted Clique
Jay Mardia
16
0
0
25 Jul 2021
Optimal Spectral Recovery of a Planted Vector in a Subspace
Cheng Mao
Alexander S. Wein
17
18
0
31 May 2021
Adversarial examples from computational constraints
Sébastien Bubeck
Eric Price
Ilya P. Razenshteyn
AAML
62
230
0
25 May 2018
1