← Înapoi la Urmăritori

Cel mai recent articol

Ultima verificare

Urmăritori 0 urmăritori
Articole: 13
  1. Branching rollouts give a tree replay buffer; the policy gradient is four expectations, and each one must be Rao-Blackwellized correctly

  2. Token-level policy gradient is correct, average over batch tokens, and a packed batch is a replay buffer

  3. Differentiating through optimization

  4. Unf***ing Your RL Gradient Estimator

  5. The math behind replay buffers

  6. Brute-forcing VAE math

  7. SFT is bad RL

    RL is better than SFT

  8. Definitions of Memorization

    Information-theoretic definitions of memorization

  9. Character prefix completion

    Sampling given character prefixes

  10. Everything is a latent variable model

  11. Some calculus busywork

  12. Variational inference for a simple Ising model

  13. First post

    First post