arXiv:2606. 01975v1 Announce Type: new Abstract: We consider LLM-based algorithm development through a case study on contractionorder optimisation for tensor networks with OpenEvolve.
arXiv:2606. 00130v1 Announce Type: cross Abstract: We study Automatically Differentiable Nonlinear Tensor Networks (ADNTNs), a family of structured weight generators whose compact core tensors are trained end-to-end by reverse-mode automatic differentiation (AD).
arXiv:2606. 25975v1 Announce Type: new Abstract: Common first-order optimizers, such as Adam, implicitly treat each parameter block as an unstructured vector, which disregards the multilinear weight structure present in many modern machine learning models.
Common first-order optimizers, such as Adam, implicitly treat each parameter block as an unstructured vector, which disregards the multilinear weight structure present in many modern machine learning models. Recent work has shown that exploiting matrix structure can improve optimization dynamics.
arXiv:2608. 17135v1 Announce Type: cross Abstract: Tensor networks are powerful formats for compressing large-scale data.
arXiv:2606. 08565v1 Announce Type: cross Abstract: Tensor networks provide efficient representations for compressing large neural networks.
arXiv:2609.00870v1 Announce Type: cross Abstract: Tensor networks, originally developed for quantum many-body physics, are promising models for machine learning. We derive stochastic Riemannian optim...
arXiv:2606. 03465v1 Announce Type: cross Abstract: Post-training compression is essential for deploying large language models (LLMs) under tight resource constraints.
arXiv:2608. 01633v1 Announce Type: new Abstract: Large language models (LLMs) enable neural architecture search (NAS) directly over executable neural network programs.
Post-training compression is essential for deploying large language models (LLMs) under tight resource constraints. Tensor decompositions have emerged as a promising direction, offering compact parameterizations well suited to Transformer weight structures.
The article offers an expository overview of why higher‑arity tensor operations matter for deep learning. It presents an empirical study of higher‑arity phenomena in trained neural networks, introduces a hypergraphical generalization of the multilayer perceptron, and examines links to evolutionary algorithms. The paper concludes by outlining promising future research directions.
arXiv:2606. 00130v2 Announce Type: replace-cross Abstract: Large deep neural networks are costly to store and deploy because inference must move and evaluate many parameters.
The paper introduces a quantum tensor network learning framework that employs matrix product states (MPS) as a machine‑learning architecture, adding a global normalization condition to interpret the MPS as a quantum state. It compares two optimization strategies—gradient descent and a DMRG‑adapted method—to identify locally optimal tensors and evaluates their effectiveness.