IP Library Granted Patent US 12,190,223
Granted Patent B2
US 12,190,223 · App. 16/885,918 · Granted Jan 7, 2025

Training action selection neural networks using off-policy actor critic reinforcement learning and stochastic dueling neural networks

Inventors: Ziyu Wang (St. Albans, GB); Nicolas Manfred Otto Heess (London, GB); Victor Constant Bapst (London, GB)
Assignee: DeepMind Technologies Limited
G06N3/045G06N3/006G06N3/047G06N3/084G06N3/088
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,190,223
App. No.
16/885,918
Granted
Jan 7, 2025
Kind
B2
Abstract

Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for training an action selection neural network. One of the methods includes maintaining a replay memory that stores trajectories generated as a result of interaction of an agent with an environment; and training an action selection neural network having policy parameters on the trajectories in the replay memory, wherein training the action selection neural network comprises: sampling a trajectory from the replay memory; and adjusting current values of the policy parameters by training the action selection neural network on the trajectory using an off-policy actor critic reinforcement learning technique.

Claims (93)

1. A method comprising:

maintaining a replay memory that stores trajectories generated as a result of interaction of an agent with an environment, each trajectory comprising respective action selection data at each of a plurality of time steps, the action selection data at each time step identifying:

(i) an observation characterizing a state of the environment,

(ii) an action performed by the agent in response to the observation,

(iii) a reward received in response to the agent performing the action, and

(iv) at least an action selection score assigned to the performed action in determining which action to perform in response to the observation; and

training an action selection neural network having policy parameters on the trajectories in the replay memory, wherein the action selection neural network is configured to:

receive a provided observation characterizing a state of the environment; and

process the provided observation to generate a network output that defines a score distribution over possible actions that can be performed by the agent in response to the provided observation, and

wherein training the action selection neural network comprises:

sampling a trajectory from the replay memory; and

adjusting current values of the policy parameters by training the action selection neural network on the trajectory using an off-policy actor critic reinforcement learning technique, comprising:

for each time step in the trajectory:

processing the observation using the action selection neural network to define a main score distribution, wherein the main score distribution defines a distribution over a set of actions that can be performed by the agent to interact with the environment;

sampling a plurality of sampled actions, from the set of actions, in accordance with the main score distribution over the set of actions; and

receiving, by a stochastic dueling neural network, a data input to the stochastic dueling neural network comprising: (i) the observation characterizing the state of the environment at the time step, (ii) the performed action for the time step, and (iii) the plurality of sampled actions sampled in accordance with the main score distribution over the set of actions that can be performed by the agent to interact with the environment;

jointly processing: (i) the observation characterizing the state of the environment at the time step, (ii) the performed action for the time step, and (iii) the plurality of sampled actions sampled in accordance with the main score distribution over the set of actions that can be performed by the agent to interact with the environment, using the stochastic dueling neural network, to generate a stochastic Q value for the performed action, wherein the stochastic Q value for the performed action is a stochastic estimate of a Q value for the performed action; and

determining, based at least in part on the stochastic Q values, an update to the current values of the policy parameters.

2. The method of claim 1 , wherein jointly processing: (i) the observation characterizing the state of the environment at the time step, (ii) the performed action for the time step, and (iii) the plurality of sampled actions sampled in accordance with the main score distribution over the set of actions that can be performed by the agent to interact with the environment to generate the stochastic Q value for the performed action comprises:

generating, using the stochastic dueling neural network, a respective advantage estimate for each of the plurality of sampled actions;

generating, using the stochastic dueling neural network, an advantage estimate for the performed action.

3. The method of claim 2 , wherein jointly processing: (i) the observation characterizing the state of the environment at the time step, (ii) the performed action for the time step, and (iii) the plurality of sampled actions sampled in accordance with the main score distribution over the set of actions that can be performed by the agent to interact with the environment to generate the stochastic Q value for the performed action further comprises:

generating, using the stochastic dueling neural network, a deterministic value estimate for the time step.

4. The method of claim 3 , wherein jointly processing: (i) the observation characterizing the state of the environment at the time step, (ii) the performed action for the time step, and (iii) the plurality of sampled actions sampled in accordance with the main score distribution over the set of actions that can be performed by the agent to interact with the environment to generate the stochastic Q value for the performed action further comprises:

combining: (i) the respective advantage estimate for each of the plurality of sampled actions, (ii) the advantage estimate for the performed action, and (iii) the deterministic value estimate, to generate the stochastic Q value for the performed action.

5. The method of claim 1 , wherein the possible actions that can be performed by the agent in response to the provided observation are represented as points in a continuous action space and the network output comprises distribution parameters that define the score distribution over the points in the continuous action space.

6. The method of claim 1 , wherein determining, based at least in part on the stochastic Q values, an update to the current values of the policy parameters comprises, for each time step in the trajectory from the final time step in the trajectory to the initial time step in the trajectory:

determining a main gradient for the time step based at least in part on an off-policy correction estimate for the time step; and

updating the off-policy correction estimate for the time step based at least in part on the stochastic Q value for the performed action at the time step.

7. The method of claim 6 , wherein determining the main gradient for the time step based at least in part on the off-policy correction estimate for the time step comprises:

determining the main gradient for the time step based at least in part on a product of: (i) a difference between the off-policy correction estimate for the time step and a value estimate for the time step, and (ii) a gradient of a score for the performed action at the time step under the main score distribution for the time step.

8. A system comprising:

one or more computers; and

one or more storage devices communicatively coupled to the one or more computers, wherein the one or more storage devices store instructions that, when executed by the one or more computers, cause the one or more computers to perform operations comprising:

maintaining a replay memory that stores trajectories generated as a result of interaction of an agent with an environment, each trajectory comprising respective action selection data at each of a plurality of time steps, the action selection data at each time step identifying:

(i) an observation characterizing a state of the environment,

(ii) an action performed by the agent in response to the observation,

(iii) a reward received in response to the agent performing the action, and

(iv) at least an action selection score assigned to the performed action in determining which action to perform in response to the observation; and

training an action selection neural network having policy parameters on the trajectories in the replay memory, wherein the action selection neural network is configured to:

receive a provided observation characterizing a state of the environment; and

process the provided observation to generate a network output that defines a score distribution over possible actions that can be performed by the agent in response to the provided observation, and

wherein training the action selection neural network comprises:

sampling a trajectory from the replay memory; and

adjusting current values of the policy parameters by training the action selection neural network on the trajectory using an off-policy actor critic reinforcement learning technique, comprising:

for each time step in the trajectory:

processing the observation using the action selection neural network to define a main score distribution, wherein the main score distribution defines a distribution over a set of actions that can be performed by the agent to interact with the environment;

sampling a plurality of sampled actions, from the set of actions, in accordance with the main score distribution over the set of actions; and

receiving, by a stochastic dueling neural network, a data input to the stochastic dueling neural network comprising: (i) the observation characterizing the state of the environment at the time step, (ii) the performed action for the time step, and (iii) the plurality of sampled actions sampled in accordance with the main score distribution over the set of actions that can be performed by the agent to interact with the environment;

jointly processing: (i) the observation characterizing the state of the environment at the time step, (ii) the performed action for the time step, and (iii) the plurality of sampled actions sampled in accordance with the main score distribution over the set of actions that can be performed by the agent to interact with the environment, using the stochastic dueling neural network, to generate a stochastic Q value for the performed action, wherein the stochastic Q value for the performed action is a stochastic estimate of a Q value for the performed action; and

determining, based at least in part on the stochastic Q values, an update to the current values of the policy parameters.

9. The system of claim 8 , jointly processing: (i) the observation characterizing the state of the environment at the time step, (ii) the performed action for the time step, and (iii) the plurality of sampled actions sampled in accordance with the main score distribution over the set of actions that can be performed by the agent to interact with the environment to generate the stochastic Q value for the performed action comprises:

generating, using the stochastic dueling neural network, a respective advantage estimate for each of the plurality of sampled actions;

generating, using the stochastic dueling neural network, an advantage estimate for the performed action.

10. The system of claim 9 , wherein jointly processing: (i) the observation characterizing the state of the environment at the time step, (ii) the performed action for the time step, and (iii) the plurality of sampled actions sampled in accordance with the main score distribution over the set of actions that can be performed by the agent to interact with the environment to generate the stochastic Q value for the performed action further comprises:

generating, using the stochastic dueling neural network, a deterministic value estimate for the time step.

11. The system of claim 10 , wherein jointly processing: (i) the observation characterizing the state of the environment at the time step, (ii) the performed action for the time step, and (iii) the plurality of sampled actions sampled in accordance with the main score distribution over the set of actions that can be performed by the agent to interact with the environment to generate the stochastic Q value for the performed action further comprises:

combining: (i) the respective advantage estimate for each of the plurality of sampled actions, (ii) the advantage estimate for the performed action, and (iii) the deterministic value estimate, to generate the stochastic Q value for the performed action.

12. The system of claim 8 , wherein the possible actions that can be performed by the agent in response to the provided observation are represented as points in a continuous action space and the network output comprises distribution parameters that define the score distribution over the points in the continuous action space.

13. The system of claim 8 , wherein determining, based at least in part on the stochastic Q values, an update to the current values of the policy parameters comprises, for each time step in the trajectory from the final time step in the trajectory to the initial time step in the trajectory:

determining a main gradient for the time step based at least in part on an off-policy correction estimate for the time step; and

updating the off-policy correction estimate for the time step based at least in part on the stochastic Q value for the performed action at the time step.

14. The system of claim 13 , wherein determining the main gradient for the time step based at least in part on the off-policy correction estimate for the time step comprises:

determining the main gradient for the time step based at least in part on a product of: (i) a difference between the off-policy correction estimate for the time step and a value estimate for the time step, and (ii) a gradient of a score for the performed action at the time step under the main score distribution for the time step.

15. One or more non-transitory computer storage media storing instructions that when executed by one or more computers cause the one or more computers to perform operations comprising:

maintaining a replay memory that stores trajectories generated as a result of interaction of an agent with an environment, each trajectory comprising respective action selection data at each of a plurality of time steps, the action selection data at each time step identifying:

(i) an observation characterizing a state of the environment,

(ii) an action performed by the agent in response to the observation,

(iii) a reward received in response to the agent performing the action, and

(iv) at least an action selection score assigned to the performed action in determining which action to perform in response to the observation; and

training an action selection neural network having policy parameters on the trajectories in the replay memory, wherein the action selection neural network is configured to:

receive a provided observation characterizing a state of the environment; and

process the provided observation to generate a network output that defines a score distribution over possible actions that can be performed by the agent in response to the provided observation, and

wherein training the action selection neural network comprises:

sampling a trajectory from the replay memory; and

adjusting current values of the policy parameters by training the action selection neural network on the trajectory using an off-policy actor critic reinforcement learning technique, comprising:

for each time step in the trajectory:

processing the observation using the action selection neural network to define a main score distribution, wherein the main score distribution defines a distribution over a set of actions that can be performed by the agent to interact with the environment;

sampling a plurality of sampled actions, from the set of actions, in accordance with the main score distribution over the set of actions; and

receiving, by a stochastic dueling neural network, a data input to the stochastic dueling neural network comprising: (i) the observation characterizing the state of the environment at the time step, (ii) the performed action for the time step, and (iii) the plurality of sampled actions sampled in accordance with the main score distribution over the set of actions that can be performed by the agent to interact with the environment;

jointly processing: (i) the observation characterizing the state of the environment at the time step, (ii) the performed action for the time step, and (iii) the plurality of sampled actions sampled in accordance with the main score distribution over the set of actions that can be performed by the agent to interact with the environment, using the stochastic dueling neural network, to generate a stochastic Q value for the performed action, wherein the stochastic Q value for the performed action is a stochastic estimate of a Q value for the performed action; and

determining, based at least in part on the stochastic Q values, an update to the current values of the policy parameters.

16. The non-transitory computer storage media of claim 15 , wherein jointly processing: (i) the observation characterizing the state of the environment at the time step, (ii) the performed action for the time step, and (iii) the plurality of sampled actions sampled in accordance with the main score distribution over the set of actions that can be performed by the agent to interact with the environment to generate the stochastic Q value for the performed action comprises:

generating, using the stochastic dueling neural network, a respective advantage estimate for each of the plurality of sampled actions;

generating, using the stochastic dueling neural network, an advantage estimate for the performed action.

17. The non-transitory computer storage media of claim 16 , wherein jointly processing: (i) the observation characterizing the state of the environment at the time step, (ii) the performed action for the time step, and (iii) the plurality of sampled actions sampled in accordance with the main score distribution over the set of actions that can be performed by the agent to interact with the environment to generate the stochastic Q value for the performed action further comprises:

generating, using the stochastic dueling neural network, a deterministic value estimate for the time step.

18. The non-transitory computer storage media of claim 17 , wherein jointly processing: (i) the observation characterizing the state of the environment at the time step, (ii) the performed action for the time step, and (iii) the plurality of sampled actions sampled in accordance with the main score distribution over the set of actions that can be performed by the agent to interact with the environment to generate the stochastic Q value for the performed action further comprises:

combining: (i) the respective advantage estimate for each of the plurality of sampled actions, (ii) the advantage estimate for the performed action, and (iii) the deterministic value estimate, to generate the stochastic Q value for the performed action.

19. The non-transitory computer storage media of claim 15 , wherein the possible actions that can be performed by the agent in response to the provided observation are represented as points in a continuous action space and the network output comprises distribution parameters that define the score distribution over the points in the continuous action space.

20. The non-transitory computer storage media of claim 15 , wherein determining, based at least in part on the stochastic Q values, an update to the current values of the policy parameters comprises, for each time step in the trajectory from the final time step in the trajectory to the initial time step in the trajectory:

determining a main gradient for the time step based at least in part on an off-policy correction estimate for the time step; and

updating the off-policy correction estimate for the time step based at least in part on the stochastic Q value for the performed action at the time step.

Assignments (2)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Apr 29, 2025
From: DEEPMIND TECHNOLOGIES LIMITED
To: GDM HOLDING LLC
Reel/Frame 071109/0414 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded May 28, 2020
From: WANG, ZIYU; HEESS, NICOLAS MANFRED OTTO; BAPST, VICTOR CONSTANT
To: DEEPMIND TECHNOLOGIES LIMITED
Reel/Frame 052777/0983 →
Continuity (4)
Continuation 16402687 · May 3, 2019
Continuation PCTIB2017001329 · Nov 3, 2017
Provisional Application 62417235 · Nov 3, 2016
Related Publication 20200293862A1 · Sep 17, 2020
References Cited (44)
US 10152676B1 · Strom · 2018 [cited by applicant]
US 20140025613A1 · Ponulak · 2014 [cited by applicant]
US 20150100530A1 · Mnih et al. · 2015 [cited by applicant]
US 20160232445A1 · Srinivasan et al. · 2016 [cited by applicant]
CN 105637540 · 2016 [cited by applicant]
CN 106056213 · 2016 [cited by applicant]
Degris et al. Off-Policy Actor-Critic. Proceedings of the 29 th International Conference on Machine Learning, Edinburgh, Scotland, UK, 2012. (Year: 2012). [cited by examiner]
Wang et al., Dueling Network Architectures for Deep Reinforcement Learning. Apr. 5, 2016. (Year: 2016). [cited by examiner]
Office Action in Chinese Appln. No. 201780067832.7, dated Oct. 21, 2022, 16 pages. [cited by applicant]
Office Action in European Appln. No. 20168108.7, dated Aug. 9, 2021, 9 pages. [cited by applicant]
Bellemare et al, “The arcade learning environment: an evaluation platform for general agents,” arXiv, Jun. 21, 2013, 27 pages. [cited by applicant]
Brockman et al, “OpenAI Gym,” arXiv, Jun. 5, 2016, 4 pages. [cited by applicant]
Bucilua et al, “Model compression,” Cornell University, Aug. 2006, 7 pages. [cited by applicant]
Degris et al, “Off-policy actor-critic,” arXiv, Jun. 20, 2013, 18 pages. [cited by applicant]
Emami et al [online], Deep deterministic policy gradients in TensorFlow, GitHub.com, Aug. 2016, [retrieved on Jun. 13, 2019], retrieved from: URL<https://pemami4911.github.io/blog/2016/08/21/ddpg-rl.html>, 22 pages. [cited by applicant]
EP Office Action in the European Appln. No. 17818249.9-1221, dated May 8, 2019, 3 pages. [cited by applicant]
Gu et al. Continuous Deep Q-Learning with Model-based Acceleration. Mar. 2016. [cited by applicant]
Harutyunyan et al, “Q with off-policy corrections,” arXiv, Aug. 11, 2016, 15 pages. [cited by applicant]
Heess et al, “Learning continuous control policies by stochastic value gradients,” arXiv, Oct. 30, 2015, 13 pages. [cited by applicant]
Jie et al, “On a connection between importance sampling and the likelihood ratio policy gradient,” Paper NIPS, 2010, 9 pages. [cited by applicant]
JP Office Action in Japanese Appln. No. 2019-522656, dated May 18, 2020, 8 pages (with English translation). [cited by applicant]
Levine et al, “End-to-end training of deep visuomotor policies,” arXiv, Apr. 19, 2016, 40 pages. [cited by applicant]
Levine et al, “Guided policy search,” Proceedings of the 20th ICML, 2013, 9 pages. [cited by applicant]
Lillicrap et al, “Continuous control with deep reinforcement learning,” arXiv, Jul. 5, 2019, 14 pages. [cited by applicant]
Lin et al, “Self-improving reactive agents based on reinforcement learning, planning, and teaching,” Machine Learning, May 1992, 29 pages. [cited by applicant]
Meuleau et al, “Off-policy policy search,” Technical report, MIT AI Lab, 2000, 7 pages. [cited by applicant]
Mnih et al, “Asynchronous methods for deep reinforcement learning,” arXiv, Jun. 16, 2016, 19 pages. [cited by applicant]
Mnih et al, “Human-level control through deep reinforcement learning,” Nature, Macmillan Publishers Limited, 2015, 13 pages. [cited by applicant]
Munos et al, “Safe and efficient off-policy reinforcement learning,” arXiv, Jun. 2016, 18 pages. [cited by applicant]
Narasimhan et al, “Language understanding for text-based games using deep reinforcement learning,” arXiv, Sep. 11, 2015, 11 pages. [cited by applicant]
Oh et al, “Control of memory, active perception, and action in Minecraft,” arXiv, May 30, 2016, 22 pages. [cited by applicant]
PCT International Preliminary Report on Patentability in International Appln. PCT/IB2017/001329, dated Jan. 25, 2019, 14 pages. [cited by applicant]
PCT International Search Report and Written Opinion in International Appln. PCT/IB2017/001329, dated Mar. 6, 2018, 24 pages. [cited by applicant]
Precup et al, “Eligibility traces for off-policy evaluations,” Semantic Scholar, 2000, 8 pages. [cited by applicant]
Schaul et al, “Prioritized experience replay,” arXiv, Feb. 25, 2016, 21 pages. [cited by applicant]
Schulman et al, “High-dimensional continuous control using generalized advantage estimation,” arXiv, Oct. 20, 2018, 14 pages. [cited by applicant]
Schulman et al, “Trust region policy optimization,” arXiv, Apr. 20, 2017, 16 pages. [cited by applicant]
Silver et al., “Deterministic policy gradient algorithms,” Proceedings of the 31st ICML, 2014, 9 pages. [cited by applicant]
Silver et al, “Mastering the game of Go with deep neural networks and tree search,” Nature, Jan. 2016, 20 pages. [cited by applicant]
Sutton et al, “Policy gradient methods for reinforcement learning with function approximation,” Paper NIPS, 2000, 7 pages. [cited by applicant]
Todorov et al, “MuJoCo: a physics engine for model-based control,” An International Conference on Intelligent Robots and Systems, Oct. 2012, 8 pages. [cited by applicant]
Wang et al, “Dueling network architectures for deep reinforcement learning,” arXiv, Apr. 5, 2016, 15 pages. [cited by applicant]
Wawrzynski, “Real-time reinforcement learning by sequential actor-critics and experience replay,” CiteSeerx, Jun. 2009, 36 pages. [cited by applicant]
JP Decision to Grant a Patent in Appln. No. 2019-522656, dated Dec. 21, 2020, 5 pages (with English translation). [cited by applicant]