We propose a randomized, streamable algorithm that computes a tensor-train approximation of a matrix-vector product without ever forming the full intermediate tensor. We develop three contraction strategies for streaming tensor-train approximation (STTA): sequential, fused, and pre-sketched. We focus on the regime of l...
Discovering the structure and kinetics of chemical reaction networks (CRNs) from time-series concentration data is a fundamental challenge in chemical kinetics, with existing approaches relying on prior mechanistic assumptions or suffering from high computational cost and noise sensitivity. In this work, we present int...
The study establishes a connection between the complexity of algorithmic sequences and the memorization capacity of neural architectures, revealing the trade-offs involving memorization quality, rollout stability, and computational expense.
Xin-Ye Chen, S. Güttel, Mohammad Mozaffari· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.