Triple
T17693971
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Yuval Tassa |
E441110
|
entity |
| Predicate | knownFor |
P22
|
FINISHED |
| Object | DDPG algorithm |
E98481
|
NE FINISHED |
How this triple was built (2 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: DDPG algorithm | Statement: [Yuval Tassa, knownFor, DDPG algorithm]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: DDPG algorithm Context triple: [Yuval Tassa, knownFor, DDPG algorithm]
-
A.
DDPG
chosen
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.
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.
-
C.
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.
-
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.
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.
- F. None of above.
- G. Unsure - the case is ambiguous/there is not enough information to decide.
Provenance (3 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_69d8b9e940b081908b862bb0e6e89b0d |
completed | April 10, 2026, 8:50 a.m. |
| NER | Named-entity recognition | batch_69e4715485d88190b9b6f347ff85d7c7 |
completed | April 19, 2026, 6:08 a.m. |
| NED1 | Entity disambiguation (via context triple) | batch_6a0223347be881908f3c227ca7240e61 |
completed | May 11, 2026, 6:43 p.m. |
Created at: April 10, 2026, 10:04 a.m.