Actor-Critic (AC) Agent

Actor-critic (AC) agents implement actor-critic algorithms such as A2C and A3C, which are on-policy policy-gradient reinforcement learning methods for environments with a discrete or continuous action space. The actor-critic agent directly optimizes a stochastic policy and uses a value function critic to estimate the value of the policy [1]. The AC agent is similar to a REINFORCE policy gradient agent with a baseline, with the difference that AC uses a fully bootstrapping critic (that is it used to update the value estimate of a state based on the value estimates of subsequent states). You can use the, which uses to implement actor-critic algorithms, such as A2C and A3C. For continuous action spaces, this agent does not enforce constraints set in the action specification; therefore, if you need to enforce action constraints, you must do so within the environment.

In Reinforcement Learning Toolbox™, a REINFORCE actor-critic agent is implemented by an rlACAgent object.

Note

AC agents do not generally have functional advantages with respect to more recent agents such as PPO and are provided mostly for educational purposes.

For more information on the different types of reinforcement learning agents, see Reinforcement Learning Agents.

Actor-critic agents can be trained in environments with the following observation and action spaces.

Observation Space	Action Space
Discrete or continuous	Discrete or continuous

Actor-critic agents use the following actor and critics.

Critic	Actor
Value function critic V(S), which you create using rlValueFunction	Stochastic policy actor π(S), which you create using rlDiscreteCategoricalActor (for discrete action spaces) or rlContinuousGaussianActor (for continuous action spaces)

During training, an actor-critic agent:

• Estimates probabilities of taking each action in the action space and randomly selects actions based on the probability distribution.

• Interacts with the environment for multiple steps using the current policy before updating the actor and critic properties.

If the UseExplorationPolicy option of the agent is set to false the action with maximum likelihood is always used in sim and generatePolicyFunction. As a result, the simulated agent and generated policy behave deterministically.

If the UseExplorationPolicy is set to true the agent selects its actions by sampling its probability distribution. As a result the policy is stochastic and the agent explores its observation space.

Note

The UseExplorationPolicy option affects only simulation and deployment; it does not affect training. When you train an agent using train, the agent always uses its exploration policy independently of the value of this property.

Actor and Critic Used by the AC Agent

To estimate the policy and value function, an actor-critic agent maintains two function approximators.

• Actor π(A|S;θ) — The actor, with parameters θ, outputs the conditional probability of taking each action A when in state S as one of the following:

  • Discrete action space — The probability of taking each discrete action. The sum of these probabilities across all actions is 1.

  • Continuous action space — The mean and standard deviation of the Gaussian probability distribution for each continuous action.

• Critic V(S;ϕ) — The critic, with parameters ϕ, takes observation S and returns the corresponding expectation of the discounted long-term reward.

During training, the actor tunes the parameter values in θ to improve the policy. Similarly, during training, the critic tunes the parameter values in ϕ to improve its value function estimation. After training, the parameters remain at their tuned values in the actor and critic internal to the trained agent.

For more information on actors and critics, see Create Policies and Value Functions.

AC Agent Creation

You can create an actor-critic agent with default actor and critics based on the observation and action specifications from the environment. To do so, perform the following steps.

1. Create observation specifications for your environment. If you already have an environment object, you can obtain these specifications using getObservationInfo.

2. Create action specifications for your environment. If you already have an environment object, you can obtain these specifications using getActionInfo.

3. If needed, specify the number of neurons in each learnable layer of the default network or whether to use an LSTM layer. To do so, create an agent initialization option object using rlAgentInitializationOptions.

4. If needed, specify agent options using an rlACAgentOptions object. Alternatively, you can skip this step and modify the agent options later using dot notation.

5. Create the agent using rlACAgent.

Alternatively, you can create actor and critic and use these objects to create your agent. In this case, ensure that the input and output dimensions of the actor and critic match the corresponding action and observation specifications of the environment.

1. Create observation specifications for your environment. If you already have an environment object, you can obtain these specifications using getObservationInfo.

2. Create action specifications for your environment. If you already have an environment object, you can obtain these specifications using getActionInfo.

3. Create an approximation model for your actor. For continuous action spaces, this model must be a neural network object. For discrete action spaces, you also have the option of using a custom basis function with initial parameter values.

4. Create an actor using rlDiscreteCategoricalActor (for discrete action spaces) or rlContinuousGaussianActor (for continuous action spaces). Use the model you created in the previous step as a first input argument.

5. Create an approximation model for your critic. For continuous action spaces you must use either a custom basis function with initial parameter values or a neural network object. For discrete action space you also have the option of using an rlTable object.

6. Create a critic using rlValueFunction. Use the model you created in the previous step as a first input argument.

7. Specify agent options using an rlACAgentOptions object. Alternatively, you can skip this step and modify the agent options later using dot notation.

8. Create the agent using rlACAgent.

For more information on creating actors and critics for function approximation, see Create Policies and Value Functions.

AC Training Algorithm

Actor-critic agents use the following training algorithm. To configure the training algorithm, specify options using an rlACAgentOptions object.

1. Initialize the actor π(A|S;θ) with random parameter values θ.

2. Initialize the critic V(S;ϕ) with random parameter values ϕ.

3. Generate up to N+1 experiences (within the current episode) by following the current policy.

   1. At the beginning of each episode, get the initial observation S₁ from the environment.

   2. For the current observation S_t, select the action A_t using the policy in π(A|S;θ).

   3. Execute action A_t. Observe the reward R_t+1 and the next observation S_t+1.

   4. Store the experience (S_t,A_t,R_t+1,S_t+1).

   The episode experience sequence is

   $$S_{ts},A_{ts},R_{ts+1},S_{ts+1},\dots ,S_{ts+N-1},A_{ts+N-1},R_{ts+N},S_{ts+N}$$

   Here, ts is the starting time step of the current set of N experiences. At the beginning of the training episode, ts = 1. For each subsequent set of N experiences in the same training episode, ts = ts + N.

   For each training episode that does not contain a terminal state, N is equal to the value of the NumStepsToLookAhead option. Otherwise, N is less than NumStepsToLookAhead and S_N is the terminal state.

4. For each episode step t = ts, ts+1, …, ts+N, compute the return G_t, which is the sum of the reward for that step and the discounted future reward. If S_ts+N is not a terminal state, the discounted future reward includes the discounted state value function, computed using the critic network V.

   $$G_t={\displaystyle \sum _{k=t+1}^{ts+N}\left({\gamma }^{k-t-1}{R}_k\right)}+b{\gamma }^{ts+N-t}V\left(S_{ts+N};\varphi \right)$$

   Here, b is 0 if S_ts+N is a terminal state and 1 otherwise.

   To specify the discount factor γ, use the DiscountFactor option.

5. Compute the advantage function D_t.

   $$D_t=G_t-V\left(S_t;\varphi \right)$$

6. Accumulate the gradients for the actor network by following the policy gradient to maximize the expected discounted cumulative long-term reward.

   $$d\theta ={\displaystyle \sum _{t=1}^N{\nabla }_{{\theta }_{\mu }}}\ln \pi \left(A|S_t;\theta \right)\cdot D_t$$

   Here, ℋ_t(θ,S_t) is the entropy loss and w is the entropy loss weight factor, specified using the EntropyLossWeight option. For more information on entropy loss, see Entropy Loss.

7. Accumulate the gradients for the critic network by minimizing the mean squared error loss between the estimated value function V (S_t;ϕ) and the computed target return G_t across all N experiences.

   $$d\varphi ={\displaystyle \sum _{t=1}^N{\nabla }_{\varphi }}{\left(G_t-V\left(S_t;\varphi \right)\right)}^2$$

8. Update the actor parameters by applying the gradients.

   $$\theta =\theta +\alpha d\theta$$

   Here, α is the learning rate of the actor. Specify the learning rate when you create the actor by setting the LearnRate option in the rlActorOptimizerOptions property within the agent options object.

9. Update the critic parameters by applying the gradients.

   $$\varphi =\varphi +\beta d\varphi$$

   Here, β is the learning rate of the critic. Specify the learning rate when you create the critic by setting the LearnRate option in the rlCriticOptimizerOptions property within the agent options object.

10. Repeat steps 3 through 9 for each training episode until training is complete.

For simplicity, the actor and critic updates in this algorithm description show a gradient update using basic stochastic gradient descent. The actual gradient update method depends on the optimizer you specify in the rlOptimizerOptions object assigned to the rlCriticOptimizerOptions property.

Entropy Loss

To promote agent exploration, you can subtract an entropy loss term wℋ_i(θ,S_i) from the actor loss function, where w is the entropy loss weight and ℋ_i(θ,S_i) is the entropy.

The entropy value is higher when the agent is more uncertain about which action to take next. Therefore, maximizing the entropy loss term (minimizing the negative entropy loss) increases the agent uncertainty, thus encouraging exploration. To promote additional exploration, which can help the agent move out of local optima, you can specify a larger entropy loss weight.

For a discrete action space, the agent uses the following entropy value. In this case, the actor outputs the probability of taking each possible discrete action.

$${\mathscr{H}}_i\left(\theta ,S_i\right)=-{\displaystyle \sum _{k=1}^P\pi \left(A_k|S_i;\theta \right)\ln \pi \left(A_k|S_i;\theta \right)}$$

Here:

• P is the number of possible discrete actions.

• π(A_k|S_i;θ) is the probability of taking action A_k when in state S_i following the current policy.

For a continuous action space, the agent uses the following entropy value. In this case, the actor outputs the mean and standard deviation of the Gaussian distribution for each continuous action.

$${\mathscr{H}}_i\left(\theta ,S_i\right)=\frac{1}{2}{\displaystyle \sum _{k=1}^C\ln \left(2\pi \cdot e\cdot {\sigma }_{k,i}^2\right)}$$

Here:

• C is the number of continuous actions output by the actor.

• σ_k,i is the standard deviation for action k when in state S_i following the current policy.

References

[1] Mnih, Volodymyr, Adrià Puigdomènech Badia, Mehdi Mirza, Alex Graves, Timothy P. Lillicrap, Tim Harley, David Silver, and Koray Kavukcuoglu. “Asynchronous Methods for Deep Reinforcement Learning.” ArXiv:1602.01783 [Cs], February 4, 2016. https://arxiv.org/abs/1602.01783.

[2] Sutton, Richard S., and Andrew G. Barto. Reinforcement Learning: An Introduction. Second edition. Adaptive Computation and Machine Learning. Cambridge, Mass: The MIT Press, 2018.