

























Abstract:EigenDecomposition (ED) is at the heart of many computer vision algorithms and applications. One crucial bottleneck limiting its usage is the expensive computation cost, particularly for a mini-batch of matrices in deep neural networks. Our previous work proposed a dedicated QR-based ED algorithm for batched small matrices (dim${<}32$). This short paper targets the limitation and proposes a batch-efficient Divide-and-Conquer based ED algorithm for larger matrices. The numerical test shows that for a mini-batch of matrices whose dimensions are smaller than $64$, our method can be much faster than the Pytorch SVD function.
| Subjects: | Machine Learning (cs.LG); Numerical Analysis (math.NA) |
| Cite as: | arXiv:2604.27325 [cs.LG] |
| (or arXiv:2604.27325v1 [cs.LG] for this version) | |
| https://doi.org/10.48550/arXiv.2604.27325 arXiv-issued DOI via DataCite (pending registration) |
From: Yue Song [view email]
[v1]
Thu, 30 Apr 2026 02:13:02 UTC (10,319 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。