Low-Precision Rank Compensation for Matrices and Tensor Trains

Lower numerical precision reduces storage and memory traffic but raises the perturbation floor.

We study rank compensation: reinvesting saved memory in a larger approximation rank.

For matrices, the singular-value error identity yields a directly testable sufficient condition requiring the additional singular component to offset the perturbation from storing the rank-augmented approximation in lower precision.

On ten SuiteSparse matrices, all 100 truncation-dominated configurations (50 FP32 and 50 FP16) are certified non-increases and strict accuracy wins, with mean error ratio $0.963$ and storage ratios $58.8\%$ and $29.4\%$ relative to the FP64 baseline.

FP16 failures occur only in tail-rank stress tests near the perturbation floor.

At the largest resident matrix-application batch, compensated FP32 and FP16 achieve geometric-mean A100 speedups of $1.28\times$ and $2.12\times$; neither accelerates the smallest batch.

For Tensor-Train (TT) approximation, we give a conditional a posteriori extension based on the measured truncation gain and rounded-core perturbation.

Across three-way and six-way synthetic tests, FP32 and FP16 achieve combined accuracy-memory wins in 10 of 20 and 14 of 20 trials.

On public hyperspectral tensors and FROSTT top-active subtensors, the corresponding counts are 44 of 60 and 54 of 60; four FP16 Salinas-A tail-stress cases fail.

No certified TT case exceeds the FP64 error beyond numerical tolerance.

Reconstruction of six public tensors yields geometric-mean compensated speedups of $1.38\times$ (FP32) and $1.94\times$ (FP16).

Timings cover resident downstream kernels, not factorization, transfers, or end-to-end acceleration.