Comb Tensor Networks vs. Matrix Product States: Enhanced Efficiency in High-Dimensional Spaces
This work addresses computational bottlenecks for researchers and practitioners in machine learning and physics working with high-dimensional data, though it appears incremental as it builds on existing tensor network methods.
The paper tackled the problem of computational inefficiency in generative modeling of high-dimensional continuous data using tensor networks, finding that a comb-shaped architecture reduces computational overhead compared to traditional Matrix Product States beyond certain thresholds in data and bond dimensions.
Modern approaches to generative modeling of continuous data using tensor networks incorporate compression layers to capture the most meaningful features of high-dimensional inputs. These methods, however, rely on traditional Matrix Product States (MPS) architectures. Here, we demonstrate that beyond a certain threshold in data and bond dimensions, a comb-shaped tensor network architecture can yield more efficient contractions than a standard MPS. This finding suggests that for continuous and high-dimensional data distributions, transitioning from MPS to a comb tensor network representation can substantially reduce computational overhead while maintaining accuracy.