Hierarchical Search of Tree Tensor Networks for High-Dimensional Data

Abstract

Tensor network methods provide a scalable solution to represent high-dimensional data. However, their efficacy is often limited by static, expert-defined structures that fail to adapt to evolving data correlations. We address this limitation by formalizing the structural rounding problem for tree tensor networks and introducing a hierarchical search algorithm HIST, which automatically identifies optimized structures with index reshaping for input tree tensor networks. To navigate the combinatorial explosion of the structural search space, HIST integrates stochastic sub-network sampling with hierarchical refinement. This approach utilizes entropy-guided index clustering to reduce dimensionality and targeted reshaping to expose latent data correlations. Numerical experiments on analytical functions and real-world physics applications, including thermal radiation transport, neutron diffusion, and computational fluid dynamics, demonstrate that HIST exhibits empirical polynomial scaling with dimensionality relative to the sampling budget, bypassing the scalability barriers in prior work. HIST achieves compression ratios $2.5\times$ to $100\times$ higher than standard fixed formats such as Tensor Trains and Hierarchical Tuckers (peaking at $1000\times$). Furthermore, HIST discovers structures that generalize effectively: applying a structure optimized for one data instance to a related target data typically maintains compression performance within $10\%$ of the result obtained by performing structure search on that target data. These results highlight HIST as a robust, automated tool for adaptive data representation and high-dimensional simulation compression with tensor network methods.