Related papers: Generalizable Equivariant Diffusion Models for Non…
We describe a unitary matrix model which is constructed from discrete analogs of the usual projective modules over the noncommutative torus and use it to construct a lattice version of noncommutative gauge theory. The model is a…
Bayesian inference over positive semidefinite (PSD) matrix-valued parameters arises in structured covariance estimation, graph-Laplacian precision models, and multi-output graph learning, but Euclidean proposals often mix poorly near the…
Non-Abelian Lattice Gauge Theory in Euclidean space-time of dimension d>=2 whose gauge group is any compact Lie group is related to a Spin Foam Model by an exact strong-weak duality transformation. The group degrees of freedom are…
The lagrangian of the Kaluza-Klein theory, in its simplest five-dimensional version, should include not only the scalar curvature R, but also the quadratic Gauss-Bonnet invariant. The general lagrangian is computed and the resulting…
We describe a new MCMC method optimized for the sampling of probability measures on Hilbert space which have a density with respect to a Gaussian; such measures arise in the Bayesian approach to inverse problems, and in conditioned…
We derive generalized Langevin equations (GLEs) for single beads in linear elastic networks. In particular, the derivations of the GLEs are conducted without employing normal modes, resulting in two distinct representations in terms of…
Bayesian Last Layer (BLL) models focus solely on uncertainty in the output layer of neural networks, demonstrating comparable performance to more complex Bayesian models. However, the use of Gaussian priors for last layer weights in…
An algorithm is described to convert Lorentz and gauge invariant expressions in non--Abelian gauge theories with matter into a standard form, consisting of a linear combination of basis invariants. This algorithm is needed for computer…
Graph diffusion models, dominant in graph generative modeling, remain underexplored for graph-to-graph translation tasks like chemical reaction prediction. We demonstrate that standard permutation equivariant denoisers face fundamental…
Quantum computers are ideally set up to solve linear systems which are of a form similar to the Schrodinger/Dirac equation of quantum mechanics. In the framework of linear response theory, the propagation and scattering of electromagnetic…
Riemannian diffusion models draw inspiration from standard Euclidean space diffusion models to learn distributions on general manifolds. Unfortunately, the additional geometric complexity renders the diffusion transition term inexpressible…
Recent research works on distributed adaptive networks have intensively studied the case where the nodes estimate a common parameter vector collaboratively. However, there are many applications that are multitask-oriented in the sense that…
We propose a novel tensor network method to achieve accurate and efficient simulations of Abelian lattice gauge theories (LGTs) in (2+1)D for both ground state and real-time dynamics. The first key is to identify a gauge canonical form…
A multitude of imaging and vision tasks have seen recently a major transformation by deep learning methods and in particular by the application of convolutional neural networks. These methods achieve impressive results, even for…
Part I of this work [2] developed the exact diffusion algorithm to remove the bias that is characteristic of distributed solutions for deterministic optimization problems. The algorithm was shown to be applicable to a larger set of…
A qubit lattice algorithm (QLA) is developed for Maxwell equations in a two-dimensional Cartesian geometry. In particular, the initial value problem of electromagnetic pulse scattering off a localized 2D dielectric object is considered. A…
In this paper, we provide new insights on the Unadjusted Langevin Algorithm. We show that this method can be formulated as a first order optimization algorithm of an objective functional defined on the Wasserstein space of order $2$. Using…
Riemannian manifold Hamiltonian (RMHMC) and Lagrangian Monte Carlo (LMC) have emerged as powerful methods of Bayesian inference. Unlike Euclidean Hamiltonian Monte Carlo (EHMC) and the Metropolis-adjusted Langevin algorithm (MALA), the…
The Augmented Lagrangian Alternating Direction Inexact Newton (ALADIN) method is a cutting-edge distributed optimization algorithm known for its superior numerical performance. It relies on each agent transmitting information to a central…
We discuss general aspects of charge conjugation symmetry in Euclidean lattice field theories, including its dynamical gauging. Our main focus is $O(2) = U(1)\rtimes \mathbb{Z}_2 $ gauge theory, which we construct using a non-abelian…