Triple
T18300685
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Tianshou |
E438349
|
entity |
| Predicate | supportsAlgorithm |
P203
|
FINISHED |
| Object | QR-DQN |
—
|
NE NERFINISHED |
How this triple was built (3 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: QR-DQN | Statement: [Tianshou, supportsAlgorithm, QR-DQN]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: QR-DQN Context triple: [Tianshou, supportsAlgorithm, QR-DQN]
-
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.
Rainbow DQN
Rainbow DQN is a deep reinforcement learning algorithm that combines several key extensions to the original DQN—such as double Q-learning, prioritized replay, dueling networks, multi-step learning, distributional RL, and noisy nets—into a single, more performant agent.
-
C.
Double DQN
Double DQN is a reinforcement learning algorithm that improves upon standard Deep Q-Networks by reducing overestimation bias through decoupling action selection from action evaluation.
-
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.
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.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: QR-DQN Target entity description: QR-DQN is a distributional deep reinforcement learning algorithm that models the full return distribution using quantile regression to improve stability and performance over standard DQN.
-
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.
Rainbow DQN
Rainbow DQN is a deep reinforcement learning algorithm that combines several key extensions to the original DQN—such as double Q-learning, prioritized replay, dueling networks, multi-step learning, distributional RL, and noisy nets—into a single, more performant agent.
-
C.
Double DQN
Double DQN is a reinforcement learning algorithm that improves upon standard Deep Q-Networks by reducing overestimation bias through decoupling action selection from action evaluation.
-
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.
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 (2 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. |
Created at: April 10, 2026, 10:35 a.m.