Code for reproducible research - "Spurious Valleys, NP-hardness, and Tractability of Sparse Matrix Factorization With Fixed Support" - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Logiciel Année : 2022

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

Résumé

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"

Citer

Quoc-Tung Le, Elisa Riccietti, Rémi Gribonval. Code for reproducible research - "Spurious Valleys, NP-hardness, and Tractability of Sparse Matrix Factorization With Fixed Support". 2022, ⟨swh:1:dir:96dde633bde9eb800bc2e298ae98dba0579cb052;origin=https://hal.archives-ouvertes.fr/hal-03667186;visit=swh:1:snp:5d6cba12bff4367e05a63c41938941f627ed2946;anchor=swh:1:rel:76d45ab397d6879990a7aa51621191589440f04b;path=/⟩. ⟨hal-03667186v2⟩
153 Consultations
16 Téléchargements

Partager

Gmail Facebook X LinkedIn More