Tensor networks are powerful formats for compressing large-scale data. However, their application to general data processing has been limited by the difficulty of performing nonlinear operations. Here, we introduce iterative tensor network transformations (ITNTs), a general algorithmic framework for the element-wise evaluation of elementary and nonlinear filtering functions on data encoded as tensor trains (TTs), a class of tensor networks. Our approach operates entirely in the compressed domain, enabling efficient computation on exponentially large datasets while maintaining a controlled computational cost. We demonstrate its power in two key areas: (I) evaluating highly nonlinear elementary and filtering functions on a 3D reactive flow field, enabling high-fidelity reaction rate computation and region filtering, and (II) finding extrema in complex optimization problems, such as solving Max-SAT instances on spaces up to $2^{70}$ configurations. These results establish ITNT as a foundational tool that provides tensor network methods with the capability for general-purpose data science and large-scale optimization.
We address the problem of recovering highly oscillatory operators, represented as matrices with a fixed set of observed entries. Given that these matrices can be well compressed by butterfly matrix decomposition of levels requiring only degrees of freedom, we propose a novel reformulation of the butterfly structure a...
Navjot Singh, Edgar Solomonik, X. Li et al.· Numerical Linear Algebra wit...· 0 citations
Online TT-ALS (Alternating Least Squares) is introduced, an algorithm that sequentially enforces orthogonality constraints that allows for efficient and exact updates of the core tensor while maintaining high reconstruction accuracy and is suitable for low-latency real-time processing applications.
A new SVD-based tensor decomposition method for tensor networks with arbitrary graph topologies is introduced, and it is found that the graph-format representation attains comparable or better accuracy than the classical tensor train and hierarchical Tucker tensor formats, while using substantially fewer degrees of fre...
A new method for automatically generating parametric mappings agnostic of the input problem sizes for the class of DAGs of tensor computations is introduced, based on the insight that in parametric DAGs not all parameters are equally important.
Botao Wu, Martin Kong· International Conference on...· 0 citations
In this work, we present the tree tensor network Nyström (TTNN), an algorithm that extends recent research on streamable tensor approximation, such as for Tucker and tensor‐train formats, to the more general tree tensor network format, enabling a unified treatment of various existing methods. Our method retains the k...
Alberto Bucci, Gianfranco Verzella· Numerical Linear Algebra wit...· 0 citations
Developing nonlinear models that are both expressive and computationally efficient remains a challenge in machine learning and nonlinear system identification. Tensor network kernel machines (TNKM) address this challenge by combining nonlinear feature representations with compact low-rank tensor-network parameterizatio...
Machine-learning networks can learn without detailed instructions from a designer. Those that do may offer insight into how the brain reorganizes itself during learning.
MIT News · Artificial Intelligence· news.mit.eduOct 2, 2026
Professor Sherry Turkle’s new book, “Artificial Intimacy,” offers a withering critique of chatbots and the antisocial dynamics she believes they encourage.
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.