Research
Distribution Matching Evolutionary Algorithms for Rare Event Sampling
arXiv:2610.03833v1 Announce Type: cross Abstract: A novel discovery is one which is both useful and surprising: a generative model's output is a useful discovery if it has a low probability of being g
arXiv:2610.03833v1 Announce Type: cross Abstract: A novel discovery is one which is both useful and surprising: a generative model's output is a useful discovery if it has a low probability of being generated (it's surprising) and a high reward (it's useful). Global optimization can directly increase the probability of sampling high rewards but typically requires updating model weights. Such gradient based optimization is expensive and bars using capable closed-source models. Instead, modern search methods for discovery sacrifice the global target, and use evolutionary algorithms with local reward maximizing objectives, permitting the search to focus only on high probability samples. In this paper, we interpret various evolutionary algorithms as approximate Markov Chain Monte Carlo, an optimization-free method to sample from complex distributions. This interpretation allows developing Distribution Matching Evolutionary Algorithms (DME), a class of search methods which sample from a global target distribution without updating weights. Empirically, DME has a higher sample efficiency than existing methods on problems requiring many samples to find a solution.
Related
- Accelerated Markov Chain Monte Carlo Algorithms on Discrete States
- GFlowRL: Scaling Distribution-Matching RL to Large Language Models
- Reactive Flux Matching: Mechanism Discovery and Adaptive Sampling of Rare Events
- Towards accurate extreme event likelihoods from diffusion model climate emulators
Source: arXiv cs.LG | 2026-10-06