Statistical-Computational Trade-offs in Tensor PCA and Related Problems
via Communication Complexity

v1v2 (latest)

Statistical-Computational Trade-offs in Tensor PCA and Related Problems via Communication Complexity

15 April 2022

ArXiv (abs)PDF HTML

Papers citing "Statistical-Computational Trade-offs in Tensor PCA and Related Problems via Communication Complexity"

9 / 9 papers shown

Title
The Generative Leap: Sharp Sample Complexity for Efficiently Learning Gaussian Multi-Index Models Alex Damian Jason D. Lee Joan Bruna 30 1 0 05 Jun 2025
Survey on Algorithms for multi-index models Joan Bruna Daniel Hsu 101 3 0 07 Apr 2025
Feature learning from non-Gaussian inputs: the case of Independent Component Analysis in high dimensions Fabiola Ricci Lorenzo Bardone Sebastian Goldt OOD 207 0 0 31 Mar 2025
Sum-of-squares lower bounds for Non-Gaussian Component Analysis Ilias Diakonikolas Sushrut Karmalkar Shuo Pang Aaron Potechin 47 4 0 28 Oct 2024
Neural network learns low-dimensional polynomials with SGD near the information-theoretic limit Jason D. Lee Kazusato Oko Taiji Suzuki Denny Wu MLT 149 25 0 03 Jun 2024
Learning from higher-order statistics, efficiently: hypothesis tests, random features, and neural networks Eszter Székely Lorenzo Bardone Federica Gerace Sebastian Goldt 68 2 0 22 Dec 2023
Smoothing the Landscape Boosts the Signal for SGD: Optimal Sample Complexity for Learning Single Index Models Alexandru Damian Eshaan Nichani Rong Ge Jason D. Lee MLT 94 39 0 18 May 2023
A non-backtracking method for long matrix and tensor completion Ludovic Stephan Yizhe Zhu 127 7 0 04 Apr 2023
Optimal Spectral Recovery of a Planted Vector in a Subspace Cheng Mao Alexander S. Wein 54 20 0 31 May 2021