arXiv Machine Learning

Least-Action-Guided Diffusion for Physical Extrapolation

arXiv:2606. 11277v1 Announce Type: new Abstract: Reliable extrapolation remains a central challenge for generative models in computational physics, because models trained over finite ranges of time, parameters, or geometries may produce physically inconsistent predictions outside the training distribution.

arXiv AI
Jul 24

PILD: Physics-Informed Learning via Diffusion

arXiv:2601. 21284v2 Announce Type: replace-cross Abstract: Diffusion models have emerged as powerful generative tools for modeling complex data distributions, yet their purely data-driven nature limits applicability in engineering and scientific problems where physical laws must be respected.

By Tianyi Zeng, Tianyi Wang, Jiaru Zhang, Zimo Zeng, Feiyang Zhang, Yiming Xu, Sikai Chen, Junfeng Jiao, Christian Claudel, Xinbo Chen
arXiv Machine Learning
Aug 28

STITCH-OPE: Trajectory Stitching with Guided Diffusion for Off-Policy Evaluation

STITCH-OPE is a model‑based generative framework that uses denoising diffusion to perform off‑policy evaluation (OPE) in high‑dimensional, long‑horizon settings. It generates synthetic trajectories for a target policy by guiding a diffusion model trained on behavior data, subtracting the behavior policy’s score to avoid over‑regularization and stitching partial trajectories to extend horizon length. The authors provide theoretical variance‑reduction guarantees and demonstrate improved mean squared error, correlation, and regret on D4RL and OpenAI Gym benchmarks.

By Hossein Goli, Michael Gimelfarb, Nathan Samuel de Lara, Haruki Nishimura, Masha Itkina, Florian Shkurti
arXiv Machine Learning
1d ago

Learned End-to-End Guidance Schedules for Diffusion Models

The paper introduces Learned End-to-End Guidance Schedules (LEEGS) for diffusion models, which train a time‑dependent guidance schedule to balance data quality and requirement satisfaction while reducing sampling steps. LEEGS minimizes the guidance function over a small set of examples using stochastic gradient descent and employs a gradient approximation to cut training time by a factor of four. Experiments on tasks such as image inpainting, noisy image inverse problems, face‑ID‑guided generation, and PDE problems show that LEEGS outperforms baselines at the same computational budget or matches constant guidance with only 10% of the steps.

By Aneesh Barthakur, Mathias Niepert, Luiz F. O. Chamon