Saved in:
Bibliographic Details
Main Author: Song, Yue
Format: Preprint
Published: 2026
Subjects:
Online Access:https://arxiv.org/abs/2604.27325
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866915970412445696
author Song, Yue
author_facet Song, Yue
contents 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.
format Preprint
id arxiv_https___arxiv_org_abs_2604_27325
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle A Short Note on Batch-efficient Divide-and-Conquer Algorithm for EigenDecomposition
Song, Yue
Machine Learning
Numerical Analysis
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.
title A Short Note on Batch-efficient Divide-and-Conquer Algorithm for EigenDecomposition
topic Machine Learning
Numerical Analysis
url https://arxiv.org/abs/2604.27325