Metraipolis › archive › dc_5b45ffaa4a50

Compressed Sensing with Quantized Tensor Trains (QTTs) — arXiv:2609.36506

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.36506
License (as archived)
CC0-1.0
Archived
2026-10-07T18:06:21.062Z
SHA-256 of the archived text
36091b6072118e9b835c9dabf93746acb3ed7cd98a360a3c5034fdd2c264cf40
Stable URL of this page
https://metraipolis.com/documento/dc_5b45ffaa4a50

How to cite

Compressed Sensing with Quantized Tensor Trains (QTTs) — arXiv:2609.36506 — arXiv (en), https://arxiv.org/abs/2609.36506 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_5b45ffaa4a50 (Metraipolis archive dc_5b45ffaa4a50, sha256 36091b6072118e9b835c9dabf93746acb3ed7cd98a360a3c5034fdd2c264cf40)
BibTeX
@misc{dc5b45ffaa4a50,
  title = {Compressed Sensing with Quantized Tensor Trains (QTTs) — arXiv:2609.36506},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.36506},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_5b45ffaa4a50; sha256 36091b6072118e9b835c9dabf93746acb3ed7cd98a360a3c5034fdd2c264cf40},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.36506. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

The storage and recovery of a vector of length \(2^d\) can become prohibitively expensive as \(d\) grows, a manifestation of the curse of dimensionality. For certain structured functions and multiscale quantities, the resulting discretized vectors admit compact quantized tensor train (QTT) representations after binary tensorization: a length-\(2^d\) vector is reshaped into a \(d\)-way binary tensor with low tensor-train (TT) rank. Motivated by this construction, we study compressed sensing of tensorized signals that combine bounded TT rank with sparse low-order interaction structure, using randomly sampled Walsh--Hadamard measurements. For this structured model class, we establish a uniform restricted isometry property and derive a measurement condition guaranteeing uniqueness of noiseless recovery. We also propose a structure-aware initializer for the alternating linear scheme (ALS), obtained by projecting the adjoint backprojection onto the low-order interaction space before applying TT-SVD. We prove a uniform initialization error bound whose measurement requirement, for fixed structural parameters, grows polynomially with the tensor order \(d\) rather than with the ambient dimension \(2^d\). Numerical experiments support the predicted RIP and initialization scaling and demonstrate more reliable ALS recovery.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-30 in math.NA).
Categorie arXiv: Numerical Analysis (math.NA).
Pagina del lavoro: https://arxiv.org/abs/2609.36506 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-07T17:39:14.401Z dalla pagina https://arxiv.org/catchup/math.NA/2026-09-30?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).