Symmetry & Critical Points for Symmetric Tensor Decomposition Problems

Yossi Arjevani, Gal Vinograd
6/13/2023
math.OCcs.LGmath.AG

No confident code implementation found for this paper.

Abstract

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.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{arjevani2023symmetry,
  title  = {Symmetry & Critical Points for Symmetric Tensor Decomposition Problems},
  author = {Yossi Arjevani and Gal Vinograd},
  year   = {2023},
  eprint = {2306.07886v5},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2306.07886v5}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2306.07886v5.svg)](https://codeofpaper.com/paper/2306.07886v5)

Discussion