Search Results for author: Bálint Máté

Found 7 papers, 2 papers with code

Multi-Lattice Sampling of Quantum Field Theories via Neural Operator-based Flows

no code implementations1 Jan 2024 Bálint Máté, François Fleuret

In particular, we propose to approximate a time-dependent operator $\mathcal V_t$ whose time integral provides a mapping between the functional distributions of the free theory $[\mathcal D\phi(x)] \mathcal Z_0^{-1} e^{-\mathcal S_{0}[\phi(x)]}$ and of the target theory $[\mathcal D\phi(x)]\mathcal Z^{-1}e^{-\mathcal S[\phi(x)]}$.

Operator learning

Graph Neural Networks Go Forward-Forward

no code implementations10 Feb 2023 Daniele Paliotta, Mathieu Alain, Bálint Máté, François Fleuret

We present the Graph Forward-Forward (GFF) algorithm, an extension of the Forward-Forward procedure to graphs, able to handle features distributed over a graph's nodes.

Graph Property Prediction Property Prediction

Learning Interpolations between Boltzmann Densities

1 code implementation18 Jan 2023 Bálint Máté, François Fleuret

We introduce a training objective for continuous normalizing flows that can be used in the absence of samples but in the presence of an energy function.

Deformations of Boltzmann Distributions

no code implementations25 Oct 2022 Bálint Máté, François Fleuret

Consider a one-parameter family of Boltzmann distributions $p_t(x) = \tfrac{1}{Z_t}e^{-S_t(x)}$.

Flowification: Everything is a Normalizing Flow

1 code implementation30 May 2022 Bálint Máté, Samuel Klein, Tobias Golling, François Fleuret

On the other hand, neural networks only perform a forward pass on the input, there is neither a notion of an inverse of a neural network nor is there one of its likelihood contribution.

Density Estimation

Beyond Ansätze: Learning Quantum Circuits as Unitary Operators

no code implementations1 Mar 2022 Bálint Máté, Bertrand Le Saux, Maxwell Henderson

This paper explores the advantages of optimizing quantum circuits on $N$ wires as operators in the unitary group $U(2^N)$.

Speeding up PCA with priming

no code implementations8 Sep 2021 Bálint Máté, François Fleuret

This algorithm first runs any approximate-PCA method to get an initial estimate of the principal components (priming), and then applies an exact PCA in the subspace they span.

Cannot find the paper you are looking for? You can Submit a new open access paper.