Image de couverture de livre

A Smooth Computational Transition in Tensor PCA

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	Li, Zhangsong
Format:	Preprint
Publié:	2025
Sujets:	Statistics Theory Data Structures and Algorithms Probability Machine Learning 68Q87, 90C35
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Robust random graph matching in Gaussian models via vector approximate message passing
par: Li, Zhangsong
Publié: (2024)

A polynomial-time iterative algorithm for random graph matching with non-vanishing correlation
par: Ding, Jian, et autres
Publié: (2023)

Computational Lower Bounds for Correlated Random Graphs via Algorithmic Contiguity
par: Li, Zhangsong
Publié: (2025)

Improved Computational Lower Bound of Estimation for Multi-Frequency Group Synchronization
par: Li, Zhangsong
Publié: (2026)

The Umeyama algorithm for matching correlated Gaussian geometric models in the low-dimensional regime
par: Gong, Shuyang, et autres
Publié: (2024)

Low-Degree Hardness of Detection for Correlated Erdős-Rényi Graphs
par: Ding, Jian, et autres
Publié: (2023)

A computational transition for detecting correlated stochastic block models by low-degree polynomials
par: Chen, Guanyi, et autres
Publié: (2024)

Algorithmic Contiguity from Low-Degree Heuristic II: Predicting Detection-Recovery Gaps
par: Li, Zhangsong
Publié: (2026)

The Algorithmic Phase Transition in Correlated Spiked Models
par: Li, Zhangsong
Publié: (2025)

The Kikuchi Hierarchy and Tensor PCA
par: Wein, Alexander S., et autres
Publié: (2019)

Fundamental Limits of Community Detection in Contextual Multi-Layer Stochastic Block Models
par: Gong, Shuyang, et autres
Publié: (2026)

A polynomial time iterative algorithm for matching Gaussian matrices with non-vanishing correlation
par: Ding, Jian, et autres
Publié: (2022)

Private Evolution Converges
par: González, Tomás, et autres
Publié: (2025)

Algorithmic Universality, Low-Degree Polynomials, and Max-Cut in Sparse Random Graphs
par: Cheairi, Houssam El, et autres
Publié: (2024)

Computing the probability of intersection
par: Barvinok, Alexander
Publié: (2025)

Robust Algorithms for Finding Cliques in Random Intersection Graphs via Sum-of-Squares
par: Göbel, Andreas, et autres
Publié: (2025)

Detecting Correlation Efficiently in Stochastic Block Models: Breaking Otter's Threshold in the Entire Supercritical Regime
par: Chen, Guanyi, et autres
Publié: (2025)

Stochastic gradient descent in high dimensions for multi-spiked tensor PCA
par: Arous, Gérard Ben, et autres
Publié: (2024)

Almost-Optimal Local-Search Methods for Sparse Tensor PCA
par: Lovig, Max, et autres
Publié: (2025)

Computational and statistical lower bounds for low-rank estimation under general inhomogeneous noise
par: De, Debsurya, et autres
Publié: (2025)

Benign landscapes for synchronization on spheres via normalized Laplacian matrices
par: McRae, Andrew D.
Publié: (2025)

Adversarially-Robust Inference on Trees via Belief Propagation
par: Hopkins, Samuel B., et autres
Publié: (2024)

Tensor cumulants for statistical inference on invariant distributions
par: Kunisky, Dmitriy, et autres
Publié: (2024)

Advancing Stochastic 3-SAT Solvers by Dissipating Oversatisfied Constraints
par: Schwardt, J., et autres
Publié: (2025)

Statistical-Computational Trade-offs for Recursive Adaptive Partitioning Estimators
par: Tan, Yan Shuo, et autres
Publié: (2024)

Optimal rolling of fair dice using fair coins
par: Huber, Mark, et autres
Publié: (2024)

Robust Graph-Based Semi-Supervised Learning via $p$-Conductances
par: Robertson, Sawyer Jack, et autres
Publié: (2025)

Optimal Hardness of Online Algorithms for Large Independent Sets
par: Gamarnik, David, et autres
Publié: (2025)

On the Low-Temperature MCMC threshold: the cases of sparse tensor PCA, sparse regression, and a geometric rule
par: Chen, Zongchen, et autres
Publié: (2024)

The Complexity Landscape of Two-Stage Robust Selection Problems with Budgeted Uncertainty
par: Goerigk, Marc, et autres
Publié: (2026)

Statistical Estimation in the Spiked Tensor Model via the Quantum Approximate Optimization Algorithm
par: Zhou, Leo, et autres
Publié: (2024)

Balanced connected partitions of edge-weighted graphs: Hardness and solving methods
par: Davari, Morteza, et autres
Publié: (2025)

Nonlinear Laplacians: Tunable principal component analysis under directional prior information
par: Ma, Yuxin, et autres
Publié: (2025)

Perspectives on Stochastic Localization
par: Shi, Bobby, et autres
Publié: (2025)

Functional Stochastic Localization
par: Gu, Anming, et autres
Publié: (2026)

High-accuracy log-concave sampling with stochastic queries
par: Chen, Fan, et autres
Publié: (2026)

Complexity of High-Dimensional Identity Testing with Coordinate Conditional Sampling
par: Blanca, Antonio, et autres
Publié: (2022)

Learning bounded-degree polytrees with known skeleton
par: Choo, Davin, et autres
Publié: (2023)

Learning Mixtures of Gaussians Using Diffusion Models
par: Gatmiry, Khashayar, et autres
Publié: (2024)

Low coordinate degree algorithms I: Universality of computational thresholds for hypothesis testing
par: Kunisky, Dmitriy
Publié: (2024)