3 papers
cs.LG2026
Pass@K Policy Optimization: Solving Harder Reinforcement Learning Problems
Christian Walder, Deep Karkhanis
Reinforcement Learning (RL) algorithms sample multiple n>1 solution attempts for each problem and reward them independently. This optimizes for pass@1 performance and prioritizes t…
math.NA2026
Sampling via Stochastic Interpolants by Langevin-based Velocity and Initialization Estimation in Flow ODEs
Chenguang Duan, Yuling Jiao, Gabriele Steidl +3
We propose a novel method for sampling from unnormalized Boltzmann densities based on a probability flow ordinary differential equation (ODE) derived from linear stochastic interpo…
cs.CL2026
Free Lunch for Pass@? Low Cost Diverse Sampling for Diffusion Language Models
Sean Lamont, Christian Walder, Paul Montague +2
Diverse outputs in text generation are necessary for effective exploration in complex reasoning tasks, such as code generation and mathematical problem solving. Such Pass@ probl…