research
∙
08/12/2023
Hadamard-Hitchcock decompositions: identifiability and computation
A Hadamard-Hitchcock decomposition of a multidimensional array is a deco...
share
research
∙
05/19/2023
What part of a numerical problem is ill-conditioned?
Many numerical problems with input x and output y can be formulated as a...
research
∙
08/17/2022
The condition number of singular subspaces
The condition number of computing the invariant left or right singular s...
research
∙
06/30/2022
Group-invariant tensor train networks for supervised learning
Invariance has recently proven to be a powerful inductive bias in machin...
research
∙
10/08/2021
Three decompositions of symmetric tensors have similar condition numbers
We relate the condition numbers of computing three decompositions of sym...
research
∙
09/22/2021
Relative-error stability of numerical algorithms
We formalize the definition of a stable algorithm that is (i) adapted to...
research
∙
08/30/2021
Algebraic compressed sensing
We introduce the broad subclass of algebraic compressed sensing problems...
research
∙
08/02/2021
Tensor completion using geodesics on Segre manifolds
We propose a Riemannian conjugate gradient (CG) optimization method for ...
research
∙
07/03/2021
ATC: an Advanced Tucker Compression library for multidimensional data
We present ATC, a C++ library for advanced Tucker-based lossy compressio...
research
∙
06/24/2021
The condition number of many tensor decompositions is invariant under Tucker compression
We characterise the sensitivity of several additive tensor decomposition...
research
∙
03/12/2021
Normal Forms for Tensor Rank Decomposition
We propose a new algorithm for computing the tensor rank decomposition o...
research
∙
02/28/2021
Sensitivity of low-rank matrix recovery
We characterize the first-order sensitivity of approximately recovering ...
research
∙
09/26/2019