IP Library Granted Patent US 12,585,912
Granted Patent B2
US 12,585,912 · App. 17/766,854 · Granted Mar 24, 2026

Gated linear contextual bandits

Inventors: Eren Sezener (London, GB); Joel William Veness (London, GB); Marcus Hutter (London, GB); Jianan Wang (Kai Tak, HK); David Budden (London, GB)
Assignee: GDM Holding LLC
G06N3/006G06N3/063
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,585,912
App. No.
17/766,854
Granted
Mar 24, 2026
Kind
B2
Abstract

Methods, systems, and apparatus, including computer programs encoded on computer-readable storage media, for training a neural network to control a real-world agent interacting with a real-world environment to cause the real-world agent to perform a particular task. One of the methods includes training the neural network to determine first values of the parameters by optimizing a first task-specific objective that measures a performance of the policy neural network in controlling a simulated version of the real-world agent; obtaining real-world data generated from interactions of the real-world agent with the real-world environment; and training the neural network to determine trained values of the parameters from the first values of the parameters by jointly optimizing (i) a self-supervised objective that measures at least a performance of internal representations generated by the neural network on a self-supervised task performed on the real-world data and (ii) a second task-specific objective.

Claims (52)

1 . A method of selecting an action from a set of actions to be performed in response to each context in a sequence of contexts, the method comprising:

maintaining data specifying a respective gated linear network corresponding to each action of the set of actions, wherein each gated linear network is configured to predict a probability that a reward will be received if the corresponding action is performed in response to an input context, and wherein each gated linear network comprises a plurality of layers, each layer comprising one or more neurons, wherein each neuron in each layer after the first layer is configured to receive (i) the input context and (ii) predictions from neurons in a previous layer and to (iii) apply a gating function to the input context to select a weight vector and (iv) generate as output a geometric mixture of the predictions from the neurons in the previous layer based on the selected weight vector;

for each context in the sequence of contexts:

for each action, processing the context using the gated linear network corresponding to the action to generate a predicted probability;

for each action, generating an action score for the action from at least the predicted probability, comprising:

computing a pseudo-count for the action, wherein computing the pseudo-count comprises determining an overlap between (i) a signature of the context across the gating functions of the neurons in the gated linear network for the action and (ii) signatures of any earlier contexts in the sequence for which the action was selected as the action to be performed in response to the earlier context, wherein the signature of the context characterizes outputs of the gating functions of the neurons in the gated linear network corresponding to the action generated by processing the context; and

generating the action score from the predicted probability for the action and the pseudo-count for the action; and

selecting the action to be performed in response to the context based on the action scores.

2 . The method of claim 1 , wherein selecting the action to be performed in response to the context based on the action scores comprises selecting the action with a highest action score.

3 . The method of claim 1 , further comprising:

for each context in the sequence of contexts:

receiving a reward; and

updating the gated linear network for the selected action based on the reward.

4 . The method of claim 3 , wherein updating the gated linear network for the selected action comprises:

updating each neuron in the gated linear network locally based on a neuron-specific loss.

5 . The method of claim 1 , wherein a last layer of the plurality of layers includes only a single neuron, and wherein the predicted probability of the gated linear network is the output of the single neuron.

6 . The method of claim 1 , wherein the neurons in the first layer of the plurality of layers receive the input context and a set of base predictions.

7 . The method of claim 1 , wherein determining the overlap comprises:

determining a count of how many earlier contexts satisfy both (1) the action was selected in response to the earlier context and (2) for each neuron in the gated linear network for the action, the output of the gating function for the neuron for the earlier context is the same as the output of the gating function for the neuron for a current context.

8 . The method of claim 1 , wherein the set of actions are recommendations of content items.

9 . A method of selecting an action from a set of actions to be performed in response to each context in a sequence of contexts, the method comprising:

maintaining data specifying a respective tree of gated linear networks corresponding to each action of the set of actions, wherein each tree of gated linear networks is collectively configured to predict a respective probability for each of a plurality of bins of a range of reward values, wherein the respective probability for each bin represents a likelihood that a reward that falls in the bin will be received if the corresponding action is performed in response to an input context, and wherein each gated linear network comprises a plurality of layers, each layer comprising one or more neurons, wherein each neuron in each layer after the first layer is configured to receive (i) the input context and (ii) predictions from neurons in a previous layer and to (iii) apply a gating function to the input context to select a weight vector and (iv) generate as output a geometric mixture of the predictions from the neurons in the previous layer based on the selected weight vector;

for each context in the sequence of contexts:

for each action, processing the context using the tree of gated linear networks corresponding to the action to generate a respective probability for each of the plurality of bins of the range of reward values;

for each action, generating an action score for the action from at least the respective probabilities, comprising:

computing a pseudo-count for the action, the computing the pseudo-count comprises determining an overlap between (i) a signature of the context across the gating functions of the neurons in the gated linear networks in the tree of gated linear networks for the action and (ii) signatures of the context across the gating functions of the neurons in the gated linear networks in the tree of gated linear networks for any earlier contexts in the sequence for which the action was selected as the action to be performed in response to the earlier context, wherein the signature of a context refers to the outputs of the gating functions of the neurons in the gated linear networks in the tree of gated linear networks for the action generated by processing the context; and

selecting the action to be performed in response to the context based on the action scores.

10 . The method of claim 9 , wherein selecting the action to be performed in response to the context based on the action scores comprises selecting the action with a highest action score.

11 . The method of claim 9 , further comprising: for each context in the sequence of contexts:

receiving a reward; and

updating the tree of gated linear networks for the selected action based on the reward.

12 . The method of claim 11 , wherein updating the tree of gated linear networks for the selected action comprises:

for each neuron on a path to an identified bin through the tree of gated linear networks for the selected action, updating the neuron locally based on a neuron-specific loss.

13 . The method of claim 9 , wherein a last layer of the plurality of layers includes only a single neuron, and wherein the predicted probability of the gated linear network is the output of the single neuron.

14 . The method of claim 9 , wherein the neurons in the first layer of the plurality of layers receive the input context and a set of base predictions.

15 . A system comprising one or more computers and one or more storage devices storing instructions that when executed by one or more computers cause the one or more computers to perform operations for selecting an action from a set of actions to be performed in response to each context in a sequence of contexts, the operations comprising:

maintaining data specifying a respective gated linear network corresponding to each action of the set of actions, wherein each gated linear network is configured to predict a probability that a reward will be received if the corresponding action is performed in response to an input context, and wherein each gated linear network comprises a plurality of layers, each layer comprising one or more neurons, wherein each neuron in each layer after the first layer is configured to receive (i) the input context and (ii) predictions from neurons in a previous layer and to (iii) apply a gating function to the input context to select a weight vector and (iv) generate as output a geometric mixture of the predictions from the neurons in the previous layer based on the selected weight vector;

for each context in the sequence of contexts:

for each action, processing the context using the gated linear network corresponding to the action to generate a predicted probability;

for each action, generating an action score for the action from at least the predicted probability, comprising:

computing a pseudo-count for the action, wherein computing the pseudo-count comprises determining an overlap between (i) a signature of the context across the gating functions of the neurons in the gated linear network for the action and (ii) signatures of any earlier contexts in the sequence for which the action was selected as the action to be performed in response to the earlier context, wherein the signature of the context characterizes outputs of the gating functions of the neurons in the gated linear network corresponding to the action generated by processing the context; and

generating the action score from the predicted probability for the action and the pseudo-count for the action; and

selecting the action to be performed in response to the context based on the action scores.

16 . The system of claim 15 , wherein selecting the action to be performed in response to the context based on the action scores comprises selecting the action with a highest action score.

17 . The system of claim 15 , the operations further comprising:

for each context in the sequence of contexts:

receiving a reward; and

updating the gated linear network for the selected action based on the reward.

18 . The system of claim 17 , wherein updating the gated linear network for the selected action comprises:

updating each neuron in the gated linear network locally based on a neuron-specific loss.

19 . The system of claim 15 , wherein a last layer of the plurality of layers includes only a single neuron, and wherein the predicted probability of the gated linear network is the output of the single neuron.

20 . The system of claim 15 , wherein the neurons in the first layer of the plurality of layers receive the input context and a set of base predictions.

Assignments (2)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jun 6, 2025
From: DEEPMIND TECHNOLOGIES LIMITED
To: GDM HOLDING LLC
Reel/Frame 071498/0210 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Aug 10, 2022
From: SEZENER, EREN; VENESS, JOEL WILLIAM; HUTTER, MARCUS; WANG, JIANAN; BUDDEN, DAVID
To: DEEPMIND TECHNOLOGIES LIMITED
Reel/Frame 060774/0188 →
Continuity (2)
Provisional Application 62912599 · Oct 8, 2019
Related Publication 20230079338A1 · Mar 16, 2023
References Cited (43)
CN 102571570A · 2012 [cited by applicant]
CN 108351982A · 2018 [cited by applicant]
CN 109155005A · 2019 [cited by applicant]
WO WO2019106132 · 2019 [cited by applicant]
WO WO2020152300A1 · 2020 [cited by applicant]
Xu et al., “Application of Binary Neural Networks for Classification”, Nov. 2003, Proceedings of the Second International Conference on Machine Learning and Cybernetics (Year: 2003). [cited by examiner]
Bubeck et al., “Lipschitz Bandits without the Lipschitz Constant”, Jul. 2011, arXiv:1105.5041 (Year: 2011). [cited by examiner]
Vaswani et al., “New Insights into Bootstrapping for Bandits”, May 2018, arXiv:1805.09793 (Year: 2018). [cited by examiner]
Kumar et al., “Hierarchical Multi-Armed Bandits for Discovering Hidden Populations”, Aug. 2019, 2019 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, https://ieeexplore.ieee.org/docu… [cited by examiner]
Minitab, “Introduction to Data Binning”, https://www.minitab.com/en-us/products/spm/user-guides/, archived May 22, 2019 at the Wayback Machine (Year: 2019). [cited by examiner]
Allesiardo et al., “A Neural Networks Committee for the Contextual Bandit Problem,” Lecture Notes in Computer Science, Jan. 2014, 8834:374-381. [cited by applicant]
Auer et al., “Finite-time analysis of the multiarmed bandit problem,” Mach. Learn., May 2002, 47(2-3):235-256. [cited by applicant]
Bellemare et al., “Unifying count-based exploration and intrinsic motivation,” Advances in Neural Information Processing Systems 29, 2016, pp. 1471-1479. [cited by applicant]
Blundell et al., “Weight uncertainty in neural network,” Proceedings of the 32nd International Conference on Machine Learning, Jul. 2015, 37:1613-1622. [cited by applicant]
Charikar et al., “Finding frequent items in data streams,” Proceedings of the 29th International Colloquium on Automata, Languages and Programming, Jan. 1, 2002, pp. 693-703. [cited by applicant]
Charikar, “Similarity estimation techniques from rounding algorithms,” STOC '02: Proceedings of the thiry-fourth annual ACM symposium on Theory of computing, May 2002, pp. 380-388. [cited by applicant]
Chen et al., “Halfspace mass: a maximally robust and efficient data depth method,” Machine Learning, Aug. 5, 2015, 100(2):677-699. [cited by applicant]
Cormode et al., “An improved data stream summary: The count-min sketch and its applications,” J. Algorithms, Apr. 2005, 55(1):58-75. [cited by applicant]
Elmachtoub et al., “A Practical Method for Solving Contextual Bandit Problems Using Decision Trees,” CoRR, Jun. 14, 2017, arxiv.org/abs/1706.04687, 19 pages. [cited by applicant]
Hernandez-Lobato et al., “Black-box alpha divergence minimization,” Proceedings of The 33rd International Conference on Machine Learning, Jun. 2016, 48:1511-1520. [cited by applicant]
International Preliminary Report on Patentability in International Appln. No. PCT/EP2020/078259, dated Apr. 12, 2022, 13 pages. [cited by applicant]
International Search Report and Written Opinion in International Appln. No. PCT/EP2020/078259, dated Feb. 16, 2021, 16 pages. [cited by applicant]
Kocsis et al., “Bandit based monte-carlo planning,” Proceedings of the 17th European Conference on Machine Learning, ECML'06, 2006, pp. 282-293. [cited by applicant]
Lattimore et al., “Nearoptimal PAC bounds for discounted MDPs,”, Theoretical Computer Science, Nov. 13, 2014, 558:125-143. [cited by applicant]
Li et al., “A contextual-bandit approach to personalized news article recommendation,” CoRR, Feb. 28, 2010, arxiv.org/abs/1003.0146, 10 pages. [cited by applicant]
Mandt et al., “A variational analysis of stochastic gradient algorithms,” Proceedings of The 33rd International Conference on Machine Learning, Jun. 22, 2016, 48:354-363. [cited by applicant]
Osband et al., “Deep exploration via bootstrapped DQN,” Advances in Neural Information Processing Systems 29, 2016, pp. 4026-4034. [cited by applicant]
Osband et al., “Randomized prior functions for deep reinforcement learning,” Proceedings of the 32nd International Conference on Neural Information Processing Systems, 2018, pp. 8626-8638. [cited by applicant]
Plappert et al., “Parameter space noise for exploration,” CoRR, Jun. 6, 2017, arxiv.org/abs/1706.01905, 18 pages. [cited by applicant]
Riquelme et al., “Deep bayesian bandits showdown: An empirical comparison of bayesian deep networks for thompson sampling.” CoRR, Feb. 26, 2018, arxiv.org/abs/1802.09127, 27 pages. [cited by applicant]
Russo et al., “Learning to Optimize via Posterior Sampling,” Mathematics of Operations Research, Apr. 23, 2014, 39(4)1221-1243. [cited by applicant]
Snoek et al., “Scalable bayesian optimization using deep neural networks,” Proceedings of the 32nd International Conference on International Conference on Machine Learning, 2015, 37:2171-2180. [cited by applicant]
Srivastava et al., “Dropout: A simple way to prevent neural networks from overfitting,” J. Mach. Learn. Res., Jan. 2014, 15(1):1929-1958. [cited by applicant]
Strehl et al., “An analysis of model-based interval estimation for markov decision processes,” Journal of Computer and System Sciences, Dec. 2008, 74(8):1309-1331. [cited by applicant]
Tang et al., “#Exploration: A study of count-based exploration for deep reinforcement learning,” Proceedings of the 31st International Conference on Neural Information Processing Systems, Dec. 2017, pp. 2750-2759. [cited by applicant]
Veness et al., “Online learning with gated linear networks,” CoRR, Dec. 5, 2017, arxiv.org/abs/1712.01897, 40 pages. [cited by applicant]
Zhao et al., “Evolutionary design of neural network tree—integration of decision tree, neural network and GA,” Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546), May 27-30, 2001, 1:240… [cited by applicant]
Zinkevich, “Online convex programming and generalized infinitesimal gradient ascent,” Proceedings of the Twentieth International Conference (ICML 2003), Aug. 21-24, 2003, pp. 928-936. [cited by applicant]
Office Action in European Appln. No. 20789076.5, mailed on Feb. 14, 2025, 12 pages. [cited by applicant]
Sezener et al., “Online Learning in Contextual Bandits using Gated Linear Networks,” CoRR, Feb. 21, 2020, arXiv:2002.11611v1, 14 pages. [cited by applicant]
Office Action in Chinese Appln. No. 202080070862.5, mailed on May 9, 2025, 46 pages (with English translation). [cited by applicant]
Office Action in Chinese Appln. No. 202080070862.5, mailed on Aug. 27, 2025, 21 pages (with English translation). [cited by applicant]
Veness et al., “Gated Linear Networks,” CoRR, submitted on Sep. 30, 2019, arXiv:1910.01526v1, 12 pages. [cited by applicant]