File Download

There are no files associated with this item.

Supplementary

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

TitleWhen Can We Solve the Weighted Low Rank Approximation Problem in Truly Subquadratic Time?
Authors
Li, ChenyangLiang, YingyuShi, ZhenmeiSong, Zhao
Issue Date3-May-2025
Persistent Identifierhttp://hdl.handle.net/10722/360553

 

DC FieldValueLanguage
dc.contributor.authorLi, Chenyang-
dc.contributor.authorLiang, Yingyu-
dc.contributor.authorShi, Zhenmei-
dc.contributor.authorSong, Zhao-
dc.date.accessioned2025-09-12T00:37:07Z-
dc.date.available2025-09-12T00:37:07Z-
dc.date.issued2025-05-03-
dc.identifier.urihttp://hdl.handle.net/10722/360553-
dc.languageeng-
dc.relation.ispartofThe 28th International Conference on Artificial Intelligence and Statistics. (03/05/2025-05/05/2025, Mai Khao)-
dc.titleWhen Can We Solve the Weighted Low Rank Approximation Problem in Truly Subquadratic Time? -
dc.typeConference_Paper-

Export via OAI-PMH Interface in XML Formats

OR

Export to Other Non-XML Formats