Skip to content
DraconiticResearch
Search Sources API
201,642 studies31 sourcesUpdated 16 min ago
PreprintCC BY 4.0arXiv

Error Analysis and Precision Selection for Mixed-Precision DEIM-CUR Decompositions

Abstract

CUR approximation is a popular approach for constructing an interpretable low-rank approximation of a matrix. There are many approaches for constructing the CUR approximation, many of which are based on the SVD. Results in the literature bounding the quality of the approximation usually rely on the assumption that all or part of the SVD is computed exactly. In this work, we relax this assumption and show how the quality of the approximation is affected by an inexact SVD. Moreover, we analyze the effect of finite precision arithmetic on the DEIM-CUR method. Our analysis suggests guidelines for selecting the working precisions for the SVD and the DEIM index selection algorithm. In particular, it suggests that in many cases one can use very low precisions for these computations without significantly impacting the approximation quality. A set of numerical experiments is presented to demonstrate the theoretical results.

Related

  1. LampAttention: Look-Ahead Mixed-Precision FlashAttention for Dedicated Accelerators
    Stanislav Budzinskiy, Marian Gloser, Tolunay Yilmaz +5
    arXivPreprintCC BY 4.0Full textNumerical analysis & scientific computingarXiv
  2. Mixed Precision Compression of Tucker Decomposition
    Grey Ballard, Theo Mary, Bhisham Dev Verma
    ACM Transactions on Mathematical SoftwarePeer-reviewedCC BY 4.0Full textGeneral mathematicsHAL
  3. Mixed precision solvers for the all-at-once Runge--Kutta discretization of the heat equation
    Santolo Leveque, Luca Bergamaschi, Ángeles Martínez +1
    arXivPreprintCC BY 4.0Full textNumerical analysis & scientific computingarXiv
  4. A Mixed-Precision Model for Matrix-Splitting Methods
    Neil Lindquist, David Appelhans, Chales W. Jackson +1
    arXivPreprintarXiv licenceFull textNumerical analysis & scientific computingarXiv
  5. Right Precision, Right Place: Runtime Adaptations for Mixed-Precision Cholesky Factorization
    Qinglei Cao, Theo Mary, Rabab Alomairy +2
    HALPreprintCC BY-NC-ND 4.0Full textNumerical analysis & scientific computingHAL
BibTeX
@misc{thanasis2026error,
  title = {{Error Analysis and Precision Selection for Mixed-Precision DEIM-CUR Decompositions}},
  author = {Ioannis Thanasis and Erin Carson},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.24509},
  eprint = {2609.24509},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.24509},
  note = {CC BY 4.0},
}
RIS
TY  - UNPB
TI  - Error Analysis and Precision Selection for Mixed-Precision DEIM-CUR Decompositions
AU  - Ioannis Thanasis
AU  - Erin Carson
PY  - 2026
DA  - 2026/09/22
PB  - arXiv
DO  - 10.48550/arxiv.2609.24509
UR  - https://arxiv.org/abs/2609.24509
AB  - CUR approximation is a popular approach for constructing an interpretable low-rank approximation of a matrix. There are many approaches for constructing the CUR approximation, many of which are based on the SVD. Results in the literature bounding the quality of the approximation usually rely on the assumption that all or part of the SVD is computed exactly. In this work, we relax this assumption and show how the quality of the approximation is affected by an inexact SVD. Moreover, we analyze the effect of finite precision arithmetic on the DEIM-CUR method. Our analysis suggests guidelines for selecting the working precisions for the SVD and the DEIM index selection algorithm. In particular, it suggests that in many cases one can use very low precisions for these computations without significantly impacting the approximation quality. A set of numerical experiments is presented to demonstrate the theoretical results.
ER  -