Energy Matching unifies flow matching and energy-based models for generative modeling.
problem Inability of flow-based models to integrate partial observations and priors.
method Energy Matching framework that integrates flow matching and energy-based models.
result Substantially outperforms existing EBMs on CIFAR-10 and ImageNet generation.
iDEM generates samples from Boltzmann densities without data.
problem Generating statistically independent samples from unnormalized distributions.
method Iterative algorithm using energy and gradient for diffusion-based sampler training.
result iDEM achieves state-of-the-art performance and trains faster than existing methods.
New method improves sampling from noisy energy models.
problem Training and sampling challenges in Energy-Based Models.
method Pseudo-Gibbs sampling with moment matching.
result Effective sampling from clean model using noisy DSM-trained model.
Graph Energy Matching improves generation quality for molecular graphs.
problem Discrete energy-based models struggle with efficient and high-quality sampling for graph generation.
method Inspired by transport-map optimization, Graph Energy Matching learns a permutation-invariant potential energy to guide sampling.
result GEM matches or surpasses discrete diffusion baselines on molecular graph benchmarks.
A new loss function ED simplifies training energy-based models without scores.
problem Training energy-based models is computationally expensive.
method Energy Discrepancy (ED) loss function that does not rely on scores or MCMC.
result ED effectively interpolates between score matching and negative log-likelihood.
BNEM improves Boltzmann sampler efficiency.
problem Generating IID samples from Boltzmann distributions efficiently.
method Bootstrapped Noised Energy Matching (NEM) combined with diffusion-based learning and bootstrapping.
result BNEM achieves state-of-the-art performance with improved robustness.
EWFM trains continuous flows with only energy evaluations, improving sample quality with fewer computations.
problem Efficiently sampling from complex, high-dimensional Boltzmann distributions using only energy evaluations.
method Energy-Weighted Flow Matching (EWFM) using importance sampling and iterative/annealed training.
result Improved sample quality with up to 3 orders of magnitude fewer energy evaluations compared to existing methods.
iEFM trains CNF models from unnormalized densities efficiently.
problem Training generators from energy functions or unnormalized densities.
method Iterated energy-based flow matching (iEFM) with simulation-free objective.
result iEFM outperforms existing methods in probabilistic modeling.
New method trains energy-based models faster and more stably.
problem Training efficiency and stability of energy-based models.
method EBFlow with score-matching objectives.
result EBFlow achieves significant speedup and better performance.
EBIL simplifies IL by estimating expert energy as reward, achieving effective performance.
problem Recovering optimal policy from expert demonstrations without reward signals.
method EBIL uses a two-stage solution: first estimating expert energy as reward, then learning policy.
result EBIL achieves effective performance and interpretable reward signals.
Generative model for condensed matter using Riemannian flow matching.
problem Sampling equilibrium distributions in condensed-phase systems.
method Riemannian flow matching to incorporate periodicity, using Hutchinson's trace estimator and cumulant expansion for bias correction.
result Highly accurate free energy estimates on monatomic ice without multistage estimators.
Extends Penrose's method to null shells with pressure and energy flux.
problem Constructing null thin shells with arbitrary gravitational/matter content.
method Derive locally Lipschitz metric and coordinate transformation.
result Example of null shell with non-trivial energy density, flux, and pressure in Minkowski space.
In this paper, we attack the anomaly detection problem by directly modeling the data distribution with deep architectures. We propose deep structured energy based models (DSEBMs), where the energy function is the output of a deterministic deep neural network with structure. We develop novel model architectures to integ…
Proves weight polytope matches with energy vectors in toric varieties.
problem Understanding the relationship between weight polytopes and energy functionals in toric varieties.
method Combines two slope formulas of K-energy in the toric setting.
result Weight polytope of Hurwitz form matches with convex hull of characteristic vectors.
Density estimation is a fundamental problem in statistical learning. This problem is especially challenging for complex high-dimensional data due to the curse of dimensionality. A promising solution to this problem is given here in an inference-free hierarchical framework that is built on score matching. We revisit the…
A new training method for efficient Boltzmann generators.
problem Training equivariant continuous normalizing flows (CNFs) is computationally expensive.
method Equivariant flow matching, based on optimal transport flow matching.
result Equivariant flow matching yields more efficient flows with shorter integration paths.
Holographic principle matches deformed Liouville theory action.
problem Matching deformed Liouville theory action in holography.
method Developed a holographic scheme involving bending energy.
result Perfect match between deformed theory actions on field and gravity sides.
Dual training method for EBMs with overparametrized neural networks.
problem Training EBMs with non-convex energies is challenging.
method Derive variational principles and dual GDA algorithm for feature-learning regime.
result Dual GDA algorithm performs best with similar time scales for features and particles.
Paper proposes an alternative to MCMC for sampling in energy-based models.
problem Difficulty in generating samples from the current energy function in contrastive approaches.
method Viewing the evolution of the modeling distribution as the evolution of the energy function and samples from this distribution along a time-dependent vector field.
result The proposed method efficiently matches the current distribution in a finite time, unlike MCMC.
FAST selects coresets more efficiently by matching distributions in the frequency domain.
problem Efficiently selecting representative subsets of large datasets for deep learning.
method FAST uses spectral graph theory and CFD to match distributions, addressing limitations of existing methods.
result FAST significantly outperforms state-of-the-art coreset selection methods in accuracy and energy efficiency.
ASBS improves sampling from Boltzmann distributions without importance weighting.
problem Sampling from Boltzmann distributions with known energies but unknown samples.
method Adjoint Schrödinger Bridge Sampler using kinetic-optimal transportation.
result ASBS achieves scalable and efficient sampling without importance weighting.
Unified framework for continuous-state discrete flow matching models.
problem Discrete generative modeling with continuous probabilities.
method Introducing α-Flow, a family of CS-DFM models based on information geometry. result Optimal flow matching loss for α-flow minimizes generalized kinetic energy. ScoreGrad predicts multivariate time series with energy-based models, achieving state-of-the-art results.
problem Predicting multivariate time series with generative models while considering noise and distribution.
method ScoreGrad uses continuous energy-based generative models with a feature extraction and score matching module.
result ScoreGrad achieves state-of-the-art results on six real-world datasets.
MFM improves generative model interpolations by learning approximate geodesics on data manifolds.
problem Straight interpolations fail to capture dynamics on data manifolds.
method Metric Flow Matching (MFM) learns approximate geodesics by minimizing kinetic energy of a data-induced Riemannian metric.
result MFM outperforms Euclidean baselines, achieving SOTA on single-cell trajectory prediction.
Paper proposes CoopFlow, a two-flow generator for energy-based models.
problem Training energy-based models with Langevin flow and normalizing flow.
method CoopFlow trains an energy-based model using a normalizing flow initialization and a short-run Langevin flow revision.
result CoopFlow converges to a moment matching estimator and synthesizes realistic images.
Standard maximum likelihood estimation cannot be applied to discrete energy-based models in the general case because the computation of exact model probabilities is intractable. Recent research has seen the proposal of several new estimators designed specifically to overcome this intractability, but virtually nothing i…
Dynamic pricing aims to match power supply and demand in an energy transition.
problem Mismatch between renewable energy supply and consumer demand.
method Formalizes decision-making problem, designs forecasting models, and statistical demand response models.
result Dynamic pricing can synchronise power supply and demand effectively.
Smooth flows for physical systems with smooth energies and forces.
problem Smooth energies for physical simulations and force computation.
method Smooth mixture transformations on compact intervals and hypertori, using root-finding and the inverse function theorem.
result Smooth flows allow training by force matching and use as molecular dynamics potentials.
Paper presents variational estimates for EBLVMs without structural assumptions.
problem Challenges in learning and evaluating EBLVMs due to intractable true posteriors and partition functions.
method Variational estimates of the score function and its gradient (VaES and VaGES) in a general EBLVM.
result The estimates can be applied to KSD and SM-based methods to learn EBLVMs and estimate Fisher divergence.
Energy-Based Models (EBMs) assign unnormalized log-probability to data samples. This functionality has a variety of applications, such as sample synthesis, data denoising, sample restoration, outlier detection, Bayesian reasoning, and many more. But training of EBMs using standard maximum likelihood is extremely slow b…
Energy-efficient DL inference for IoT devices reduces power consumption and improves performance.
problem Energy inefficiency in deep learning models for IoT devices.
method Energy-aware early exiting policy to balance energy consumption and inference accuracy.
result Accuracy and service rate improved up to 25% and 35% respectively.
FlowLLM uses LLMs and flow matching to efficiently generate novel materials.
problem Challenging material discovery due to vast chemical space.
method Combines LLMs and Riemannian flow matching to design novel crystalline materials.
result Significantly increases generation rate of stable materials and unique crystals.
Score matching is a popular method for estimating unnormalized statistical models. However, it has been so far limited to simple, shallow models or low-dimensional data, due to the difficulty of computing the Hessian of log-density functions. We show this difficulty can be mitigated by projecting the scores onto random…
Distributed asynchronous SGD has become widely used for deep learning in large-scale systems, but remains notorious for its instability when increasing the number of workers. In this work, we study the dynamics of distributed asynchronous SGD under the lens of Lagrangian mechanics. Using this description, we introduce …
Introduces Causal Energy Minimization to understand Transformer layers.
problem Empirical parameterization of Transformer blocks remains largely unexplored.
method Causal Energy Minimization framework that recasts Transformer layers as optimization steps on conditional energy functions.
result Identifies design space for Transformer layers including weight sharing and energy-based interpretations.
We present a new proximal bundle method for Maximum-A-Posteriori (MAP) inference in structured energy minimization problems. The method optimizes a Lagrangean relaxation of the original energy minimization problem using a multi plane block-coordinate Frank-Wolfe method that takes advantage of the specific structure of …
EBMs are flexible but hard to train; this paper explains methods.
problem Training Energy-Based Models is difficult due to the unknown normalizing constant.
method Explains MCMC, SM, and NCE for training EBMs, highlighting connections.
result Provides a friendly introduction to modern EBM training methods.
Training energy-based probabilistic models is confronted with apparently intractable sums, whose Monte Carlo estimation requires sampling from the estimated probability distribution in the inner loop of training. This can be approximately achieved by Markov chain Monte Carlo methods, but may still face a formidable obs…
In this work an iterative algorithm based on unsupervised learning is presented, specifically on a Restricted Boltzmann Machine (RBM) to solve a perfect matching problem on a bipartite weighted graph. Iteratively is calculated the weights wij and the bias parameters θ=(ai,bj) that maximize the energy funct…
A new method for learning policies from demonstrations without reinforcement.
problem Learning policies from demonstrations without access to reinforcement signals.
method Energy-based distribution matching (EDM) to learn policy parameters and state marginals.
result EDM yields consistent performance gains over existing algorithms for strictly batch imitation learning.
Adapts score matching for missing data in flexible settings.
problem Learning data distribution with missing data.
method Adapted score matching to handle missing data, providing two approaches: importance weighting and variational.
result Variational approach performs best in high-dimensional settings.
Improved exploration in cooperative multi-agent reinforcement learning.
problem Limited expressiveness of Gaussian policies in DecSPG hinders effective exploration.
method Proposes decentralized diffusion policy learning (DDPL) with denoising diffusion probabilistic models.
result Consistently improved performance on various MARL benchmarks.
L-GATr transforms high-energy physics data using geometric algebra and Lorentz symmetry.
problem Extracting scientific understanding from particle-physics experiments with high precision and efficiency.
method L-GATr, a geometric algebra Transformer, representing data in 4D space-time and being equivariant under Lorentz transformations.
result L-GATr achieves performance comparable to or better than domain-specific baselines on regression, classification, and generative tasks.
Unified perspective on Hopfield networks with attention module.
problem Understanding and optimizing Hopfield networks with attention mechanisms.
method Study of BM counterparts of modern Hopfield networks and their salient properties.
result Introduction of AttnBM with tractable likelihood and gradient.
Energy is a limited resource which has to be managed wisely, taking into account both supply-demand matching and capacity constraints in the distribution grid. One aspect of the smart energy management at the building level is given by the problem of real-time detection of flexible demand available. In this paper we pr…
Atomistic or ab-initio molecular dynamics simulations are widely used to predict thermodynamics and kinetics and relate them to molecular structure. A common approach to go beyond the time- and length-scales accessible with such computationally expensive simulations is the definition of coarse-grained molecular models.…
Improved sampling efficiency for molecular systems using path gradients after Flow Matching.
problem Improving sampling efficiency for complex molecular systems.
method Hybrid approach combining Flow Matching and path gradients.
result Up to a threefold increase in sampling efficiency for molecular systems.
The elastic energy functional of a thin elastic rod or sheet is generalized to the case of an M-dimensional manifold in N-dimensional space. We derive potentials for the stress field and curvatures and find the generalized von Karman equations for a manifold in elastic equilibrium. We perform a scaling analysis of an M…