Recursive sketched interpolation: Efficient Hadamard products of tensor trains

The Hadamard product of two tensors in the tensor-train (TT) format is a fundamental operation across various applications, such as TT-based function multiplication for nonlinear differential equations or convolutions. However, conventional methods for computing this product typically scale as at least \mathcal{O}(\chi^4) 𝒪 ( χ 4 ) with respect to the TT bond dimension (TT-rank) \chi χ , creating a severe computational bottleneck in practice. By combining randomized tensor-train sketching with slice selection via interpolative decomposition, we introduce Recursive Sketched Interpolation (RSI), a “scale product” algorithm that computes the Hadamard product of TTs at a computational cost of \mathcal{O}(\chi^3) 𝒪 ( χ 3 ) . Benchmarks across various TT scenarios demonstrate that RSI offers superior scalability compared to traditional methods while maintaining comparable accuracy. We generalize RSI to compute more complex operations, including Hadamard products of multiple TTs and other element-wise nonlinear mappings, without increasing the complexity beyond \mathcal{O}(\chi^3) 𝒪 ( χ 3 ) .

Authors

Institutions

Publication Details

Journal
SciPost Physics
Published
2026-11-17
DOI
https://doi.org/10.21468/scipostphys.21.5.122
Citations
16
Primary Topic
Tensor decomposition and applications
Type
article
Field-Weighted Citation Impact
15.23
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

Recursive sketched interpolation: Efficient Hadamard products of tensor trains

Edwin Miles Stoudenmire, Yuehaw Khoo, Jiajia Li, Zhaonan Meng
16 citations
SciPost Physics
Tensor decomposition and applications
15.23
article

Recursive sketched interpolation: Efficient Hadamard products of tensor trains

Edwin Miles Stoudenmire, Yuehaw Khoo, Jiajia Li, Zhaonan Meng
article en
16 citations

Abstract

The Hadamard product of two tensors in the tensor-train (TT) format is a fundamental operation across various applications, such as TT-based function multiplication for nonlinear differential equations or convolutions. However, conventional methods for computing this product typically scale as at least \mathcal{O}(\chi^4) 𝒪 ( χ 4 ) with respect to the TT bond dimension (TT-rank) \chi χ , creating a severe computational bottleneck in practice. By combining randomized tensor-train sketching with slice selection via interpolative decomposition, we introduce Recursive Sketched Interpolation (RSI), a “scale product” algorithm that computes the Hadamard product of TTs at a computational cost of \mathcal{O}(\chi^3) 𝒪 ( χ 3 ) . Benchmarks across various TT scenarios demonstrate that RSI offers superior scalability compared to traditional methods while maintaining comparable accuracy. We generalize RSI to compute more complex operations, including Hadamard products of multiple TTs and other element-wise nonlinear mappings, without increasing the complexity beyond \mathcal{O}(\chi^3) 𝒪 ( χ 3 ) .

SciPost PhysicsVol. 21(5)
North Carolina State University (US), University of Chicago (US), Flatiron Institute (US)
Openalex Percentile: Top 0%
Tensor decomposition and applications
15.23
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon