An Improved Frequent Directions Algorithm for Low-Rank Approximation via Block Krylov Iteration

Frequent directions (FDs), as a deterministic matrix sketching technique, have been proposed for tackling low-rank approximation problems. This method has a high degree of accuracy and practicality but experiences a lot of computational cost for large-scale data. Several recent works on the randomiz...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	IEEE transaction on neural networks and learning systems Ročník 35; číslo 7; s. 9428 - 9442
Hlavní autori:	Wang, Chenhao, Yi, Qianxin, Liao, Xiuwu, Wang, Yao
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	United States IEEE 01.07.2024 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:	Accuracy Algorithms Approximation Approximation algorithms Approximation error Block Krylov iteration Computational efficiency Computer applications Computing costs Cost analysis Costs Efficiency Error analysis frequent directions (FDs) low-rank approximation Neural networks Principal component analysis randomized sketching Signal processing algorithms Sparse matrices streaming algorithms Theoretical analysis
ISSN:	2162-237X, 2162-2388, 2162-2388
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!