Sharp Trade‑off for Tensor PCA via Kikuchi Matrix Bounds

A new study shows Kikuchi‑hierarchy spectral algorithms meet the optimal λ ≥ Θ_r(1) n^{-r/4} ℓ^{1/2‑r/4} bound for Tensor PCA, eliminating the √log n factor. Read more: getnews.me/sharp-trade-off-for-tens... #tensorpca #kikuchihierarchy #theoreticalcs

New Efficient Algorithm Smooths Computational Tradeoff in Tensor PCA

A new hypergraph‑counting algorithm speeds up tensor PCA, succeeding when the signal‑to‑noise ratio λ n⁻ᵖ/⁴ has λ = Ω(1) and running in time n^{C+o(1)} with C depending on λ. Read more: getnews.me/new-efficient-algorithm-... #tensorpca #hypergraph