Methods › Reinforcement Learning › Policy Gradient Methods › Soft Actor-Critic (Autotuned Temperature)
Soft Actor-Critic (Autotuned Temperature)
Introduced by Tuomas Haarnoja et al. in Soft Actor-Critic Algorithms and Applications
archive 2025-07-28 Description, source and code snippet are the archive's method entry.
Soft Actor Critic (Autotuned Temperature is a modification of the SAC reinforcement learning algorithm. SAC can suffer from brittleness to the temperature hyperparameter. Unlike in conventional reinforcement learning, where the optimal policy is independent of scaling of the reward function, in maximum entropy reinforcement learning the scaling factor has to be compensated by the choice a of suitable temperature, and a sub-optimal temperature can drastically degrade performance. To resolve this issue, SAC with Autotuned Temperature has an automatic gradient-based temperature tuning method that adjusts the expected entropy over the visited states to match a target value.
In Syntology for a different name, 'soft actor-critic', about another paper, arXiv:1801.01290: repository known, no verified implementation (declared_code; repositories: 5 listed of 86 in the graph, strongest link: official). The lookup matched a different name in Syntology's graph, 'soft actor-critic' (resolution: token_match); this answer is about that name. About another paper: this answer is about arXiv:1801.01290, while the archive credits arXiv:1812.05905.
Code Syntology holds under other names, as the lookup lists them (code_nearby); not a complete list, and none of them is this method.
- SOFT · shares_name_tokens (shares name tokens with this name; a different method) · level V3 · retrieve with
get_reference_implementation(name='SOFT') - Soft MoE · shares_name_tokens (shares name tokens with this name; a different method) · level V3 · retrieve with
get_reference_implementation(name='Soft MoE') - soft softmax-triplet loss · shares_name_tokens (shares name tokens with this name; a different method) · level V3 · retrieve with
get_reference_implementation(name='soft softmax-triplet loss') - MODEL-AUGMENTED ACTOR-CRITIC · shares_name_tokens (shares name tokens with this name; a different method) · level V3 · retrieve with
get_reference_implementation(name='MODEL-AUGMENTED ACTOR-CRITIC') - Critic Regularized Regression · shares_name_tokens (shares name tokens with this name; a different method) · level V3 · retrieve with
get_reference_implementation(name='Critic Regularized Regression')
Origin paper of this answer, arXiv:1801.01290 (its page on this site · its page on Syntology): Syntology's run record for its harvested code, 91 ran (of which 61 constructed an object rather than computing a result; 73 with no instrument failure: 3 honoured, 1 violated, 69 with no contract checked; 18 where Syntology's instrument failed) · 57 unverified (of 148 harvested samples) · 66 pointer-only (licence). The instrument figure counts failures of Syntology's instrument, not of the code. Ran means executed on a synthesized input, not that the code is correct.
Syntology's have check for this name (free, it answers coverage only), read 2026-10-05; ask it again live. A level is the served verification level of that one answer; nothing here is summed across methods.
What each level means, quoted from Syntology's server card: V0 “imports”; V1 “executes against a synthesized fixture and returns a value of the recorded type”; V2 “two implementations GENERATED from the paper's signature and spec agree numerically (1e-6) on fixture inputs” “neither of the two ever read the authors' own code, so V2 measures how unambiguously the paper specifies the method, not fidelity to the authors' implementation (measured 2026-09-11, commit 75eaa77: cross_checked_by is a second LLM on 2,628 of 2,831 served samples)”; V3 “paper-derived property tests pass on both of those same two generations.” The card adds: “No rung on this ladder compares the served code against the authors' implementation, so treat every level as evidence about runnability and internal agreement, not about matching the paper's results.” A level quoted in two parts is one definition the card writes as two clauses joined by a double hyphen, each clause quoted on its own (how these levels are quoted).
Papers archive 2025-07-28
archive papers tagged: 6 · with a code link: 6 · where Syntology ran a sample: 4 (4 with a run with no instrument failure, 0 where every run was a failure of Syntology's instrument) Syntology
Show: all tagged papersonly where code ran (4 of 6 tagged: 4 with a run with no instrument failure, 0 where every run was a failure of Syntology's instrument)
Page 1 of 1: papers 1 to 6 of 6, newest first by the archive's date (ties by slug), in archive order.
Repository counts are the archive's code-links table. A Syntology line states what Syntology ran from that paper's harvested code, as “N ran (of which C constructed an object rather than computing a result; K with no instrument failure: H honoured, V violated, P with no contract checked; I where Syntology's instrument failed) · U unverified”; the instrument figure counts failures of Syntology's instrument, not of the code. It is per sample and not a correctness claim. When the archive marks a repository official for the paper, the line starts with that repository's state (the archive's flag, not a verdict on who wrote the code; “community repositories only” when every sample that ran came from a community repository, “official: no sample here; runs from other or unrecorded repositories” when some came from a repository the paper names or has in its text, or from none recorded); hover it for the repositories the samples that ran came from.
-
Leveraging Demonstrations with Latent Space Priors 26 Oct 2022 · 1 repository · arXiv:2210.14685Syntology official (archive's flag): 2 ran · 2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified (of 3 harvested samples) · 3 pointer-only (licence)
-
Soft Actor-Critic Deep Reinforcement Learning for Fault Tolerant Flight Control 16 Feb 2022 · 1 repository · arXiv:2202.09262
-
Self-Supervised Policy Adaptation during Deployment 8 Jul 2020 · 2 repositories · arXiv:2007.04309Syntology 16 ran (of which 9 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 0 violated, 10 with no contract checked; 6 where Syntology's instrument failed) · 5 unverified (of 21 harvested samples) · 21 pointer-only (licence)
-
PFPN: Continuous Control of Physically Simulated Characters using Particle Filtering Policy Network 16 Mar 2020 · 1 repository · arXiv:2003.06959
-
Discrete and Continuous Action Representation for Practical RL in Video Games 23 Dec 2019 · 1 repository · arXiv:1912.11077Syntology 3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified (of 3 harvested samples)
-
Soft Actor-Critic Algorithms and Applications 13 Dec 2018 · 52 repositories · arXiv:1812.05905Syntology official: no sample here; runs from other or unrecorded repositories · 38 ran (of which 0 constructed an object rather than computing a result; 35 with no instrument failure: 4 honoured, 1 violated, 30 with no contract checked; 3 where Syntology's instrument failed) · 2 unverified (of 40 harvested samples) · 5 pointer-only (licence)
Tasks archive 2025-07-28
9 tasks the archive attaches to papers tagged with this method, by distinct papers. A task without a page in the catalog is plain text.
Usage over time archive 2025-07-28
Components: the archive holds no method-to-method composition, so PwC's Components table cannot be rebuilt; the Papers list carries no Results column for the same reason (the archive does not join its leaderboard rows to method tags).
Categories archive 2025-07-28
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections