The precise equivalence between discretized Euclidean field theories and a certain class of probabilistic graphical models, namely the mathematical framework of Markov random fields, opens up the opportunity to investigate machine learning from the perspective of quantum field theory. In this contribution we will demonstrate, through the Hammersley-Clifford theorem, that the ϕ4 scalar field theory on a square lattice satisfies the local Markov property and can therefore be recast as a Markov random field. We will then derive from the ϕ4 theory machine learning algorithms and neural networks which can be viewed as generalizations of conventional neural network architectures. Finally, we will conclude by presenting applications based on the m...
14 pages, 36 figuresInternational audienceWe investigate the advantages of machine learning techniqu...
The core computational tasks in quantum systems are the computation of expectations of operators, in...
Supervised learning algorithms take as input a set of labeled examples and return as output a predic...
The transition to Euclidean space and the discretization of quantum field theories on spatial or spa...
We derive machine learning algorithms from discretized Euclidean field theories, making inference an...
Within the past decade, machine learning algorithms have been proposed as a po-tential solution to a...
Abstract We demonstrate how one can use machine learning techniques to bypass the technical difficul...
Zhou K, Endrödi G, Pang L-G, Stöcker H. Regressive and generative neural networks for scalar field t...
Discretizing fields on a spacetime lattice is the only known general and non-perturbative regulator ...
Network parameters of continuous normalizing flows trained for the \(\varphi^4\) theory. Correspond...
The human brain is a complex system composed of a network of hundreds of billions of dis-crete neuro...
Machine learning algorithms based on parametrized quantum circuits are prime candidates for near-ter...
Progress in answering some of the most interesting open questions about the nature of reality is cur...
Quantum computing represents a promising paradigm for solving complex problems, such as large-number...
This thesis illustrates the use of machine learning algorithms and exact numerical methods to study ...
14 pages, 36 figuresInternational audienceWe investigate the advantages of machine learning techniqu...
The core computational tasks in quantum systems are the computation of expectations of operators, in...
Supervised learning algorithms take as input a set of labeled examples and return as output a predic...
The transition to Euclidean space and the discretization of quantum field theories on spatial or spa...
We derive machine learning algorithms from discretized Euclidean field theories, making inference an...
Within the past decade, machine learning algorithms have been proposed as a po-tential solution to a...
Abstract We demonstrate how one can use machine learning techniques to bypass the technical difficul...
Zhou K, Endrödi G, Pang L-G, Stöcker H. Regressive and generative neural networks for scalar field t...
Discretizing fields on a spacetime lattice is the only known general and non-perturbative regulator ...
Network parameters of continuous normalizing flows trained for the \(\varphi^4\) theory. Correspond...
The human brain is a complex system composed of a network of hundreds of billions of dis-crete neuro...
Machine learning algorithms based on parametrized quantum circuits are prime candidates for near-ter...
Progress in answering some of the most interesting open questions about the nature of reality is cur...
Quantum computing represents a promising paradigm for solving complex problems, such as large-number...
This thesis illustrates the use of machine learning algorithms and exact numerical methods to study ...
14 pages, 36 figuresInternational audienceWe investigate the advantages of machine learning techniqu...
The core computational tasks in quantum systems are the computation of expectations of operators, in...
Supervised learning algorithms take as input a set of labeled examples and return as output a predic...