IP Library Granted Patent US 12,488,173
Granted Patent B2
US 12,488,173 · App. 17/538,946 · Granted Dec 2, 2025

Methods and systems for training a neural network using sequential Monte Carlo processing

Inventor: Alexandre Laterre (London, GB)
Assignee: Insta Deep Ltd
G06F30/394G06F30/3308G06F30/3953G06F30/398G06N3/04G06N3/047G06N3/08G06N20/00G06F2111/08
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,488,173
App. No.
17/538,946
Granted
Dec 2, 2025
Kind
B2
Abstract

A computer-implemented method, a machine learning system, and non-transitory computer-readable storage medium for training a neural network are provided. The neural network is used to instruct an agent to select actions for interacting with an environment to determine a solution to a specified problem. In the computer-implemented method a state signal representing a current state of the environment is received. A Sequential Monte Carlo process is then used to perform a search to determine target action selection data associated with the current state of the environment. This target action selection data is stored in association with the state signal and the current state of the environment is updated by providing an action selection signal based on the target action selection data. The Sequential Monte Carlo process involves generating a plurality of simulations using the neural network to determine the target action selection data.

Claims (37)

1 . A computer-implemented method of training a neural network having a plurality of network parameter values, the neural network being used to instruct an agent to select actions for interacting with an environment to determine a solution to a specified problem,

wherein the neural network is adapted to receive a state signal representing a state of the environment and to process the state signal according to the plurality of network parameter values to generate action selection data representing an action selection policy for selecting an action to be performed by the agent in response to the state signal,

wherein the computer-implemented method comprises:

receiving a state signal representing a current state of the environment;

using a Sequential Monte Carlo process to perform a search to determine target action selection data associated with the current state of the environment, the Sequential Monte Carlo process comprising:

generating a plurality of simulations each comprising a respective sequence of states and selected actions, each respective sequence starting at a first state of the environment and ending in a respective second state of the environment wherein the actions are selected using the neural network, and wherein at each state a weight value associated with the respective simulation is updated, wherein generating the plurality of simulations comprises:

monitoring weight values associated with the plurality of simulations;

selecting a first subset of the plurality of simulations for regeneration based on the monitoring; and

regenerating the first subset of the plurality of simulations by cloning a second subset of the plurality of simulations which were not selected for regeneration;

storing data indicative of the plurality of simulations in a buffer as the plurality of simulations are generated; and

determining the target action selection data by evaluating the weight values associated with the plurality of simulations;

storing the determined target action selection data in association with the state signal representing the current state of the environment for updating the network parameter values; and

updating the current state of the environment by providing an action selection signal based on the determined target action selection data.

2 . The computer-implemented method according to claim 1 , wherein the computer-implemented method is repeated until the environment is in a terminal state, and wherein the computer-implemented method further comprises training the neural network using the stored target action selection data based on an evaluation of the terminal state of the environment.

3 . The computer-implemented method according to claim 1 , wherein the buffer has a fixed capacity and storing data indicative of the plurality of simulations in the buffer includes replacing data previously stored in the buffer with data indicative of the plurality of simulations.

4 . The computer-implemented method according to claim 1 , wherein the neural network is adapted to generate predicted expected reward data in response to the received state signal by processing the received state signal according to the network parameter values, and wherein the action selection data comprises predicted expected reward data generated by the neural network.

5 . The computer-implemented method according to claim 1 , wherein selecting actions using the neural network to generate a said simulation of the plurality of simulations comprises at a said state of the said simulation using the neural network to determine at least a distribution over available actions and selecting an available action based on at least the distribution.

6 . The computer-implemented method according to claim 1 , wherein selecting the first subset of the plurality of simulations is triggered based on the monitoring.

7 . The computer-implemented method according to claim 1 , wherein the monitoring comprises comparing the weight values with a predetermined threshold.

8 . The computer-implemented method according to claim 1 , wherein the monitoring comprises updating a plurality of variance measures associated with the weight values and comparing the plurality of variance measures to a predetermined threshold.

9 . The computer-implemented method according to claim 1 , wherein the weight value for a said simulation of the plurality of simulations is updated based on predicted expected reward data for each state of the said simulation.

10 . The computer-implemented method according to claim 1 , wherein each simulation is associated with an entropy value, the entropy value being iteratively updated according to the sequence of actions, and wherein the weight values of the simulations are updated according to their respective associated entropy value.

11 . A machine learning system for training a neural network, the neural network being used to instruct an agent to select actions for interacting with an environment to determine a solution to a specified problem, the system comprising:

a neural network having a plurality of network parameter values, the neural network being adapted to receive a state signal representing a state of an environment and to process the state signal according to the plurality of network parameter values to generate action selection data representing an action selection policy for selecting an action to be performed by the agent in response to the state signal;

a buffer;

a training engine adapted to perform an iterative process, the iterative process comprising, iteratively:

receiving a state signal representing a current state of the environment;

using a Sequential Monte Carlo process to perform a search to determine target action selection data associated with a current state of the environment, the Sequential Monte Carlo process comprising:

generating a plurality of simulations each comprising a respective sequence of states and selected actions, each respective sequence starting from a first state of the environment and ending in a respective second state of the environment wherein the actions are selected using the neural network, and wherein at each state a weight value associated with the respective simulation is updated, wherein generating the plurality of simulations comprises:

monitoring weight values associates with the plurality of simulations;

selecting a first subset of the plurality of simulations for regeneration based on the monitoring; and

regenerating the first subset of the plurality of simulations by cloning a second subset of the plurality of simulations which were not selected for regeneration;

storing data indicative of the plurality of simulations in the buffer as the plurality of simulations are generated; and

determining the target action selection data by evaluating the weight values associated with the plurality of simulations;

store the target action selection data in association with the state signal representing the first state of the environment for updating the network parameter values of the neural network; and

update the current state of the environment by providing an action selection signal according to the target action selection data.

12 . A non-transitory computer-readable storage medium comprising computer readable instructions stored thereon which, when executed by at least one processor, cause the at least one processor to perform the method according to claim 1 .

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Nov 30, 2021
From: LATERRE, ALEXANDRE
To: INSTADEEP LTD
Reel/Frame 058248/0649 →
Priority Claims (4)
GB 1917292 · Nov 27, 2019 · national
GB 1917293 · Nov 27, 2019 · national
GB 1917294 · Nov 27, 2019 · national
GB 1917295 · Nov 27, 2019 · national
Continuity (2)
Continuation PCTGB2020053052 · Nov 27, 2020
Related Publication 20220083864A1 · Mar 17, 2022
References Cited (55)
US 5402359A · Oyanagi · 1995 [cited by applicant]
US 7657860B1 · Brashears et al. · 2010 [cited by applicant]
US 8370783B2 · Uchino et al. · 2013 [cited by applicant]
US 10437954B1 · White et al. · 2019 [cited by applicant]
US 10846453B1 · Castle · 2020 [cited by applicant]
US 11386322B1 · Ding et al. · 2022 [cited by applicant]
US 11604941B1 · Hester · 2023 [cited by examiner]
US 11628106B1 · Chitalu et al. · 2023 [cited by applicant]
US 20010018760A1 · Matsumoto · 2001 [cited by applicant]
US 20030023943A1 · Teig et al. · 2003 [cited by applicant]
US 20030066044A1 · Teig et al. · 2003 [cited by applicant]
US 20030079193A1 · Teig et al. · 2003 [cited by applicant]
US 20060156266A1 · Alpert et al. · 2006 [cited by applicant]
US 20090031275A1 · Cho et al. · 2009 [cited by applicant]
US 20090144688A1 · Uchino et al. · 2009 [cited by applicant]
US 20180307790A1 · Chuang et al. · 2018 [cited by applicant]
US 20190250568A1 · Li · 2019 [cited by examiner]
US 20190258918A1 · Wang · 2019 [cited by examiner]
US 20190332922A1 · Nachum · 2019 [cited by examiner]
US 20190354869A1 · Warde-Farley · 2019 [cited by examiner]
US 20200134445A1 · Che · 2020 [cited by examiner]
US 20200143239A1 · Simonyan · 2020 [cited by examiner]
US 20200151562A1 · Pietquin · 2020 [cited by examiner]
US 20210201156A1 · Hafner · 2021 [cited by examiner]
US 20210278825A1 · Wen · 2021 [cited by examiner]
US 20210342516A1 · Ren et al. · 2021 [cited by applicant]
US 20220366246A1 · Danihelka et al. · 2022 [cited by applicant]
US 20220366247A1 · Hamrick et al. · 2022 [cited by applicant]
US 20250051289A1 · Wayne · 2025 [cited by examiner]
JP 2005078519A · 2005 [cited by applicant]
TW 201906525A · 2019 [cited by applicant]
WO 2018215665A1 · 2018 [cited by applicant]
United States Non-Final Office Action dated Apr. 25, 2023 for U.S. Appl. No. 17/538,977. [cited by applicant]
United States Non-Final Office Action dated May 25, 2023 for U.S. Appl. No. 17/538,987. [cited by applicant]
Lazaric et al., “Reinforcement learning in continuous action spaces through sequential Monte Carlo methods”, NIPS 07: Proceedings of the 20th International Conference on Neural Information Processing Systems, pp. 833-84… [cited by applicant]
Kitazawa et al., “A Look-Ahead Line Search Algorithm With High Wireability for Custom VLSI Design”, Kyoto, Jun. 5-7, 1985; Proceedings of the International Symposium on Circuits and Systems, New York, IEEE, US, vol. 3, … [cited by applicant]
Chen et al., “Global and detailed routing”, In: “Electronic Design Automation—Synthesis, Verification, and Test”, Morgan Kaufman, XP055714202, ISBN: 978-0-12-374364-0, pp. 687-749, Jan. 1, 2009 (Jan. 1, 2009). [cited by applicant]
Freitas et al., “Sequential Monte Carlo Methods to Train Neural Network Models”, Neural Computation United States May 2000, vol. 12, pp. 955-993, XP055782945, X 1-13 US ISSN: 1530-888X, DOI: 10.1162/089976600300015664, … [cited by applicant]
Sun et al.: “A multithreaded initial detailed routing algorithm considering global routing guides”, Computer-Aided Design, ACM, 2 Penn Plaza, Suite 701NEW YORKNY10121-0701USA, pp. 1-7, XP058421057, DOI: 10.1145/3240765.… [cited by applicant]
Zhou et al., “An accurate detailed routing routability prediction model in placement”, 2015 6th Asia Symposium on Quality Electronic Design (ASQED), IEEE, pp. 119-122, XP033206637, DOI: 10.1109/ACQED.2015.7274019 the wh… [cited by applicant]
Laterre et al: “Ranked Reward: Enabling Self-Play Reinforcement Learning for Combinatorial Optimization”, Presented at the Thirty-second Conference on Neural Information Processing Systems (NeurIPS 2018), Deep Reinforce… [cited by applicant]
Levine, Sergey: “Reinforcement Learning and Control as Probabilistic Inference: Tutorial and Review”, arXiv:1805.00909v3, May 20, 2018. [cited by applicant]
Doucet et al: “An Introduction to Sequential Monte Carlo Methods” (2001) In: “Sequential Monte Carlo Methods in Practice. Statistics for Engineering and Information Science”, Jun. 21, 2001. [cited by applicant]
Anthony et al: “Thinking Fast and Slow with Deep Learning and Tree Search”, arXiv:1705.08439v4 [cs.AI], Dec. 3, 2017. [cited by applicant]
Ziebart et al: “Modeling Purposeful Adaptive Behavior with the Principle of Maximum Causal Entropy” Carnegie Mellon University, Dec. 1, 2010. [cited by applicant]
Silver et al: “A General Reinforcement learning Algorithm that Masters Chess, Shogi and Go Through Self-Play” Science vol. 362, Issue 6419 pp. 1140, Dec. 7, 2018. [cited by applicant]
Russell et al: “Artificial Intelligence a Modern Approach” Boston Pearson 2018 ISBN 978-0134610993, Dec. 1, 2009. [cited by applicant]
United Kingdom Combined Search and Examination dated May 14, 2020 for GB Application No. 1917293.1. [cited by applicant]
United Kingdom Combined Search and Examination dated May 14, 2020 for GB Application No. 1917292.3. [cited by applicant]
United Kingdom Combined Search and Examination dated May 14, 2020 for GB Application No. 1917294.9. [cited by applicant]
United Kingdom Combined Search and Examination dated Aug. 4, 2020 for GB Application No. 1917295.6. [cited by applicant]
International Search Report and Written Opinion dated Mar. 18, 2021 for PCT Application No. PCT/GB2020/053052. [cited by applicant]
International Search Report and Written Opinion dated Mar. 24, 2021 for PCT Application No. PCT/GB2020/053053. [cited by applicant]
International Search Report and Written Opinion dated Apr. 6, 2021 for PCT Application No. PCT/GB2020/053055. [cited by applicant]
International Search Report and Written Opinion dated Apr. 6, 2021 for PCT Application No. PCT/GB2020/053057. [cited by applicant]