Local reconstruction of low‐rank matrices and subspaces

We study the problem of reconstructing a low‐rank matrix, where the input is an n × m matrix M over a field F and the goal is to reconstruct a (near‐optimal) matrix M′ that is low‐rank and close to M under some distance function Δ. Furthermore, the reconstruction must be local, i.e., provides access...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Random structures & algorithms Ročník 51; číslo 4; s. 607 - 630
Hlavní autori:	David, Roee, Goldenberg, Elazar, Krauthgamer, Robert
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Hoboken Wiley Subscription Services, Inc 01.12.2017
Predmet:	Algorithms Columns (structural) Data storage Data structures local reconstruction low‐rank matrix reconstruction Machine learning matrix rigidity Preprocessing Reconstruction Statistical analysis sublinear‐time algorithms subspace approximation Subspaces
ISSN:	1042-9832, 1098-2418
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!