arXiv Machine Learning
Adaptive teachers for amortized samplers
Read the original on arXiv Machine Learning →The Flow has not summarised this story yet — read it at arXiv Machine Learning.
Related stories
arXiv Machine Learning
Aug 3
Reinforced sequential Monte Carlo for amortised sampling
arXiv:2510. 11711v3 Announce Type: replace Abstract: This paper proposes a synergy of amortised and particle-based methods for sampling from distributions defined by unnormalised density functions.
arXiv Machine Learning
Aug 31
Improved off-policy training of diffusion samplers
The paper investigates training diffusion models to sample from distributions defined by unnormalized densities or energy functions. It benchmarks various diffusion-structured inference techniques, including simulation-based variational methods and off-policy approaches such as continuous generative flow networks, highlighting their relative strengths and challenging some prior claims. Additionally, the authors introduce a new exploration strategy for off-policy methods that employs local search in the target space with a replay buffer, demonstrating improved sample quality across multiple target distributions.
arXiv AI
Sep 3
Action abstractions for amortized sampling
The paper introduces a method that integrates action abstraction into policy optimization for reinforcement learning and generative flow networks. By iteratively identifying frequently used action subsequences in high‑reward trajectories and treating them as single high‑level actions, the approach expands the action space and improves sample efficiency. Experiments on synthetic and real‑world tasks show that this technique discovers diverse high‑reward states more effectively, especially on challenging exploration problems, and yields interpretable abstract actions that reflect the underlying reward structure.
arXiv Machine Learning
Aug 11
Path-dependent Discrete Amortized Inference
arXiv:2608. 08644v1 Announce Type: new Abstract: We consider the problem of sampling compositional and discrete objects from a given unnormalized posterior distribution.
arXiv AI
Oct 2
Finetuning with Sampling: SFT Learns Better Than You Think
The paper introduces a Markov chain Monte Carlo (MCMC) sampling algorithm that transforms off‑policy traces into more on‑policy data for supervised finetuning (SFT). By tailoring the data distribution rather than changing the learning objective, the method allows SFT to match or surpass traditional post‑training techniques such as reinforcement learning across tasks like scientific skill acquisition, mathematical reasoning, and open‑ended expertise. The resulting models generalize better, forget less, and exhibit strong distributional performance, demonstrating that sampling can serve as a model‑native operator for broader post‑training applications.
Hugging Face Trending Papers
Aug 9
Path-dependent Discrete Amortized Inference
We consider the problem of sampling compositional and discrete objects from a given unnormalized posterior distribution. Notably, recent studies have shown that this problem can be efficiently solved by learning a deterministic Markov Decision Process (MDP) that progressively builds each object in proportion to the posterior.