Triple

T8482932
Position Surface form Disambiguated ID Type / Status
Subject Martin Riedmiller E200561 entity
Predicate notableWork P4 FINISHED
Object neural fitted Q-iteration (NFQ)
Neural Fitted Q-Iteration (NFQ) is a reinforcement learning algorithm that uses neural networks to approximate the Q-function from batches of experience, enabling efficient learning in continuous and high-dimensional state spaces.
E736830 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: neural fitted Q-iteration (NFQ) | Statement: [Martin Riedmiller, notableWork, neural fitted Q-iteration (NFQ)]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: neural fitted Q-iteration (NFQ)
Context triple: [Martin Riedmiller, notableWork, neural fitted Q-iteration (NFQ)]
  • A. 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.
  • 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. Q-learning
    Q-learning is a model-free reinforcement learning algorithm that learns an action-value function to optimize decision-making by estimating the expected cumulative reward for each state-action pair.
  • D. 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.
  • E. 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.
  • 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: neural fitted Q-iteration (NFQ)
Triple: [Martin Riedmiller, notableWork, neural fitted Q-iteration (NFQ)]
Generated description
Neural Fitted Q-Iteration (NFQ) is a reinforcement learning algorithm that uses neural networks to approximate the Q-function from batches of experience, enabling efficient learning in continuous and high-dimensional state spaces.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07
Target entity: neural fitted Q-iteration (NFQ)
Target entity description: Neural Fitted Q-Iteration (NFQ) is a reinforcement learning algorithm that uses neural networks to approximate the Q-function from batches of experience, enabling efficient learning in continuous and high-dimensional state spaces.
  • A. 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.
  • 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. Q-learning
    Q-learning is a model-free reinforcement learning algorithm that learns an action-value function to optimize decision-making by estimating the expected cumulative reward for each state-action pair.
  • D. 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.
  • E. 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.
  • 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_69ca831b17988190a1f3f3413d57b820 completed March 30, 2026, 2:05 p.m.
NER Named-entity recognition batch_69cbe53845e881909eeb32863c7aa942 completed March 31, 2026, 3:16 p.m.
NED1 Entity disambiguation (via context triple) batch_69ce3a2b2e9081909f19712946c6ec20 completed April 2, 2026, 9:43 a.m.
NEDg Description generation batch_69ce3b4008a0819096bb44b46f510213 completed April 2, 2026, 9:47 a.m.
NED2 Entity disambiguation (via description) batch_69ce3c000e608190adf1b6499d382529 completed April 2, 2026, 9:50 a.m.
Created at: March 30, 2026, 6:12 p.m.