Matrix factorization ranks via polynomial optimization - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Chapitre D'ouvrage Année : 2023

Matrix factorization ranks via polynomial optimization

Résumé

In light of recent data science trends, new interest has fallen in alternative matrix factorizations. By this, we mean various ways of factorizing particular data matrices so that the factors have special properties and reveal insights into the original data. We are interested in the specialized ranks associated with these factorizations, but they are usually difficult to compute. In particular, we consider the nonnegative-, completely positive-, and separable ranks. We focus on a general tool for approximating factorization ranks, the moment hierarchy, a classical technique from polynomial optimization, further augmented by exploiting ideal-sparsity. Contrary to other examples of sparsity, the resulting sparse hierarchy yields equally strong, if not superior, bounds while potentially delivering a speed-up in computation.
Fichier principal
Vignette du fichier
2302.09994.pdf (685.94 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04081571 , version 1 (25-04-2023)

Identifiants

Citer

Andries Steenkamp. Matrix factorization ranks via polynomial optimization. Michal Kočvara; Bernard Mourrain; Cordian Riener. Polynomial Optimization, Moments, and Applications, Springer, pp.135-162, 2023, ⟨10.48550/arXiv.2302.09994⟩. ⟨hal-04081571⟩

Collections

TDS-MACS
44 Consultations
39 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More