Mechanism

Formulates policy improvement as weighted supervised learning where off-policy or replay-buffer trajectories (x,y)(x,y) are weighted exponentially by their estimated advantage: LAWR(θ)=−E(x,y)∼B[exp⁡(R(x,y)−V(x)τ)log⁡πθ(y∣x)]\mathcal{L}_{\text{AWR}}(\theta) = -\mathbb{E}_{(x,y)\sim\mathcal{B}}\left[\exp\left(\frac{R(x,y) - V(x)}{\tau}\right) \log \pi_\theta(y\mid x)\right]

Practical Notes

Naturally handles off-policy replay buffers without importance-sampling ratio explosion.

References

  1. Advantage-Weighted Regression: Simple and Scalable Off-Policy Reinforcement Learning ↗

    Xue Bin Peng, Aviral Kumar, Grace Zhang, Sergey Levine · 2019

  2. Offline RL for Natural Language Generation with Implicit Language Q Learning ↗

    Charlie Snell, Ilya Kostrikov, Yi Su, Mengjiao Yang, Sergey Levine · 2022

  3. AWAC: Accelerating Online Reinforcement Learning with Offline Datasets ↗

    Ashvin Nair, Abhishek Gupta, Murtaza Dalal, Sergey Levine · 2020