Triple

T4293678
Position Surface form Disambiguated ID Type / Status
Subject A3C E99656 entity
Predicate introducedInPaper P513 FINISHED
Object Asynchronous Methods for Deep Reinforcement Learning
"Asynchronous Methods for Deep Reinforcement Learning" is a 2016 DeepMind paper that introduced asynchronous parallel training techniques for deep reinforcement learning, most notably the A3C algorithm, enabling more stable and efficient learning without specialized hardware.
E428322 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: Asynchronous Methods for Deep Reinforcement Learning | Statement: [A3C, introducedInPaper, Asynchronous Methods for Deep Reinforcement Learning]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Asynchronous Methods for Deep Reinforcement Learning
Context triple: [A3C, introducedInPaper, Asynchronous Methods for Deep Reinforcement Learning]
  • 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. Dueling DQN
    Dueling DQN is a deep reinforcement learning algorithm that separates state-value and advantage estimations within its neural network architecture to improve learning efficiency and stability over standard DQN.
  • D. 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.
  • 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: Asynchronous Methods for Deep Reinforcement Learning
Triple: [A3C, introducedInPaper, Asynchronous Methods for Deep Reinforcement Learning]
Generated description
"Asynchronous Methods for Deep Reinforcement Learning" is a 2016 DeepMind paper that introduced asynchronous parallel training techniques for deep reinforcement learning, most notably the A3C algorithm, enabling more stable and efficient learning without specialized hardware.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07
Target entity: Asynchronous Methods for Deep Reinforcement Learning
Target entity description: "Asynchronous Methods for Deep Reinforcement Learning" is a 2016 DeepMind paper that introduced asynchronous parallel training techniques for deep reinforcement learning, most notably the A3C algorithm, enabling more stable and efficient learning without specialized hardware.
  • 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. Dueling DQN
    Dueling DQN is a deep reinforcement learning algorithm that separates state-value and advantage estimations within its neural network architecture to improve learning efficiency and stability over standard DQN.
  • D. 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.
  • 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_69b3455175088190aa79c6e03b86647e completed March 12, 2026, 10:59 p.m.
NER Named-entity recognition batch_69b35082228081908504e3fd7c4ca1e8 completed March 12, 2026, 11:47 p.m.
NED1 Entity disambiguation (via context triple) batch_69b5c73d47448190a844bc13eae84a54 completed March 14, 2026, 8:38 p.m.
NEDg Description generation batch_69b5c7d04508819087b14c5c86f1e015 completed March 14, 2026, 8:40 p.m.
NED2 Entity disambiguation (via description) batch_69b5c84ccea08190a8e7e8fa93934ea2 completed March 14, 2026, 8:42 p.m.
Created at: March 12, 2026, 11:08 p.m.