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...

Full description

Saved in:

Bibliographic Details
Published in:	IEEE transaction on neural networks and learning systems Vol. 35; no. 7; pp. 9428 - 9442
Main Authors:	Wang, Chenhao, Yi, Qianxin, Liao, Xiuwu, Wang, Yao
Format:	Journal Article
Language:	English
Published:	United States IEEE 01.07.2024 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!