Entropy and the soft target
Maximum-entropy RL adds temperature-weighted policy entropy to return. A common twin-critic SAC target is
The critic fits this target. The actor minimizes . Taking a minimum mitigates some overestimation; it does not prove unbiased values. SAC variants with an explicit value network should be distinguished from later implementations without it.
Temperature as a dual variable
The constraint introduces nonnegative . With a fixed policy,
Entropy above target gives a positive gradient, so descent reduces temperature; low entropy increases it. A source note reversed this sign interpretation. Continuous differential entropy may be negative, making discrete-entropy intuition inappropriate for negative target entropy.
Setting enforces positivity. The exact derivative of includes an alpha factor. A common log-temperature surrogate omits it, preserving fixed points but changing update scaling. Document the actual loss, detach boundaries, and target.
General dual optimization
Inner primal optimization and multiplier updates follow a stated Lagrangian convention. “Dual ascent” and “dual descent” cannot be compared without that convention. Strong duality and convex guarantees do not automatically apply to joint neural-policy training.
Corrections retained in this edition
Standard SAC is an online off-policy algorithm; fixed offline data require additional coverage treatment. Untraceable source claims of 40% speedup or 2.3-fold success are not promoted into this edition. A sampleable implicit policy also needs the required density calculations to use the standard entropy objective.
Related reading: reparameterization, sampling, and extrapolation.