arXiv Machine Learning

Implementation of reinforcement learning in chemical reaction networks: application to phototaxis as curiosity-driven exploration

arXiv:2606. 26168v1 Announce Type: new Abstract: Living systems navigate environments using noisy and incomplete sensory signals.

arXiv Machine Learning
Sep 11

Bio-inspired Learning and Decision-Making with Probabilistic In-Memory Computing Hardware: Part 1

The article explores how biological learning and decision-making, often modeled as Bayesian processes, can be replicated in computing systems by leveraging noisy neural and synaptic dynamics for stochastic sampling. It proposes a biologically grounded framework where internal energy functions capture uncertainty over latent states and model parameters, enabling predictive coding networks to perform Markov chain Monte Carlo sampling. By drawing parallels between intrinsic biological noise and electrical noise in emerging probabilistic analogue memory technologies, the authors argue that analogue in‑memory computing hardware offers a massively scalable and energy‑efficient solution for probabilistic inference.

By Thomas Dalgaty, Eiji Kawasaki, Miguel de Prado, Devendra Vyas, Tommaso Salvatori
arXiv Machine Learning
Sep 23

Simulation-free Structure Learning for Stochastic Population Dynamics

arXiv:2510.16656v2 Announce Type: replace Abstract: Modeling dynamical systems and unraveling their underlying structural dependencies is central to many domains in the natural sciences. Various phys...

By Noah El Rimawi-Fine, Adam Stecklov, Lucas Nelson, Mathieu Blanchette, Alexander Tong, Stephen Y. Zhang, Lazar Atanackovic
arXiv Machine Learning
Jun 10

Rare Event Analysis via Stochastic Optimal Control

arXiv:2604. 13213v2 Announce Type: replace-cross Abstract: Rare events such as conformational changes in biomolecules, phase transitions, and chemical reactions are central to the behavior of many physical systems, yet they are extremely difficult to study computationally because unbiased simulations seldom produce them.

By Yuanqi Du, Jiajun He, Dinghuai Zhang, Eric Vanden-Eijnden, Carles Domingo-Enrich
arXiv Machine Learning
Sep 18

Correlation-Free Transition Path Sampling through Shooting Point Generation Guided by Committor Learning

The paper introduces GenAIMMD, an iterative algorithm that learns the committor function and trains a conditioned Boltzmann Generator to generate uncorrelated transition paths without prior knowledge of the reaction coordinate. This method combines transition path sampling with committor learning, enabling fully parallelizable sampling. Benchmarks on a toy model and a polymer system show a substantial performance improvement over standard TPS.

By Maximilian Negedly, Sebastian Falkner, Alessandro Coretti, Christoph Dellago
arXiv AI
3d ago

Diffusion-Augmented Markov Decision Processes for Maximum Entropy Reinforcement Learning

The paper introduces Diffusion-Augmented Markov Decision Processes (DA‑MDPs), a framework that extends Maximum Entropy Reinforcement Learning to diffusion-based policies. DA‑MDPs treat each reverse‑diffusion step as an RL decision, deriving a tractable reverse‑KL bound that decomposes across denoising transitions and yields diffusion‑augmented soft rewards, value functions, and policy objectives. The authors implement this framework with PPO, REPPO, and a maximum‑entropy WPO variant, showing improved continuous‑control performance, higher success rates on manipulation tasks, and memory‑efficient training with action chunking.

By Sebastian Sanokowski, Kaustubh Patil, Majid Khadiv