Non-Gaussian Component Analysis via Lattice Basis Reduction

16 December 2021

Papers citing "Non-Gaussian Component Analysis via Lattice Basis Reduction"

13 / 13 papers shown

Title
Sum-of-squares lower bounds for Non-Gaussian Component Analysis Ilias Diakonikolas Sushrut Karmalkar Shuo Pang Aaron Potechin 22 3 0 28 Oct 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
Computational-Statistical Gaps for Improper Learning in Sparse Linear Regression Rares-Darius Buhai Jingqiu Ding Stefan Tiegel 21 2 0 21 Feb 2024
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
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
Beyond Parallel Pancakes: Quasi-Polynomial Time Guarantees for Non-Spherical Gaussian Mixtures Rares-Darius Buhai David Steurer CoGe 24 3 0 10 Dec 2021
Lattice-Based Methods Surpass Sum-of-Squares in Clustering Ilias Zadik M. Song Alexander S. Wein Joan Bruna 11 35 0 07 Dec 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