Software Year : 2022

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

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"
HAL

Cites hal-03364668 Journal article Quoc-Tung Le, Elisa Riccietti, Rémi Gribonval. Spurious Valleys, NP-hardness, and Tractability of Sparse Matrix Factorization With Fixed Support. SIAM Journal on Matrix Analysis and Applications, 2023, 44 (2), pp.503-529. ⟨10.1137/22M1496657⟩. ⟨hal-03364668v5⟩

Cite

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-03667186v1⟩
202 View
28 Download

Share

More