Tagged articles
Importance Sampling
11 articles · Page 1 of 1
The paper introduces Autoregressive Boltzmann Generators (ArBG) that replace flow‑based models with autoregressive modeling, enabling exact likelihood computation, efficient importance‑sampling correction, and scalable transfer learning, and demonstrates superior performance on peptide benchmarks compared with prior Boltzmann generators.
Autoregressive ModelBoltzmann GeneratorImportance Sampling
0 likes · 15 min read

The paper by researchers from Beihang, Peking University and Meituan proposes PIRL, a new RL‑post‑training perspective that treats policy improvement as the optimization objective, and PIPO, a plug‑and‑play framework that adds a verification loop to amplify beneficial updates and suppress harmful ones, demonstrating consistent gains across math reasoning, code and tool‑use tasks.
Importance SamplingPIPOPIRL
0 likes · 9 min read

This article walks through the fundamental derivation of policy‑based reinforcement learning, explains how traditional RL concepts extend to large‑language‑model RL, and details engineering enhancements such as GRPO memory reduction, asynchronous rollout, importance‑sampling corrections, and token‑flow management for stable industrial‑scale training.
GRPOImportance SamplingRLHF
0 likes · 11 min read

The article walks through the fundamentals of traditional policy‑gradient reinforcement learning, derives the Reinforce objective, maps its concepts to large‑language‑model RL, and then discusses practical engineering solutions such as GRPO, async rollout, importance‑sampling corrections, and token‑flow management for industrial‑scale training.
Async RolloutGRPOImportance Sampling
0 likes · 10 min read

This article analyzes why optimizing sequence‑level rewards for LLMs with token‑level surrogate objectives can improve reinforcement‑learning stability, explains the theoretical conditions required, introduces Routing Replay for MoE models, and presents extensive experiments validating the approach.
Importance SamplingMixture of ExpertsReinforcement Learning
0 likes · 12 min read

This article provides a comprehensive technical analysis of PPO‑based reinforcement learning methods for large language models, detailing the evolution from the original PPO algorithm through GRPO, DAPO, and GSPO, and explaining their motivations, mathematical formulations, advantages, and practical challenges such as entropy collapse and importance‑sampling variance.
DAPOGRPOGSPO
0 likes · 30 min read

This tutorial explains how Monte Carlo methods are enhanced in reinforcement learning through epsilon‑greedy and epsilon‑soft policies, Monte Carlo control, a Blackjack Q‑function example, the distinction between on‑policy and off‑policy learning, importance sampling, and efficient incremental update techniques.
Epsilon-GreedyImportance SamplingMonte Carlo
0 likes · 14 min read

This article walks through implementing probability‑density‑function (PDF) based importance sampling in a Rust ray‑tracing renderer, covering trait definitions, concrete PDF types for spheres, cosine distributions, hittable objects, quad geometry, material adjustments, and integration into the rendering loop to achieve faster convergence and higher image quality.
GraphicsImportance SamplingPDF
0 likes · 15 min read

Continuing pretraining (CP) bridges pretraining and SFT to inject domain knowledge, but faces catastrophic forgetting; this article explores leveraging importance sampling to balance common and domain data, discusses data selection, annealing strategies, and practical tips for mitigating forgetting while enhancing specialized capabilities.
Catastrophic ForgettingContinue PretrainingImportance Sampling
0 likes · 8 min read

The paper introduces DEFUSE and its multi‑task extension Bi‑DEFUSE, unbiased delayed‑feedback CVR models that correct label bias via rigorous importance‑sampling and a latent fake‑negative variable, achieving superior offline performance and a 2 % CVR lift in online deployment compared with existing industry baselines.
Bi-DEFUSECVRDEFUSE
0 likes · 25 min read

This article explains the core ideas and step-by-step procedures of widely used sampling methods—including inverse transform, rejection, importance, and Markov Chain Monte Carlo techniques such as Metropolis‑Hastings and Gibbs—highlighting their mathematical foundations, practical implementations, and when each method is appropriate.
Importance SamplingMCMCMonte Carlo
0 likes · 11 min read
