When Can We Solve the Weighted Low Rank Approximation Problem in Truly Subquadratic Time?

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Li, Chenyang, Liang, Yingyu, Shi, Zhenmei, Song, Zhao
Format:	Preprint
Published:	2025
Subjects:	Computational Complexity Artificial Intelligence Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Internet

https://arxiv.org/abs/2502.16912