Subzero matrix completion for sparse data analysis: large-scale learning of latent low-rank structure
Read the original at arxiv.org→arXiv:2608.21607v1 Announce Type: new Abstract: We investigate when a sparse nonnegative matrix can be recovered from a real-valued matrix of much lower rank by zeroing out its negative elements. The potential for...
Coverage timeline
- Aug 25, 04:00 UTC arXiv cs.LG lead source Subzero matrix completion for sparse data analysis: large-scale learning of latent low-rank structure