Skip to content
#diffusion models Open access

Mean-field path-integral diffusion from samples to interacting agents

Sep 2026 · Communications Physics · Vol 9 · 0 citations · 35 references

TL;DR

It is shown that temporal trajectories can act like a coordinated population, reducing control energy by 19–24% in demand response while still reaching the desired final distribution.

Abstract

Moving probability distributions in the context of stochastic processes efficiently is central to modern generative modeling, uncertainty quantification, and control of large engineered systems. Most current methods generate temporal trajectories independently, leaving open whether the trajectories can cooperate through shared population information to reduce transport cost. Here we show that mean-field path-integral diffusion turns this question into a self-consistent stochastic control problem in which each trajectory responds to the evolving population. In a broad linear-quadratic setting, the problem reduces to a finite system of ordinary differential equations. For quadratic interactions with no background drift, we prove that the optimal population guidance is exactly the straight-line interpolation between the initial and target means, for arbitrary endpoint distributions with finite means. This yields an explicit construction for mixture targets. In demand-response control of multi-zone buildings, the method reduces control energy by 19–24% while maintaining the desired final distribution. These results suggest a practical route to coordinated generative transport for energy and other large-agent systems. Efficiently moving probability distributions in the context of stochastic processes is important in artificial intelligence, physics, and smart-building control. Here, the authors show that temporal trajectories can act like a coordinated population, reducing control energy by 19–24% in demand response while still reaching the desired final distribution.

Read PDF

Similar papers

#machine learning Preprint Oct 2026

Randomized Transport Maps for Model-Free Policy-Gradient Mean-Field Control

We develop a model-free policy gradient method for discrete-time mean-field control (MFC). In MFC, the policy affects the objective both through the controlled dynamics and through the population distribution. Standard REINFORCE estimators capture the first effect but not the second. We introduce Transport REINFORCE, a...

Adonis Jamal, Samy Mekkaoui, Yadh Hafsi et al. · 0 citations
Preprint Oct 2026

Control-Ready Uncertainty for Trajectory Diffusion

Diffusion models can represent complex, multimodal trajectory distributions, but extracting uncertainty from them typically requires costly Monte Carlo sampling. This limits their use in real-time control, where robots must rapidly assess risk and maintain safety margins. We introduce Score-Curvature for Online Precisi...

Zhi-Wei Xue, Jia-Yue Kam, Jin-Hang Qiu et al. · 0 citations
#machine learning Open access Sep 2026

Generative diffusion surrogates with analytical variance schedule

The forward noising rate is prescribed as the time derivative of this variance, turning generative time into a calibrated transport clock, enabling calibrated emulation and likelihood-based inference.

P. Reichherzer, G. Gregori, David N. Hosking et al. · 0 citations
#artificial intelligence Preprint Oct 2026

Equal Path Cost, Unequal Output Effects: Understanding Perturbation Propagation in Diffusion Models

Diffusion models have achieved remarkable success in generative modeling, with their sampling procedures routinely modified to control generation and improve efficiency. These modifications introduce perturbations along the sampling trajectory, raising a central question: how do such perturbations affect generated outp...

Wei Guo, Yao-Wen Zhang, Xingtong Ge et al. · 0 citations
Case report Open access Aug 2026

Distributed Model-Based Diffusion: Finite Horizon Contraction under Bounded Delay

This paper analyzes Distributed Model-Based Diffusion: a sampling-based Model-Predictive Control method suitable for highly nonlinear, nonconvex, nonsmooth, multi-agent systems and proves contraction and robustness to latency for multi-agent, nonconvex problems, showing applicability to real-world constraints.

Seth Golembeski, Keith L. Gibson, Alexander Gross et al. · 0 citations
#artificial intelligence Preprint Sep 2026

An Evolutionary Computation Framework for Multi-Agent Q-Learning with Mean-Field Environmental Feedback

A coupled learning--environment model in which agents update stateless $Q-values on a fixed graph, while their population-average behavior drives an environmental variable that dynamically modifies the payoff matrix is formulated.

Li-Chen Wang, Shi-Jia Hua, Lin-Jie Liu · 0 citations

Related blog posts

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.