Triple

T18300746
Position Surface form Disambiguated ID Type / Status
Subject MPE (Multi-Agent Particle Environments) E438350 entity
Predicate associatedAlgorithm P25130 FINISHED
Object MADDPG
MADDPG (Multi-Agent Deep Deterministic Policy Gradient) is a reinforcement learning algorithm that extends DDPG to multi-agent settings by using centralized training with decentralized execution for cooperative and competitive tasks.
E1317487 NE FINISHED

How this triple was built (5 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: MADDPG | Statement: [MPE (Multi-Agent Particle Environments), associatedAlgorithm, MADDPG]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: MADDPG
Context triple: [MPE (Multi-Agent Particle Environments), associatedAlgorithm, MADDPG]
  • A. 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.
  • B. MPE (Multi-Agent Particle Environments)
    MPE (Multi-Agent Particle Environments) is a classic collection of lightweight 2D multi-agent reinforcement learning benchmark environments featuring simple particle-based agents and tasks like cooperation, competition, and communication.
  • C. Asynchronous Advantage Actor-Critic
    Asynchronous Advantage Actor-Critic is a deep reinforcement learning algorithm that trains multiple parallel agents to learn both policy and value functions efficiently and stably.
  • D. IMPALA: Scalable Distributed Deep-RL with Importance Weighted Actor-Learner Architectures
    "IMPALA: Scalable Distributed Deep-RL with Importance Weighted Actor-Learner Architectures" is a research paper that introduces a highly scalable distributed reinforcement learning framework using an actor-learner architecture with importance weighting to enable efficient off-policy learning.
  • E. 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.
  • 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: MADDPG
Triple: [MPE (Multi-Agent Particle Environments), associatedAlgorithm, MADDPG]
Generated description
MADDPG (Multi-Agent Deep Deterministic Policy Gradient) is a reinforcement learning algorithm that extends DDPG to multi-agent settings by using centralized training with decentralized execution for cooperative and competitive tasks.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07
Target entity: MADDPG
Target entity description: MADDPG (Multi-Agent Deep Deterministic Policy Gradient) is a reinforcement learning algorithm that extends DDPG to multi-agent settings by using centralized training with decentralized execution for cooperative and competitive tasks.
  • A. 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.
  • B. MPE (Multi-Agent Particle Environments)
    MPE (Multi-Agent Particle Environments) is a classic collection of lightweight 2D multi-agent reinforcement learning benchmark environments featuring simple particle-based agents and tasks like cooperation, competition, and communication.
  • C. Asynchronous Advantage Actor-Critic
    Asynchronous Advantage Actor-Critic is a deep reinforcement learning algorithm that trains multiple parallel agents to learn both policy and value functions efficiently and stably.
  • D. IMPALA: Scalable Distributed Deep-RL with Importance Weighted Actor-Learner Architectures
    "IMPALA: Scalable Distributed Deep-RL with Importance Weighted Actor-Learner Architectures" is a research paper that introduces a highly scalable distributed reinforcement learning framework using an actor-learner architecture with importance weighting to enable efficient off-policy learning.
  • E. 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.
  • F. None of above. chosen
PD Predicate disambiguation gpt-5-mini-2025-08-07
Target predicate: associatedAlgorithm
Context triple: [MPE (Multi-Agent Particle Environments), associatedAlgorithm, MADDPG]
  • A. relatedAlgorithm chosen
    Indicates that one algorithm has a meaningful connection or association with another algorithm, such as similarity, dependency, or complementary function.
  • B. algorithmType
    Indicates the specific kind or category of algorithm associated with an entity or process.
  • C. algorithmFamily
    Indicates that one algorithm belongs to, or is categorized under, a broader family or class of related algorithms.
  • D. algorithmVariant
    Indicates that one algorithm is a variant or modified version of another algorithm.
  • E. hasAlgorithmNamedAfter
    Indicates that an entity has an algorithm that is named after another entity.
  • F. None of above.

Provenance (6 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_69d8b915e3e881909125d760c15d0c29 completed April 10, 2026, 8:47 a.m.
NER Named-entity recognition batch_69e5017f63dc819083a675d570620f2f completed April 19, 2026, 4:23 p.m.
NED1 Entity disambiguation (via context triple) batch_6a03bb5e1fb481908a0b98ea130eda71 completed May 12, 2026, 11:44 p.m.
NEDg Description generation batch_6a03bdb3fb3c819095192ac49e809f55 completed May 12, 2026, 11:54 p.m.
NED2 Entity disambiguation (via description) batch_6a03c193a0a08190b33d80d45f3ed0f0 completed May 13, 2026, 12:10 a.m.
PD Predicate disambiguation batch_69e44fdf43d08190bbcfb6b1fe3cc0ee completed April 19, 2026, 3:45 a.m.
Created at: April 10, 2026, 10:35 a.m.