Symmetry & Critical Points for Symmetric Tensor Decomposition Problems
Not on the map. Why?
Abstract (arXiv)
We consider the nonconvex optimization problem associated with the decomposition of a real symmetric tensor into a sum of rank-one terms. Use is made of the rich symmetry structure to construct infinite families of critical points represented by Puiseux series in the problem dimension, and so obtain precise analytic estimates on the objective function value and the Hessian spectrum. The results enable an analytic characterization of various obstructions to local optimization methods, revealing, in particular, a complex array of saddles and minima that differ in their symmetry, structure, and analytic properties. A notable phenomenon, observed for all critical points considered, concerns the index of the Hessian increasing with the objective function value.
Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 14 of its 75 references that are in the map. First posted on arXiv 13 Jun 2023.
Builds on
14 of 75 references.
References · 14
- 2019Lower Bounds for Non-Convex Stochastic Optimizationcited by 307
- 2017How to Escape Saddle Points Efficientlycited by 285
- 2015Escaping From Saddle Points --- Online Stochastic Gradient for Tensor Decompositioncited by 243
- 2016Efficient approaches for escaping higher order saddle points in non-convex optimizationcited by 23
- 2020Analytic Characterization of the Hessian in Shallow ReLU Models: A Tale of Symmetrycited by 17
- 2021Analytic Study of Families of Spurious Minima in Two-Layer ReLU Neural Networks: A Tale of Symmetry IIcited by 16
- 2019Subspace power method for symmetric tensor decompositioncited by 14
- 2019On the Principle of Least Symmetry Breaking in Shallow ReLU Modelscited by 10
- 2020Symmetry & critical points for a model shallow neural networkcited by 10
- 2021Symmetry Breaking in Symmetric Tensor Decompositioncited by 10
- 2022Annihilation of Spurious Minima in Two-Layer ReLU Networkscited by 9
- 2022A Robust Spectral Algorithm for Overcomplete Tensor Decompositioncited by 7
Built on by
Citing papers per year: 2023: 1; 2024: 1; 2025: 1.
3 papers.
- 2025Geometry and Optimization of Shallow Polynomial Networkscited by 10
- 2023Hidden Minima in Two-Layer ReLU Networkscited by 2
- 2024Symmetry & Critical Pointscited by 2
- 2025Geometry and Optimization of Shallow Polynomial Networks10 Jan 2025
- 2024Symmetry & Critical Points26 Aug 2024
- 2023Hidden Minima in Two-Layer ReLU Networks28 Dec 2023