Compressed Sensing with Quantized Tensor Trains (QTTs)

DOI10.48550/arXiv.2609.36506MaRDI QIDQ7360732arXivFDO

Authors Jingchun Shao

Publication date 29 September 2026

Published in arXiv

Tldr We study compressed sensing of tensorized signals combining bounded TT rank with sparse low-order interaction structure via randomly sampled Walsh--Hadamard measurements, establishing a uniform restricted isometry property and measurement condition for noiseless uniqueness. We also propose an initializer that reduces the required measurements from exponentially to polynomially growing with the tensor order d.

Full work available at URL https://doi.org/10.48550/arXiv.2609.36506

arXiv classification

math.NA

Cites work

• \(O(d \log N)\)-quantics approximation of \(N\)-\(d\) tensors in high-dimensional numerical modeling
• A block-sparse Tensor Train Format for sample-efficient high-dimensional Polynomial Regression
• A least-squares method for sparse low rank approximation of multivariate functions
• A mathematical introduction to compressive sensing
• Approximation of 2d²^d matrices using tensor decomposition
• Approximation of high-dimensional periodic functions with Fourier-based methods
• Decoding by Linear Programming
• Decoding by Linear Programming
• Fast operator learning for mapping correlations
• General foundations of high-dimensional model representations
• Grouped transformations and regularization in high-dimensional explainable ANOVA approximation
• Learning many-body Hamiltonians with Heisenberg-limited scaling
• Low rank tensor recovery via iterative hard thresholding
• On sparse reconstruction from Fourier and Gaussian measurements
• Provable Tensor-Train Format Tensor Completion by Riemannian Optimization
• Riemannian optimization for high-dimensional tensor completion
• Robust low-rank tensor train recovery
• Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
• Tensor Analysis of ANOVA Decomposition
• Tensor Density Estimator by Convolution-Deconvolution
• Tensor recovery from quantized measurements based on modewise operators
• Tensor-train decomposition
• The alternating linear scheme for tensor optimization in the tensor train format
• The density-matrix renormalization group in the age of matrix product states
• The restricted isometry property of subsampled Fourier matrices
• User-friendly tail bounds for sums of random matrices
• Weighted sparsity and sparse tensor networks for least squares approximation

This page was built for publication: Compressed Sensing with Quantized Tensor Trains (QTTs)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7360732)