HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation

Code for reproducible research - "Spurious Valleys, NP-hardness, and Tractability of Sparse Matrix Factorization With Fixed Support"

Quoc-Tung Le 1, 2 Rémi Gribonval 1 Elisa Riccietti 1
1 DANTE - Dynamic Networks : Temporal and Structural Capture Approach
Inria Grenoble - Rhône-Alpes, LIP - Laboratoire de l'Informatique du Parallélisme, IXXI - Institut Rhône-Alpin des systèmes complexes
Abstract : Code to reproduce experiments in "Spurious Valleys, NP-hardness, and Tractability of Sparse Matrix Factorization With Fixed Support". In the interest of reproducible research, this is exactly the version of the code used to generate the figures in the paper "Spurious Valleys, Spurious Minima and NP-hardness of Sparse Matrix Factorization With Fixed Support" by the same authors, available at "https://hal.inria.fr/hal-03364668"
Document type :
Software
Complete list of metadata

Browse

Present sur SoftwareHeritage
swh:1:dir:0815e7933349cee2fdef8c7b24ee5c1a29115480;origin=https://hal.archives-ouvertes.fr/hal-03667186;visit=swh:1:snp:0360b8b8bc1de00c2520b7608470a50cd0491851;anchor=swh:1:rel:d2138dc681b43f7a31f9d6a2df9f46b04ed4ee8d;path=/

https://hal.inria.fr/hal-03667186
Contributor : Quoc-Tung Le Connect in order to contact the contributor
Submitted on : Friday, May 13, 2022 - 4:52:22 PM
Last modification on : Tuesday, May 17, 2022 - 2:34:26 PM

Citation

Quoc-Tung Le, Rémi Gribonval, Elisa Riccietti. Code for reproducible research - "Spurious Valleys, NP-hardness, and Tractability of Sparse Matrix Factorization With Fixed Support". 2022, ⟨swh:1:dir:0815e7933349cee2fdef8c7b24ee5c1a29115480;origin=https://hal.archives-ouvertes.fr/hal-03667186;visit=swh:1:snp:0360b8b8bc1de00c2520b7608470a50cd0491851;anchor=swh:1:rel:d2138dc681b43f7a31f9d6a2df9f46b04ed4ee8d;path=/⟩. ⟨hal-03667186⟩

Share

Metrics

Record views

0

Files downloads

0