Copertina

Computational Complexity of Statistics: New Insights from Low-Degree Polynomials

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autore principale:	Wein, Alexander S.
Natura:	Preprint
Pubblicazione:	2025
Soggetti:	Statistics Theory Computational Complexity Machine Learning
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Sharp Phase Transitions in Estimation with Low-Degree Polynomials
di: Sohn, Youngtak, et al.
Pubblicazione: (2025)

Computational-Statistical Gaps for Improper Learning in Sparse Linear Regression
di: Buhai, Rares-Darius, et al.
Pubblicazione: (2024)

Computational Lower Bounds for Graphon Estimation via Low-degree Polynomials
di: Luo, Yuetian, et al.
Pubblicazione: (2023)

Tensor cumulants for statistical inference on invariant distributions
di: Kunisky, Dmitriy, et al.
Pubblicazione: (2024)

The monotonicity of the Franz-Parisi potential is equivalent with Low-degree MMSE lower bounds
di: Tsirkas, Konstantinos, et al.
Pubblicazione: (2026)

Lasso with Latents: Efficient Estimation, Covariate Rescaling, and Computational-Statistical Gaps
di: Kelner, Jonathan, et al.
Pubblicazione: (2024)

Low degree conjecture implies sharp computational thresholds in stochastic block model
di: Ding, Jingqiu, et al.
Pubblicazione: (2025)

Learning High-dimensional Gaussians from Censored Data
di: Bhattacharyya, Arnab, et al.
Pubblicazione: (2025)

Causal Discovery under Latent Class Confounding
di: Mazaheri, Bijan, et al.
Pubblicazione: (2023)

Improved Hardness Results for Learning Intersections of Halfspaces
di: Tiegel, Stefan
Pubblicazione: (2024)

On the Hardness of Learning One Hidden Layer Neural Networks
di: Li, Shuchen, et al.
Pubblicazione: (2024)

An Optimized Franz-Parisi Criterion and its Equivalence with SQ Lower Bounds
di: Chen, Siyu, et al.
Pubblicazione: (2025)

Statistical inference of a ranked community in a directed graph
di: Kunisky, Dmitriy, et al.
Pubblicazione: (2024)

Efficient reductions from a Gaussian source with applications to statistical-computational tradeoffs
di: Lou, Mengqi, et al.
Pubblicazione: (2025)

Near-Optimal Learning and Planning in Separated Latent MDPs
di: Chen, Fan, et al.
Pubblicazione: (2024)

On Computationally Efficient Multi-Class Calibration
di: Gopalan, Parikshit, et al.
Pubblicazione: (2024)

Precise Error Rates for Computationally Efficient Testing
di: Moitra, Ankur, et al.
Pubblicazione: (2023)

Information-Theoretic Bounds and Task-Centric Learning Complexity for Real-World Dynamic Nonlinear Systems
di: Bulusu, Sri Satish Krishna Chaitanya, et al.
Pubblicazione: (2025)

Cryptographic Hardness of Score Estimation
di: Song, Min Jae
Pubblicazione: (2024)

Equivalence of Approximate Message Passing and Low-Degree Polynomials in Rank-One Matrix Estimation
di: Montanari, Andrea, et al.
Pubblicazione: (2022)

Efficient Pauli channel estimation with logarithmic quantum memory
di: Chen, Sitan, et al.
Pubblicazione: (2023)

Strong Low Degree Hardness for the Number Partitioning Problem
di: Mallarapu, Rushil, et al.
Pubblicazione: (2025)

A Computational Transition for Detecting Multivariate Shuffled Linear Regression by Low-Degree Polynomials
di: Li, Zhangsong
Pubblicazione: (2025)

Derandomizing Multi-Distribution Learning
di: Larsen, Kasper Green, et al.
Pubblicazione: (2024)

Low-degree phase transitions for detecting a planted clique in sublinear time
di: Mardia, Jay, et al.
Pubblicazione: (2024)

A Framework for Computational Lower Bounds in Nontrivial Norm Approximation
di: Tang, Runshi, et al.
Pubblicazione: (2026)

Computational Equivalence of Spiked Covariance and Spiked Wigner Models via Gram-Schmidt Perturbation
di: Bresler, Guy, et al.
Pubblicazione: (2025)

Learning to erase quantum states: thermodynamic implications of quantum learning theory
di: Zhao, Haimeng, et al.
Pubblicazione: (2025)

Detection of local geometry in random graphs: information-theoretic and computational limits
di: Bok, Jinho, et al.
Pubblicazione: (2026)

Polynomial-Time Optimal Group Selection via the Double-Commutator Eigenvalue Problem
di: Thornton, Mitchell A.
Pubblicazione: (2026)

Approximate Computation via Le Cam Simulability
di: Akdemir, Deniz
Pubblicazione: (2025)

Random Circuit Sampling: Fourier Expansion and Statistics
di: Kalai, Gil, et al.
Pubblicazione: (2024)

Computational lower bounds for multi-frequency group synchronization
di: Kireeva, Anastasia, et al.
Pubblicazione: (2024)

Sandwiching Polynomials for Geometric Concepts with Low Intrinsic Dimension
di: Klivans, Adam R., et al.
Pubblicazione: (2026)

Counting Stars is Constant-Degree Optimal For Detecting Any Planted Subgraph
di: Yu, Xifan, et al.
Pubblicazione: (2024)

Monotonicity Testing of High-Dimensional Distributions with Subcube Conditioning
di: Chakrabarty, Deeparnab, et al.
Pubblicazione: (2025)

Is it easier to count communities than find them?
di: Rush, Cynthia, et al.
Pubblicazione: (2022)

Optimizing Computational-Statistical Runtime for Wasserstein Distance Estimation
di: Jacobs, Peter Matthew, et al.
Pubblicazione: (2026)

Gradient Descent with Projection Finds Over-Parameterized Neural Networks for Learning Low-Degree Polynomials with Nearly Minimax Optimal Rate
di: Yang, Yingzhen, et al.
Pubblicazione: (2026)

Statistical and Computational Guarantees of Kernel Max-Sliced Wasserstein Distances
di: Wang, Jie, et al.
Pubblicazione: (2024)