Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2510.06361

Diffusion-Guided Renormalization of Neural Systems via Tensor Networks

Nathan X. Kodama

Published Oct 7, 2025• 0 citations
arXivHTMLPDF

Abstract

Far from equilibrium, neural systems self-organize across multiple scales. Exploiting multiscale self-organization in neuroscience and artificial intelligence requires a computational framework for modeling the effective non-equilibrium dynamics of stochastic neural trajectories. Non-equilibrium thermodynamics and representational geometry offer theoretical foundations, but we need scalable data-driven techniques for modeling collective properties of high-dimensional neural networks from partial subsampled observations. Renormalization is a coarse-graining technique central to studying emergent scaling properties of many-body and nonlinear dynamical systems. While widely applied in physics and machine learning, coarse-graining complex dynamical networks remains unsolved, affecting many computational sciences. Recent diffusion-based renormalization, inspired by quantum statistical mechanics, coarse-grains networks near entropy transitions marked by maximal changes in specific heat or information transmission. Here I explore diffusion-based renormalization of neural systems by generating symmetry-breaking representations across scales and offering scalable algorithms using tensor networks. Diffusion-guided renormalization bridges microscale and mesoscale dynamics of dissipative neural systems. For microscales, I developed a scalable graph inference algorithm for discovering community structure from subsampled neural activity. Using community-based node orderings, diffusion-guided renormalization generates renormalization group flow through metagraphs and joint probability functions. Towards mesoscales, diffusion-guided renormalization targets learning the effective non-equilibrium dynamics of dissipative neural trajectories occupying lower-dimensional subspaces, enabling coarse-to-fine control in systems neuroscience and artificial intelligence.

DOI
10.48550/arxiv.2510.06361

Related papers

Neural Renormalization Group Flow for Percolation

Anaclara Alvez, Luca Camagna, Sergio Chibbaro +4 more

Machine learning offers a possible route to data-driven real-space renormalization when the relevant observables are nonlocal and difficult to prescribe explicitly. We explore this idea for two-dimensional site percolation developping a supervised, scale-shared neural architecture. The model recursively applies the same learned coarse-graining rule across scales, producing a latent field from which the crossing probability is predicted, while a corresponding fine-graining decoder reconstructs the largest-cluster mask. Trained only on small lattices, the model extrapolates to substantially larger systems, recovers the spanning cluster with high fidelity, and produces observables obeying the expected finite-size scaling near the critical point. We observe that to get such performance it is key that the learned latent representation exhibits critical fluctuations and scale-dependent flows consistent with the renormalization-group structure of percolation.

arXiv:2608.26764•Aug 27, 2026•0 citations

Tensor Network Neuroscience: A Rigorous Mathematical Framework

Rolando P. Hong Enriquez

We propose that neural activity can be rigorously modeled as tensor network states, with cortical hierarchies mapping onto a Multi-scale Entanglement Renormalization Ansatz (MERA) architecture. Within this framework, we identify the effective bond dimension as a measurable neural correlate of consciousness, providing a computationally tractable alternative to integrated information theory. We prove that a tensor-network-based integration measure preserves key properties of established consciousness theories while remaining efficiently computable. The hierarchical organization of the visual cortex—from primary through associative areas—is shown to follow quantitative coarse-graining laws consistent with renormalization group structure. We derive explicit bounds on information capacity and learning complexity, and specify experimental protocols using standard neuroimaging technology. The framework yields falsifiable predictions: bond dimension values across cortical regions, exponential decay of bond dimension under anesthesia, and a universal consciousness threshold at loss of consciousness. Each claim is assigned an explicit epistemic level, separating proven mathematical theorems from empirically testable hypotheses and speculative interpretations. This approach opens pathways toward objective consciousness diagnostics in disorders of awareness and personalized anesthesia monitoring.

•May 7, 2026•0 citations

Renormalizing Diffusion Models

Jordan S. Cotler, Semon Rezchikov

We explain how to use diffusion models to learn inverse renormalization group flows of statistical and quantum field theories. Diffusion models are a class of machine learning models which have been used to generate samples from complex distributions, such as the distribution of natural images. These models achieve sample generation by learning the inverse process to a diffusion process which adds noise to the data until the distribution of the data is pure noise. Nonperturbative renormalization group schemes in physics can naturally be written as diffusion processes in the space of fields. We combine these observations in a concrete framework for building ML-based models for studying field theories, in which the models learn the inverse process to an explicitly-specified renormalization group scheme. We detail how these models define a class of adaptive bridge (or parallel tempering) samplers for lattice field theory. Because renormalization group schemes have a physical meaning, we provide explicit prescriptions for how to compare results derived from models associated to several different renormalization group schemes of interest. We also explain how to use diffusion models in a variational method to find ground states of quantum systems. We apply some of our methods to numerically find RG flows of interacting statistical field theories. From the perspective of machine learning, our work provides an interpretation of multiscale diffusion models, and gives physically-inspired suggestions for diffusion models which should have novel properties.

arXiv:2308.12355•Aug 23, 2023•5 citations

Explorations in machine learning for interacting many-body systems.

Jonathon Matthew Schulz-Beach

Most interacting many-body systems in physics are not analytically solvable. Instead, numerical methods are needed for the study of these complex and high-dimensional problems. At present, there are many interesting problems in strongly correlated systems that remain unsolved with current methods. At the heart of this problem is finding an efficient representation that incorporates symmetries, correlations and general features. \n \nIn the context of computer science, machine learning techniques have had astonishing success at reducing the dimensionality of data. The leading method is through the use of artificial neural networks. These networks have been enormously successful at sifting through vast amounts of data to find patterns and regularities. In a sense, neural networks are themselves a statistical system whose properties are adjusted to mimic the features of the data. By finding an effective low-dimensional representation of the data, machine learning has greatly subdued the curse of dimensionality found in many real-world problems. \n \nIn this Thesis, we apply several machine learning techniques to the study of interacting many-body systems in classical and quantum statistical physics. We explore supervised classification of phases of matter with an emphasis on physical interpretation of the net- work. In doing so, we design a custom network architecture that possesses rotational symmetry as an inductive bias. We further investigate connections between the renormalization group and deep learning through applying a super-resolving neural network to the classical Ising model. Towards experimental efforts, we also repurpose generative machine learning to quantum state tomography for the calibration and testing of quantum devices. We conclude with a latent variable model inspired by near-term quantum algorithms. This maps to a variational Monte Carlo ansatz that produces samples efficiently for interacting quantum systems.

•Sep 3, 2020•0 citations

Learning nonequilibrium statistical mechanics and dynamical phase transitions

Ying Tang, Jing Liu, Jiang Zhang +1 more

Nonequilibrium statistical mechanics exhibit a variety of complex phenomena far from equilibrium. It inherits challenges of equilibrium, including accurately describing the joint distribution of a large number of configurations, and also poses new challenges as the distribution evolves over time. Characterizing dynamical phase transitions as an emergent behavior further requires tracking nonequilibrium systems under a control parameter. While a number of methods have been proposed, such as tensor networks for one-dimensional lattices, we lack a method for arbitrary time beyond the steady state and for higher dimensions. Here, we develop a general computational framework to study the time evolution of nonequilibrium systems in statistical mechanics by leveraging variational autoregressive networks, which offer an efficient computation on the dynamical partition function, a central quantity for discovering the phase transition. We apply the approach to prototype models of nonequilibrium statistical mechanics, including the kinetically constrained models of structural glasses up to three dimensions. The approach uncovers the active-inactive phase transition of spin flips, the dynamical phase diagram, as well as new scaling relations. The result highlights the potential of machine learning dynamical phase transitions in nonequilibrium systems.

arXiv:2208.08266•Aug 17, 2022•1 citation

Learning nonequilibrium statistical mechanics and dynamical phase transitions

Ying Tang, Jing Liu, Jiang Zhang +1 more

Nonequilibrium statistical mechanics exhibit a variety of complex phenomena far from equilibrium. It inherits challenges of equilibrium, including accurately describing the joint distribution of a large number of configurations, and also poses new challenges as the distribution evolves over time. Characterizing dynamical phase transitions as an emergent behavior further requires tracking nonequilibrium systems under a control parameter. While a number of methods have been proposed, such as tensor networks for one-dimensional lattices, we lack a method for arbitrary time beyond the steady state and for higher dimensions. Here, we develop a general computational framework to study the time evolution of nonequilibrium systems in statistical mechanics by leveraging variational autoregressive networks, which offer an efficient computation on the dynamical partition function, a central quantity for discovering the phase transition. We apply the approach to prototype models of nonequilibrium statistical mechanics, including the kinetically constrained models of structural glasses up to three dimensions. The approach uncovers the active-inactive phase transition of spin flips, the dynamical phase diagram, as well as new scaling relations. The result highlights the potential of machine learning dynamical phase transitions in nonequilibrium systems.

Nature Communications•Feb 6, 2024•28 citations
Far from equilibrium, neural systems self-organize across multiple scales. Exploiting multiscale self-organization in neuroscience and artificial intelligence requires a computational framework for modeling the effective non-equilibrium dynamics of stochastic neural trajectories. Non-equilibrium thermodynamics and representational geometry offer theoretical foundations, but we need scalable data-driven techniques for modeling collective properties of high-dimensional neural networks from partial subsampled observations. Renormalization is a coarse-graining technique central to studying emergent scaling properties of many-body and nonlinear dynamical systems. While widely applied in physics and machine learning, coarse-graining complex dynamical networks remains unsolved, affecting many computational sciences. Recent diffusion-based renormalization, inspired by quantum statistical mechanics, coarse-grains networks near entropy transitions marked by maximal changes in specific heat or information transmission. Here I explore diffusion-based renormalization of neural systems by generating symmetry-breaking representations across scales and offering scalable algorithms using tensor networks. Diffusion-guided renormalization bridges microscale and mesoscale dynamics of dissipative neural systems. For microscales, I developed a scalable graph inference algorithm for discovering community structure from subsampled neural activity. Using community-based node orderings, diffusion-guided renormalization generates renormalization group flow through metagraphs and joint probability functions. Towards mesoscales, diffusion-guided renormalization targets learning the effective non-equilibrium dynamics of dissipative neural trajectories occupying lower-dimensional subspaces, enabling coarse-to-fine control in systems neuroscience and artificial intelligence.
Machine learning offers a possible route to data-driven real-space renormalization when the relevant observables are nonlocal and difficult to prescribe explicitly. We explore this idea for two-dimensional site percolation developping a supervised, scale-shared neural architecture. The model recursively applies the same learned coarse-graining rule across scales, producing a latent field from which the crossing probability is predicted, while a corresponding fine-graining decoder reconstructs the largest-cluster mask. Trained only on small lattices, the model extrapolates to substantially larger systems, recovers the spanning cluster with high fidelity, and produces observables obeying the expected finite-size scaling near the critical point. We observe that to get such performance it is key that the learned latent representation exhibits critical fluctuations and scale-dependent flows consistent with the renormalization-group structure of percolation.
We propose that neural activity can be rigorously modeled as tensor network states, with cortical hierarchies mapping onto a Multi-scale Entanglement Renormalization Ansatz (MERA) architecture. Within this framework, we identify the effective bond dimension as a measurable neural correlate of consciousness, providing a computationally tractable alternative to integrated information theory. We prove that a tensor-network-based integration measure preserves key properties of established consciousness theories while remaining efficiently computable. The hierarchical organization of the visual cortex—from primary through associative areas—is shown to follow quantitative coarse-graining laws consistent with renormalization group structure. We derive explicit bounds on information capacity and learning complexity, and specify experimental protocols using standard neuroimaging technology. The framework yields falsifiable predictions: bond dimension values across cortical regions, exponential decay of bond dimension under anesthesia, and a universal consciousness threshold at loss of consciousness. Each claim is assigned an explicit epistemic level, separating proven mathematical theorems from empirically testable hypotheses and speculative interpretations. This approach opens pathways toward objective consciousness diagnostics in disorders of awareness and personalized anesthesia monitoring.
We explain how to use diffusion models to learn inverse renormalization group flows of statistical and quantum field theories. Diffusion models are a class of machine learning models which have been used to generate samples from complex distributions, such as the distribution of natural images. These models achieve sample generation by learning the inverse process to a diffusion process which adds noise to the data until the distribution of the data is pure noise. Nonperturbative renormalization group schemes in physics can naturally be written as diffusion processes in the space of fields. We combine these observations in a concrete framework for building ML-based models for studying field theories, in which the models learn the inverse process to an explicitly-specified renormalization group scheme. We detail how these models define a class of adaptive bridge (or parallel tempering) samplers for lattice field theory. Because renormalization group schemes have a physical meaning, we provide explicit prescriptions for how to compare results derived from models associated to several different renormalization group schemes of interest. We also explain how to use diffusion models in a variational method to find ground states of quantum systems. We apply some of our methods to numerically find RG flows of interacting statistical field theories. From the perspective of machine learning, our work provides an interpretation of multiscale diffusion models, and gives physically-inspired suggestions for diffusion models which should have novel properties.
Most interacting many-body systems in physics are not analytically solvable. Instead, numerical methods are needed for the study of these complex and high-dimensional problems. At present, there are many interesting problems in strongly correlated systems that remain unsolved with current methods. At the heart of this problem is finding an efficient representation that incorporates symmetries, correlations and general features. \n \nIn the context of computer science, machine learning techniques have had astonishing success at reducing the dimensionality of data. The leading method is through the use of artificial neural networks. These networks have been enormously successful at sifting through vast amounts of data to find patterns and regularities. In a sense, neural networks are themselves a statistical system whose properties are adjusted to mimic the features of the data. By finding an effective low-dimensional representation of the data, machine learning has greatly subdued the curse of dimensionality found in many real-world problems. \n \nIn this Thesis, we apply several machine learning techniques to the study of interacting many-body systems in classical and quantum statistical physics. We explore supervised classification of phases of matter with an emphasis on physical interpretation of the net- work. In doing so, we design a custom network architecture that possesses rotational symmetry as an inductive bias. We further investigate connections between the renormalization group and deep learning through applying a super-resolving neural network to the classical Ising model. Towards experimental efforts, we also repurpose generative machine learning to quantum state tomography for the calibration and testing of quantum devices. We conclude with a latent variable model inspired by near-term quantum algorithms. This maps to a variational Monte Carlo ansatz that produces samples efficiently for interacting quantum systems.
Nonequilibrium statistical mechanics exhibit a variety of complex phenomena far from equilibrium. It inherits challenges of equilibrium, including accurately describing the joint distribution of a large number of configurations, and also poses new challenges as the distribution evolves over time. Characterizing dynamical phase transitions as an emergent behavior further requires tracking nonequilibrium systems under a control parameter. While a number of methods have been proposed, such as tensor networks for one-dimensional lattices, we lack a method for arbitrary time beyond the steady state and for higher dimensions. Here, we develop a general computational framework to study the time evolution of nonequilibrium systems in statistical mechanics by leveraging variational autoregressive networks, which offer an efficient computation on the dynamical partition function, a central quantity for discovering the phase transition. We apply the approach to prototype models of nonequilibrium statistical mechanics, including the kinetically constrained models of structural glasses up to three dimensions. The approach uncovers the active-inactive phase transition of spin flips, the dynamical phase diagram, as well as new scaling relations. The result highlights the potential of machine learning dynamical phase transitions in nonequilibrium systems.
Nonequilibrium statistical mechanics exhibit a variety of complex phenomena far from equilibrium. It inherits challenges of equilibrium, including accurately describing the joint distribution of a large number of configurations, and also poses new challenges as the distribution evolves over time. Characterizing dynamical phase transitions as an emergent behavior further requires tracking nonequilibrium systems under a control parameter. While a number of methods have been proposed, such as tensor networks for one-dimensional lattices, we lack a method for arbitrary time beyond the steady state and for higher dimensions. Here, we develop a general computational framework to study the time evolution of nonequilibrium systems in statistical mechanics by leveraging variational autoregressive networks, which offer an efficient computation on the dynamical partition function, a central quantity for discovering the phase transition. We apply the approach to prototype models of nonequilibrium statistical mechanics, including the kinetically constrained models of structural glasses up to three dimensions. The approach uncovers the active-inactive phase transition of spin flips, the dynamical phase diagram, as well as new scaling relations. The result highlights the potential of machine learning dynamical phase transitions in nonequilibrium systems.