Triple

T1413887
Position Surface form Disambiguated ID Type / Status
Subject John Schulman E31866 entity
Predicate notableWork P4 FINISHED
Object 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.
E163182 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: Generalized Advantage Estimation | Statement: [John Schulman, notableWork, Generalized Advantage Estimation]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Generalized Advantage Estimation
Context triple: [John Schulman, notableWork, Generalized Advantage Estimation]
  • A. 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.
  • B. Atari deep Q-network
    The Atari deep Q-network is a pioneering deep reinforcement learning system that learned to play a wide range of Atari 2600 video games directly from raw pixels at human-level or better performance.
  • C. Prioritized Experience Replay DQN
    Prioritized Experience Replay DQN is a variant of the Deep Q-Network algorithm that improves learning efficiency by sampling more informative experiences with higher priority from the replay buffer.
  • D. Hindsight Experience Replay
    Hindsight Experience Replay is a reinforcement learning technique that improves sample efficiency by reinterpreting failed attempts as successful experiences toward alternative goals.
  • E. DDPG
    DDPG (Deep Deterministic Policy Gradient) is a model-free, off-policy deep reinforcement learning algorithm designed for continuous action spaces, combining ideas from DQN and actor-critic methods.
  • 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: Generalized Advantage Estimation
Triple: [John Schulman, notableWork, Generalized Advantage Estimation]
Generated description
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.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07
Target entity: Generalized Advantage Estimation
Target entity description: 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.
  • A. 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.
  • B. Atari deep Q-network
    The Atari deep Q-network is a pioneering deep reinforcement learning system that learned to play a wide range of Atari 2600 video games directly from raw pixels at human-level or better performance.
  • C. Prioritized Experience Replay DQN
    Prioritized Experience Replay DQN is a variant of the Deep Q-Network algorithm that improves learning efficiency by sampling more informative experiences with higher priority from the replay buffer.
  • D. Hindsight Experience Replay
    Hindsight Experience Replay is a reinforcement learning technique that improves sample efficiency by reinterpreting failed attempts as successful experiences toward alternative goals.
  • E. DDPG
    DDPG (Deep Deterministic Policy Gradient) is a model-free, off-policy deep reinforcement learning algorithm designed for continuous action spaces, combining ideas from DQN and actor-critic methods.
  • 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_69a49919a994819086528951bc224775 completed March 1, 2026, 7:52 p.m.
NER Named-entity recognition batch_69a4c3e476f08190aed1576805c62462 completed March 1, 2026, 10:55 p.m.
NED1 Entity disambiguation (via context triple) batch_69ad015cdc8881908887aa0fb0838145 completed March 8, 2026, 4:55 a.m.
NEDg Description generation batch_69ad01d1c01c81908917c4837ed2b393 completed March 8, 2026, 4:57 a.m.
NED2 Entity disambiguation (via description) batch_69ad0265f610819085a2dd293abd4812 completed March 8, 2026, 5 a.m.
Created at: March 1, 2026, 7:59 p.m.