arXiv AI
Tensor network representations of discrete maximum entropy distributions via mean polytopes
Read the original on arXiv AI →The Flow has not summarised this story yet — read it at arXiv AI.
Related stories
arXiv Machine Learning
Sep 4
Parameterised graph theory for tensor networks: entanglement rerouting, structural simplification, and agnostic tomography
The paper applies parameterised graph theory to tensor networks, showing that cutwidth and tree‑cutwidth bound the bond‑dimension overhead needed to represent a tensor‑network state as a matrix product state or tree tensor network. It derives graph‑dependent upper bounds on the sample and computational complexity of tensor‑network tomography, introducing a new graph parameter called learning complexity. Finally, it extends the framework to an agnostic learner that approximates any state with a tensor‑network state of given bond dimension, providing explicit graph‑dependent complexity bounds.
arXiv Machine Learning
Oct 28
On the Architectural Complexity of Neural Networks
The paper presents a unified theoretical framework for analyzing and constructing deep neural networks by explicitly modeling tensor operations, which are often abstracted in existing theories. This framework allows researchers to study how architectural complexity has evolved over the past 40 years and to automatically generate new architectures using novel tensor operations. The authors also release a dataset of over 3,000 higher‑complexity architectures that have not yet been explored, providing a resource for future research.
Hugging Face Trending Papers
Jul 29
Universality and Approximation Rates of Graph Neural Networks with Random Features
We investigate message-passing graph neural networks with random node features. Random node features are known to enhance the expressiveness of graph neural networks (GNNs) both theoretically and empirically.
arXiv AI
Sep 1
Understanding Deep Learning via Entropy Space Theory
arXiv:2608.29279v1 Announce Type: new Abstract: Deep learning is often criticized for its theoretical research lagging behind practice. To make deep learning easier to understand, the entropy space t...
arXiv Machine Learning
Aug 4
Do Neural Networks Really Beat the Curse of Dimensionality? A Bit-Complexity View
arXiv:2608. 01357v1 Announce Type: new Abstract: Traditional approximation theory measures convergence rates in terms of the number of parameters or degrees of freedom.
arXiv Machine Learning
Sep 23
Riemannian Optimization on Tree Tensor Networks with Application in Machine Learning
The paper presents a formal analysis of the quotient geometry of tree tensor networks (TTNs) and introduces efficient first- and second-order optimization algorithms that leverage this geometry. It also develops a backpropagation method for training TTNs in a kernel learning context. Numerical experiments on a digit classification task demonstrate a tradeoff between two horizontal distributions: one provides clearer geometric insights, while the other yields more efficient algorithms.