Triple

T17738638
Position Surface form Disambiguated ID Type / Status
Subject Timothy P. Lillicrap E442790 entity
Predicate coAuthorOf P2389 FINISHED
Object Deterministic policy gradient algorithms
Deterministic policy gradient algorithms are a class of reinforcement learning methods that learn policies with deterministic actions in continuous action spaces by directly optimizing expected returns via gradient-based updates.
E1286306 NE FINISHED

How this triple was built (4 steps)

Every LLM step that produced this triple, in pipeline order — named-entity classification, the disambiguation choices (the exact options shown, with the pick highlighted), and the generated description. The batch + timestamp of each is in the Provenance table below.

NER Named-entity recognition gpt-5-mini
Instruction
Given a phrase, classify it is english named entity (e.g., persons, organizations, works of art) in Latin script, or not (e.g., literals, dates, URLs, verbose phrases). For disambiguation, the statement where the phrase occurs as object is also given. Please return a JSON object with `phrase` (string, the phrase being analyzed) and `is_ne` (boolean, indicating whether the phrase is a Named Entity).
Input
Phrase: Deterministic policy gradient algorithms | Statement: [Timothy P. Lillicrap, coAuthorOf, Deterministic policy gradient algorithms]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Deterministic policy gradient algorithms
Context triple: [Timothy P. Lillicrap, coAuthorOf, Deterministic policy gradient algorithms]
  • A. Natural Policy Gradient
    Natural Policy Gradient is a reinforcement learning optimization method that improves policy gradient updates by accounting for the geometry of the parameter space using the Fisher information matrix, leading to more stable and efficient learning.
  • B. Proximal Policy Optimization
    Proximal Policy Optimization is a popular reinforcement learning algorithm that improves policy gradient methods by using clipped objective functions to achieve stable and efficient training.
  • C. Hindsight Policy Gradients
    Hindsight Policy Gradients is a reinforcement learning algorithm that extends policy gradient methods by retrospectively reinterpreting failed trajectories as successes for alternative goals, improving learning efficiency in sparse-reward environments.
  • D. Deep Q-Learning
    Deep Q-Learning is a reinforcement learning algorithm that uses deep neural networks to approximate Q-values, enabling agents to learn effective policies directly from high-dimensional inputs like raw images.
  • E. Generalized Advantage Estimation
    Generalized Advantage Estimation is a reinforcement learning technique that reduces variance and improves sample efficiency in policy gradient methods by cleverly estimating the advantage function over multiple time scales.
  • F. None of above. chosen
  • G. Unsure - the case is ambiguous/there is not enough information to decide.
NEDg Description generation gpt-5.1
Instruction
Generate a one-sentence description of the target entity. 
You are given a context triple in the form (subject, predicate, object), where the object is the target entity. 
# Instructions
Use the triple to infer relevant information about the entity. Describe the entity based on what is most defining, well-known. 
Avoid repeating the information from the triple, unless really essential.
# Response Format
Return only the sentence: "Description: [one-sentence description of the target entity]"
Input
Entity: Deterministic policy gradient algorithms
Triple: [Timothy P. Lillicrap, coAuthorOf, Deterministic policy gradient algorithms]
Generated description
Deterministic policy gradient algorithms are a class of reinforcement learning methods that learn policies with deterministic actions in continuous action spaces by directly optimizing expected returns via gradient-based updates.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07
Target entity: Deterministic policy gradient algorithms
Target entity description: Deterministic policy gradient algorithms are a class of reinforcement learning methods that learn policies with deterministic actions in continuous action spaces by directly optimizing expected returns via gradient-based updates.
  • A. Natural Policy Gradient
    Natural Policy Gradient is a reinforcement learning optimization method that improves policy gradient updates by accounting for the geometry of the parameter space using the Fisher information matrix, leading to more stable and efficient learning.
  • B. Proximal Policy Optimization
    Proximal Policy Optimization is a popular reinforcement learning algorithm that improves policy gradient methods by using clipped objective functions to achieve stable and efficient training.
  • C. Hindsight Policy Gradients
    Hindsight Policy Gradients is a reinforcement learning algorithm that extends policy gradient methods by retrospectively reinterpreting failed trajectories as successes for alternative goals, improving learning efficiency in sparse-reward environments.
  • D. Deep Q-Learning
    Deep Q-Learning is a reinforcement learning algorithm that uses deep neural networks to approximate Q-values, enabling agents to learn effective policies directly from high-dimensional inputs like raw images.
  • E. Generalized Advantage Estimation
    Generalized Advantage Estimation is a reinforcement learning technique that reduces variance and improves sample efficiency in policy gradient methods by cleverly estimating the advantage function over multiple time scales.
  • F. None of above. chosen

Provenance (5 batches)

The batch behind each pipeline step, in order, with when it ran. Timestamps are batch-level — stages were processed in waves, so the object chain (NER → NED1 → NEDg → NED2) reads in order, but predicate / elicitation batches can sit in a different wave.

Step Stage Batch ID Status When
creating Elicitation batch_69d8b9ed3a2081909b2ec0d4dd2f4c37 completed April 10, 2026, 8:50 a.m.
NER Named-entity recognition batch_69e47acb05848190a4b7edb98f15b8c6 completed April 19, 2026, 6:48 a.m.
NED1 Entity disambiguation (via context triple) batch_6a02efb0cb1881909065885ae936d82f completed May 12, 2026, 9:15 a.m.
NEDg Description generation batch_6a02f033da3081908124079eedc3a5c7 completed May 12, 2026, 9:17 a.m.
NED2 Entity disambiguation (via description) batch_6a02f103b3c8819097dda16ec3dfa84e completed May 12, 2026, 9:21 a.m.
Created at: April 10, 2026, 10:09 a.m.