REVIEW 4 cited by
A Hierarchical Singular Value Decomposition Algorithm for Low Rank Matrices
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original abstract
Singular value decomposition (SVD) is a widely used technique for dimensionality reduction and computation of basis vectors. In many applications, especially in fluid mechanics and image processing the matrices are dense, but low-rank matrices. In these cases, a truncated SVD corresponding to the most significant singular values is sufficient. In this paper, we propose a tree based merge-and-truncate algorithm to obtain an approximate truncated SVD of the matrix. Unlike previous methods, our technique is not limited to "tall and skinny" or "short and fat" matrices and it can be used for matrices of arbitrary size. The matrix is partitioned into blocks and the truncated SVDs of blocks are merged to obtain the final SVD. If the matrices are low rank, this algorithm gives significant speedup over finding the truncated SVD, even when run on a single core. The error is typically less than 3\%.
Forward citations
Cited by 4 Pith papers
-
PACT: Preserving Anchored Cores in Task-vectors for Model Merging
PACT preserves load-bearing wall dimensions from pre-trained weights inside task vectors to reduce conflicts and improve merged model performance.
-
Accurate and Resource-Efficient Federated Continual Learning
FedRAN achieves up to 4.8 pp higher accuracy in federated continual learning while using 30-122× less per-client communication by transmitting truncated-SVD summaries of random-feature Gram matrices and performing clo...
-
No Task Left Behind: Isotropic Model Merging with Common and Task-Specific Subspaces
Uniformly rescaling singular values of summed task updates, plus adding task-specific residual directions, improves multi-task model merging.
-
Learnable Similarity and Dissimilarity Guided Symmetric Non-Negative Matrix Factorization
A symmetric nonnegative matrix factorization variant that learns weights over nearest-neighbor slices for similarity and dissimilarity, plus a column-wise orthogonality regularizer, improves clustering on eight benchmarks.
Discussion (0). Continue with ORCID to comment.