The paper analyzes an actor-critic algorithm with target networks for deep reinforcement learning.
arXiv research
A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
Trend · papers per month
New PAC-Bayesian approach stabilizes actor-critic learning.
We present an actor-critic framework for MDPs where the objective is the variance-adjusted expected return. Our critic uses linear function approximation, and we extend the concept of compatible features to the variance-adjusted setting. We present an episodic actor-critic algorithm and show that it converges almost su…
Theoretical justification for asymmetric actor-critic algorithms in reinforcement learning.
Despite the empirical success of the actor-critic algorithm, its theoretical understanding lags behind. In a broader context, actor-critic can be viewed as an online alternating update algorithm for bilevel optimization, whose convergence is known to be fragile. To understand the instability of actor-critic, we focus o…
Develops an actor-critic algorithm for risk-sensitive Markov decision processes.
Actor-critic algorithms converge to an ODE as data samples change dynamically.
We develop an off-policy actor-critic algorithm for learning an optimal policy from a training set composed of data from multiple individuals. This algorithm is developed with a view towards its use in mobile health.
Pretraining with expert demonstrations have been found useful in speeding up the training process of deep reinforcement learning algorithms since less online simulation data is required. Some people use supervised learning to speed up the process of feature learning, others pretrain the policies by imitating expert dem…
New analysis shows actor-critic method converges efficiently in practical settings.
We propose a new algorithm, Mean Actor-Critic (MAC), for discrete-action continuous-state reinforcement learning. MAC is a policy gradient algorithm that uses the agent's explicit representation of all action values to estimate the gradient of the policy, rather than using only the actions that were actually executed. …
TT-DAC-PS: A deterministic actor-critic approach for optimal trade execution
We study the problem of off-policy critic evaluation in several variants of value-based off-policy actor-critic algorithms. Off-policy actor-critic algorithms require an off-policy critic evaluation step, to estimate the value of the new policy after every policy gradient update. Despite enormous success of off-policy …
Optimistic actor-critic tackles linear MDPs with parametric policies.
We propose a new policy iteration theory as an important extension of soft policy iteration and Soft Actor-Critic (SAC), one of the most efficient model free algorithms for deep reinforcement learning. Supported by the new theory, arbitrary entropy measures that generalize Shannon entropy, such as Tsallis entropy and R…
Soft Actor-Critic is a state-of-the-art reinforcement learning algorithm for continuous action settings that is not applicable to discrete action settings. Many important settings involve discrete actions, however, and so here we derive an alternative version of the Soft Actor-Critic algorithm that is applicable to dis…
This work analyzes actor-critic methods for faster convergence.
FORK improves model-free reinforcement learning performance.
New algorithms improve robust reinforcement learning under uncertainty.
New testing method for robust actor-critic bandit algorithms.
WAVE improves stability in reinforcement learning by adaptively weighting critic's loss.
Study uses actor-critic method for continuous-time mean-field control with entropy regularisation.
We reformulate the option framework as two parallel augmented MDPs. Under this novel formulation, all policy optimization algorithms can be used off the shelf to learn intra-option policies, option termination conditions, and a master policy over options. We apply an actor-critic algorithm on each augmented MDP, yieldi…
Improved convergence for actor-critic algorithms in MDPs.
Neural networks trained with actor-critic algorithms converge to ODEs under weak convergence analysis.
New algorithm solves mean-field control problems using actor-critic learning with moment neural networks.
New actor-critic algorithm achieves optimal sample efficiency in RL.
Improved sample complexity for actor-critic algorithms in MDPs.
Self-Tuning Actor-Critic improves reinforcement learning performance.
Actor-Critic method achieves optimal regret for unichain MDPs.
New method improves deep policy gradient algorithms by learning relative state values.
Deep learning model solves high-dimensional PDEs using Actor-Critic approach.
Deep actor-critic learning optimizes power control in mobile networks.
Single-timescale actor-critic finds globally optimal policy.
Study efficient convergence of RL algorithm with function approximation.
In this paper, we propose a distributed off-policy actor critic method to solve multi-agent reinforcement learning problems. Specifically, we assume that all agents keep local estimates of the global optimal policy parameter and update their local value function estimates independently. Then, we introduce an additional…
USAC balances pessimism and optimism in actor-critic training for better exploration and performance.
Model-free deep reinforcement learning (RL) algorithms have been demonstrated on a range of challenging decision making and control tasks. However, these methods typically suffer from two major challenges: very high sample complexity and brittle convergence properties, which necessitate meticulous hyperparameter tuning…
This paper considers a distributed reinforcement learning problem in which a network of multiple agents aim to cooperatively maximize the globally averaged return through communication with only local neighbors. A randomized communication-efficient multi-agent actor-critic algorithm is proposed for possibly unidirectio…
This paper extends off-policy reinforcement learning to the multi-agent case in which a set of networked agents communicating with their neighbors according to a time-varying graph collaboratively evaluates and improves a target policy while following a distinct behavior policy. To this end, the paper develops a multi-…
This paper improves sample complexity for AC and NAC algorithms under Markovian sampling.
Study policy gradient and actor-critic methods for continuous-time reinforcement learning.
In this paper we propose a hybrid architecture of actor-critic algorithms for reinforcement learning in parameterized action space, which consists of multiple parallel sub-actor networks to decompose the structured action space into simpler action spaces along with a critic network to guide the training of all sub-acto…
AGAC uses an adversary to enhance exploration in complex tasks.
Paper provides convergence guarantees for off-policy NAC with finite sample complexity.
In this work, we study the credit assignment problem in reward augmented maximum likelihood (RAML) learning, and establish a theoretical equivalence between the token-level counterpart of RAML and the entropy regularized reinforcement learning. Inspired by the connection, we propose two sequence prediction algorithms, …
In traditional reinforcement learning, an agent maximizes the reward collected during its interaction with the environment by approximating the optimal policy through the estimation of value functions. Typically, given a state s and action a, the corresponding value is the expected discounted sum of rewards. The optima…
This paper proposes Self-Imitation Learning (SIL), a simple off-policy actor-critic algorithm that learns to reproduce the agent's past good decisions. This algorithm is designed to verify our hypothesis that exploiting past good experiences can indirectly drive deep exploration. Our empirical results show that SIL sig…