Unverified50% confidenceFactExact time
Tensor PCA exhibits an information-computation gap: when the signal-to-noise ratio is above the algorithmic threshold, global algorithms such as spectral methods and sum-of-squares can successfully recover in polynomial time; below that threshold, lower bounds for these algorithms and for certain restricted computational models show that they must fail.
1
Sources
50%
Confidence
Long-term
Relevance
10/30/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedPreviously the community generally believed that local algorithms (such as Markov chains) perform far worse than global algorithms in tensor PCA, and it was only known that under random initialization they require a polynomially higher signal-to-noise ratio to succeed.74% similarUnverifiedTraditional methods such as PCA and TRPCA tend to flatten the data or ignore its inherent multimodal tensor structure, thereby failing when confronted with complex faults involving sensor-time correlations74% similarUnverifiedIn tensor PCA, spectral methods succeed when the signal-to-noise ratio is above the algorithmic threshold, SoS also succeeds at the same threshold, and SoS lower bounds show that below this threshold any SoS algorithm fails.73% similarUnverifiedClassical causal discovery methods such as the PC algorithm and FCI algorithm face the dual challenges of combinatorial explosion and insufficient samples in high-dimensional state spaces.72% similarUnverifiedThe tensor PCA problem is defined on the sphere S_N: given noisy observations of the k-th order tensor power of an unknown vector (k≥3 fixed), the goal is to recover that unknown vector.71% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/1114780API
curl https://kongchang.com/api/v1/knowledge/claims/1114780MCP
get_claim(id=1114780)