cs.LGOct 12, 2026

Making Tensor Decoupling More Robust and Less Parametric

Authors: Maxime Rochkoulets, Joppe De Jonghe, Mariya Ishteva

Organizations: Department of Computer Science, KU Leuven, Belgium · Department of Computer Science, NUMA, KU Leuven, 2440 Geel, Belgium

Abstract

Tensor decoupling algorithms recover compact representations of multivariate functions by combining linear factor matrices with univariate internal nonlinearities. We identify two limitations of recent methods. First, their performance is not invariant to mismatched output or gradient magnitudes, and second, their spline internals require manual tuning of their degrees of freedom. We propose two lightweight fixes. The first is a preprocessing step that rescales the input Jacobian tensor, removing both the bias towards larger magnitude outputs and the ill-conditioning of certain factor updates caused by such a mismatch. The second replaces B-spline internals by penalized splines coupled with generalized cross-validation, making the method less dependent on the user selecting the right number of control points. Finally, we release an efficient open-source JAX implementation of our algorithm.

Figures & tables

Explore similar work

CardsList
  1. Robust Basis Spline Decoupling for the Compression of Transformer Models

    May 11, 2026Joppe De Jonghe, Van Tien Pham, Mariya IshtevaModel CompressionTensor Decomposition

  2. asdex: Automatic Sparse Differentiation in JAX

    Oct 8, 2026Adrian Hill, Guillaume DalleAutomatic DifferentiationStructured Sparsity

  3. Reparameterized Tensor Ring Functional Decomposition for Multi-Dimensional Data Recovery

    Mar 1, 2026Yangyang Xu, Junbo Ke, You-Wei Wen +1Tensor DecompositionTensor Completion