# US 2025/0209338 A1 · Exploration by bootstrapped prediction

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2025/0209338 A1
- Document ID: US20250209338A1
- Status: Published application
- Kind: A1
- Application number: 18/850,206
- Filed: 2023-05-17
- Published: 2025-06-26
- Earliest claimed: 2022-05-19
- Assignees: DeepMind Technologies Limited
- Applicants: DeepMind Technologies Limited
- Inventors: Zhaohan Guo; Florent Altché; Corentin Tallec; Bernardo Avila Pires; Miruna Pîslar; Shantanu Yogeshraj Thakoor; Mohammad Gheshlaghi Azar; Bilal Piot
- Web page: https://patentgrep.com/patent/US20250209338A1

## CPC

- G06N 3/092: Reinforcement learning
- G06N 3/044: Recurrent networks, e.g. Hopfield networks
- G06N 3/045: Combinations of networks
- G06N: COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS

## Abstract

An iterative method is proposed to train an action selection system of a reinforcement learning system, based on a reward function which defines a reward value for each action. The reward value includes an intrinsic reward term generated based on the outputs of two encoder models: an online encoder model and a target encoder model. The online encoder model is iteratively trained based on a loss function, and the target encoder model is updated to bring it closer to the online encoder model.

## Claims

### Claim 1

A method performed by one or more computers for learning a control policy, the control policy being for generating successive actions at each of corresponding successive time-steps to be performed by an agent interacting with an environment, based on observations characterizing the environment at the respective ones of the time-steps,
the method employing an online encoder model and a target encoder model, which are each operative, upon receiving an observation, to generate an observation-representation, as data in a latent representation space,
wherein the online encoder model, the target encoder model and the control policy are trained by an iterative process of making respective updates to them based on sequences of observations and corresponding actions, at least the online encoder model and the target encoder model being trained jointly,
the iterative process including repeatedly:
updating the online encoder model to reduce a sum over the sequences of a predictive loss value for at least one observation of each sequence, the predictive loss value of each observation being indicative of a discrepancy between a prediction of an observation-representation of the observation and an observation-representation of the observation obtained using one of the encoder models;
updating the target encoder model based on the current state of the online encoder model; and
updating the control policy based on reward values for corresponding actions included in corresponding ones of the sequences, the reward value for each action including an intrinsic reward term which is dependent on a predictive loss value for observations in the corresponding sequence after the action and which is generated using the sequence and the online encoder model.

### Claim 2 (depends on 1)

The method of claim 1, wherein the plurality of sequences of observations and actions are based on a batch of trajectories comprising observations at successive time steps and corresponding actions at the successive time steps, each of the sequences comprising a sequence of observations and actions selected from one of the trajectories.

### Claim 3 (depends on 1)

The method of claim 1, wherein the predictive loss value for each observation is a measure of a difference between a predicted observation-representation of the observation generated using the online encoder model, and an observation-representation of the observation generated by the target encoder model.

### Claim 4 (depends on 3)

The method of claim 3, wherein respective predicted observation-representations of each observation in a given one of the sequences except a first observation of the sequence, are generated by a predictive unit arranged to receive an input based on the observation-representation generated by the online encoder model upon receiving the first observation of the sequence.

### Claim 5 (depends on 4)

The method of claim 4, wherein the predictive unit is jointly trained with the online encoder model and the target encoder model, the updates to the predictive unit being to reduce the sum over the sequences of the respective predictive loss value for each observation of each sequence except the first observation of each sequence.

### Claim 6 (depends on 5)

The method of claim 5, wherein the predictive unit is arranged to generate K predicted observation-representations, where K is an integer greater than one, as successive outputs of a predictor unit of the predictive unit based on respective outputs of an open-loop recurrent cell of the predictive unit,
the open-loop recurrent cell being configured, upon receiving a first input which is based on the observation-representation generated by the online encoder model upon receiving on a first observation of the sequence, and a second input based on the action for the corresponding time step, to generate a first output, and to generate K−1 successive further outputs, each based on the previous output of the open loop recurrent cell and a corresponding action of the sequence.

### Claim 7 (depends on 6)

The method of claim 6, wherein the first input to the open-loop recurrent cell is the output of a closed-loop recurrent cell of the predictive unit, the closed-loop recurrent cell being arranged to receive an observation-representation of the first observation of the sequence generated by the online encoder model, and, except if the first time-step of a sequence is the first time-step of a trajectory, an output of the closed-loop recurrent cell for the previous time-step of the trajectory.

### Claim 8 (depends on 7)

The method of claim 7, wherein except if the first time-step of a sequence is the first time-step of trajectory, the closed-loop recurrent cell is further configured to receive the action from the time step of the trajectory immediately preceding the time step of the first observation in the sequence.

### Claim 9 (depends on 1)

The method of claim 1, wherein the sequences are selected from a batch of trajectories selected from a training database, each trajectory being of length T time steps, labelled by an integer variable t=0, . . . , T−1, and comprising an observation and a corresponding action for each time step, each trajectory of the batch being used to generate, for each value of t from 0 to T−K−1, a corresponding one the sequences, comprising the observation and corresponding action for time t, and K successive observations and K actions at corresponding time steps.

### Claim 10 (depends on 9)

The method of claim 9, wherein each trajectory of the batch is used to generate, for each value of t from T−K to T−2, a corresponding one of the sequences, comprising the observation and corresponding action for time t, and T−t−1 successive observations and T−t−1 actions at corresponding time steps.

### Claim 11 (depends on 1)

The method of claim 1, wherein the intrinsic reward term for an action is based on a prediction loss function which is a sum over a plurality of observations after the action of the predictive loss value for the observations.

### Claim 12 (depends on 11)

The method of claim 11, wherein the prediction loss function is normalized to form the intrinsic reward term using a normalization parameter indicative of the variance of the prediction loss function for a plurality of actions.

### Claim 13 (depends on 11)

The method according to claim 11, further comprising determining whether the intrinsic reward term is below a threshold, and, upon determining that the intrinsic reward term is below the threshold, the intrinsic reward term is reduced.

### Claim 14 (depends on 1)

The method of claim 1, wherein the updates to the target encoder model make the target encoder model closer to the current online encoder model.

### Claim 15 (depends on 14)

The method of claim 14, wherein the target encoder model is an exponential moving average of the online encoder model.

### Claim 16 (depends on 1)

The method of claim 1, wherein the control policy is defined by a policy neural network, the policy neural network comprising an encoder for receiving observations of the environment, the encoder employing the online encoder model to generate an observation-representation of the observations.

### Claim 17 (depends on 16)

The method of claim 16, wherein the policy neural network further comprises a predictive model sharing at least some parameters of the predictive unit.

### Claim 18 (depends on 1)

The method of claim 1, wherein the reward value for each action further includes at least one task reward term associated with a corresponding task, and indicative of a degree to which the action contributes to performance of the corresponding task.

### Claim 19

(canceled)

### Claim 21

A system comprising one or more computers and one or more storage devices storing instructions that when executed by the one or more computers cause the one or more computers to perform operations for learning a control policy, the control policy being for generating successive actions at each of corresponding successive time-steps to be performed by an agent interacting with an environment, based on observations characterizing the environment at the respective ones of the time-steps,
the operations employing an online encoder model and a target encoder model, which are each operative, upon receiving an observation, to generate an observation-representation, as data in a latent representation space,
wherein the online encoder model, the target encoder model and the control policy are trained by an iterative process of making respective updates to them based on sequences of observations and corresponding actions, at least the online encoder model and the target encoder model being trained jointly,
the iterative process including repeatedly:
updating the online encoder model to reduce a sum over the sequences of a predictive loss value for at least one observation of each sequence, the predictive loss value of each observation being indicative of a discrepancy between a prediction of an observation-representation of the observation and an observation-representation of the observation obtained using one of the encoder models;
updating the target encoder model based on the current state of the online encoder model; and
updating the control policy based on reward values for corresponding actions included in corresponding ones of the sequences, the reward value for each action including an intrinsic reward term which is dependent on a predictive loss value for observations in the corresponding sequence after the action and which is generated using the sequence and the online encoder model.

### Claim 22

One or more computer storage media storing instructions that when executed by one or more computers cause the one or more computers to perform operations for learning a control policy, the control policy being for generating successive actions at each of corresponding successive time-steps to be performed by an agent interacting with an environment, based on observations characterizing the environment at the respective ones of the time-steps,
the operations employing an online encoder model and a target encoder model, which are each operative, upon receiving an observation, to generate an observation-representation, as data in a latent representation space,
wherein the online encoder model, the target encoder model and the control policy are trained by an iterative process of making respective updates to them based on sequences of observations and corresponding actions, at least the online encoder model and the target encoder model being trained jointly,
the iterative process including repeatedly:
updating the online encoder model to reduce a sum over the sequences of a predictive loss value for at least one observation of each sequence, the predictive loss value of each observation being indicative of a discrepancy between a prediction of an observation-representation of the observation and an observation-representation of the observation obtained using one of the encoder models;
updating the target encoder model based on the current state of the online encoder model; and
updating the control policy based on reward values for corresponding actions included in corresponding ones of the sequences, the reward value for each action including an intrinsic reward term which is dependent on a predictive loss value for observations in the corresponding sequence after the action and which is generated using the sequence and the online encoder model.
