Mixed Precision Compression of Tucker Decomposition
Abstract
We present a mixed precision approach for improving Tucker-based lossy compression of multiway data. Current Tucker decomposition algorithms use a uniform floating-point precision and obtain compression by minimizing the multilinear ranks of the representation subject to the target error tolerance. Our algorithm automatically determines which parameters of the representation can be stored in lower precision to improve the compression ratio without exceeding the error tolerance. Crucially, we show that the opportunities to reduce precision are not uniform across parameters, and thus using multiple precisions allows for smoothly transitioning across tolerances between the precisions of standard formats. Theoretical error bounds and numerical experiments validate the approach, and we obtain up to 2× and 4× compression improvement factors over initial Tucker approximations of single and double precision real-world numerical simulation data, respectively.
Related
- Sequential Functional Structured Tucker Compression for Large Language Model Attentions
- An Efficient Randomized Hierarchical Tucker Decomposition
- Finite-Bit CSI Compression Under Feedback Constraints: Exact PCA Error Decomposition and Robust Dimension–Bit Allocation for MISO-OFDM
- Adaptive Local Proper Orthogonal Decomposition via Graph Partitioning and Provable Error-Bounded Lossy Compression for Parametric Series in Finite-Dimensional Function Spaces
- Length-Preserving Vessel Trajectory Simplification With Controllable Compression-Precision Bound
BibTeX
@article{ballard2026mixed,
title = {{Mixed Precision Compression of Tucker Decomposition}},
author = {Grey Ballard and Theo Mary and Bhisham Dev Verma},
journal = {ACM Transactions on Mathematical Software},
year = {2026},
month = oct,
url = {https://hal.science/hal-05640503v2},
note = {CC BY 4.0},
}
RIS
TY - JOUR
TI - Mixed Precision Compression of Tucker Decomposition
AU - Grey Ballard
AU - Theo Mary
AU - Bhisham Dev Verma
PY - 2026
DA - 2026/10/19
JO - ACM Transactions on Mathematical Software
UR - https://hal.science/hal-05640503v2
AB - We present a mixed precision approach for improving Tucker-based lossy compression of multiway data. Current Tucker decomposition algorithms use a uniform floating-point precision and obtain compression by minimizing the multilinear ranks of the representation subject to the target error tolerance. Our algorithm automatically determines which parameters of the representation can be stored in lower precision to improve the compression ratio without exceeding the error tolerance. Crucially, we show that the opportunities to reduce precision are not uniform across parameters, and thus using multiple precisions allows for smoothly transitioning across tolerances between the precisions of standard formats. Theoretical error bounds and numerical experiments validate the approach, and we obtain up to 2× and 4× compression improvement factors over initial Tucker approximations of single and double precision real-world numerical simulation data, respectively.
SN - 0098-3500
ER -