TD-Regularized Actor-Critic Methods
Not on the map. Why?
Abstract (arXiv)
Actor-critic methods can achieve incredible performance on difficult reinforcement learning problems, but they are also prone to instability. This is partly due to the interaction between the actor and critic during learning, e.g., an inaccurate step taken by one of them might adversely affect the other and destabilize the learning. To avoid such issues, we propose to regularize the learning objective of the actor by penalizing the temporal difference (TD) error of the critic. This improves stability by avoiding large steps in the actor update whenever the critic is highly inaccurate. The resulting method, which we call the TD-regularized actor-critic method, is a simple plug-and-play approach to improve stability and overall performance of the actor-critic methods. Evaluations on standard benchmarks confirm this.
Key facts. Cited by 13 papers in the map (data through 7 Oct 2026). First posted on arXiv 19 Dec 2018.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2020: 1; 2021: 1; 2022: 4; 2023: 1; 2024: 1; 2025: 4; 2026: 1.
13 papers.
Sort:
By area:
- 2025WebSTAR: Scalable Data Synthesis for Computer Use Agents with Step-Level Filteringcited by 11
- 2021Optimistic Reinforcement Learning by Forward Kullback-Leibler Divergence Optimizationcited by 6
- 2022Reinforcement Learning Your Way: Agent Characterization through Policy Regularizationcited by 6
- 2022Proximal Policy Optimization with Adaptive Threshold for Symmetric Relative Density Ratiocited by 5
- 2022Reward Bonuses with Gain Scheduling Inspired by Iterative Deepening Searchcited by 5
- 2020Forward and inverse reinforcement learning sharing network weights and hyperparameterscited by 4
- 2025KETCHUP: K-Step Return Estimation for Sequential Knowledge Distillationcited by 2
- 2026Temporal Difference Learning with Constrained Initial Representationscited by 2
- 2024Design of Restricted Normalizing Flow towards Arbitrary Stochastic Policy with Computational Efficiencycited by 1
- 2025Enhancing Generative Auto-bidding with Offline Reward Evaluation and Policy Searchcited by 1
- 2025Task Specific Sharpness Aware O-RAN Resource Management using Multi Agent Reinforcement Learningcited by 1
- 2022General sum stochastic games with networked information flowscited by 0
- 2026Temporal Difference Learning with Constrained Initial Representations12 Feb 2026
- 2025WebSTAR: Scalable Data Synthesis for Computer Use Agents with Step-Level Filtering22 Nov 2025
- 2025Task Specific Sharpness Aware O-RAN Resource Management using Multi Agent Reinforcement Learning19 Nov 2025
- 2025Enhancing Generative Auto-bidding with Offline Reward Evaluation and Policy Search19 Sep 2025
- 2025KETCHUP: K-Step Return Estimation for Sequential Knowledge Distillation26 Apr 2025
- 2024Design of Restricted Normalizing Flow towards Arbitrary Stochastic Policy with Computational Efficiency17 Dec 2024
- 2023Mitigating Estimation Errors by Twin TD-Regularized Actor and Critic for Deep Reinforcement Learning7 Nov 2023
- 2022Reward Bonuses with Gain Scheduling Inspired by Iterative Deepening Search21 Dec 2022
- 2022General sum stochastic games with networked information flows5 May 2022
- 2022Proximal Policy Optimization with Adaptive Threshold for Symmetric Relative Density Ratio18 Mar 2022
- 2022Reinforcement Learning Your Way: Agent Characterization through Policy Regularization21 Jan 2022
- 2021Optimistic Reinforcement Learning by Forward Kullback-Leibler Divergence Optimization27 May 2021
- 2021Optimistic Reinforcement Learning by Forward Kullback-Leibler Divergence Optimizationcited by 6
- 2022Reinforcement Learning Your Way: Agent Characterization through Policy Regularizationcited by 6
- 2022Proximal Policy Optimization with Adaptive Threshold for Symmetric Relative Density Ratiocited by 5
- 2022Reward Bonuses with Gain Scheduling Inspired by Iterative Deepening Searchcited by 5
- 2025KETCHUP: K-Step Return Estimation for Sequential Knowledge Distillationcited by 2
- 2026Temporal Difference Learning with Constrained Initial Representationscited by 2
- 2024Design of Restricted Normalizing Flow towards Arbitrary Stochastic Policy with Computational Efficiencycited by 1
- 2025Enhancing Generative Auto-bidding with Offline Reward Evaluation and Policy Searchcited by 1
- 2025Task Specific Sharpness Aware O-RAN Resource Management using Multi Agent Reinforcement Learningcited by 1
- 2022General sum stochastic games with networked information flowscited by 0
- 2023Mitigating Estimation Errors by Twin TD-Regularized Actor and Critic for Deep Reinforcement Learningcited by 0
- 2026Temporal Difference Learning with Constrained Initial Representations12 Feb 2026
- 2025Task Specific Sharpness Aware O-RAN Resource Management using Multi Agent Reinforcement Learning19 Nov 2025
- 2025Enhancing Generative Auto-bidding with Offline Reward Evaluation and Policy Search19 Sep 2025
- 2025KETCHUP: K-Step Return Estimation for Sequential Knowledge Distillation26 Apr 2025
- 2024Design of Restricted Normalizing Flow towards Arbitrary Stochastic Policy with Computational Efficiency17 Dec 2024
- 2023Mitigating Estimation Errors by Twin TD-Regularized Actor and Critic for Deep Reinforcement Learning7 Nov 2023
- 2022Reward Bonuses with Gain Scheduling Inspired by Iterative Deepening Search21 Dec 2022
- 2022General sum stochastic games with networked information flows5 May 2022
- 2022Proximal Policy Optimization with Adaptive Threshold for Symmetric Relative Density Ratio18 Mar 2022
- 2022Reinforcement Learning Your Way: Agent Characterization through Policy Regularization21 Jan 2022
- 2021Optimistic Reinforcement Learning by Forward Kullback-Leibler Divergence Optimization27 May 2021