Triple
T11003402
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Łukasz Kaiser |
E260054
|
entity |
| Predicate | coAuthorOf |
P2389
|
FINISHED |
| Object |
Training Deep Nets with Sublinear Memory Cost
"Training Deep Nets with Sublinear Memory Cost" is a research paper that introduces techniques to drastically reduce the memory required for training deep neural networks, enabling the training of larger models or using limited hardware resources more efficiently.
|
E899038
|
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: Training Deep Nets with Sublinear Memory Cost | Statement: [Łukasz Kaiser, coAuthorOf, Training Deep Nets with Sublinear Memory Cost]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Training Deep Nets with Sublinear Memory Cost Context triple: [Łukasz Kaiser, coAuthorOf, Training Deep Nets with Sublinear Memory Cost]
-
A.
Large-Scale Distributed Deep Networks
Large-Scale Distributed Deep Networks is a seminal research work that introduced methods for training deep neural networks efficiently across large-scale distributed computing infrastructure, enabling breakthroughs in modern large-scale AI systems.
-
B.
“A fast learning algorithm for deep belief nets”
“A fast learning algorithm for deep belief nets” is a seminal 2006 paper by Geoffrey Hinton that introduced an efficient unsupervised pretraining method for deep neural networks using stacked restricted Boltzmann machines.
-
C.
“Large-Scale Machine Learning with Stochastic Gradient Descent”
“Large-Scale Machine Learning with Stochastic Gradient Descent” is a widely cited work by Léon Bottou that analyzes and advocates stochastic gradient descent as an efficient optimization method for large-scale machine learning problems.
-
D.
“Stochastic Gradient Descent Tricks”
“Stochastic Gradient Descent Tricks” is a well-known paper by Léon Bottou that surveys practical techniques and heuristics for effectively applying stochastic gradient descent in machine learning.
-
E.
Adam: A Method for Stochastic Optimization
"Adam: A Method for Stochastic Optimization" is a highly influential machine learning paper that introduces the Adam optimizer, a widely used adaptive gradient-based optimization algorithm for training deep neural networks.
- 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: Training Deep Nets with Sublinear Memory Cost Triple: [Łukasz Kaiser, coAuthorOf, Training Deep Nets with Sublinear Memory Cost]
Generated description
"Training Deep Nets with Sublinear Memory Cost" is a research paper that introduces techniques to drastically reduce the memory required for training deep neural networks, enabling the training of larger models or using limited hardware resources more efficiently.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Training Deep Nets with Sublinear Memory Cost Target entity description: "Training Deep Nets with Sublinear Memory Cost" is a research paper that introduces techniques to drastically reduce the memory required for training deep neural networks, enabling the training of larger models or using limited hardware resources more efficiently.
-
A.
Large-Scale Distributed Deep Networks
Large-Scale Distributed Deep Networks is a seminal research work that introduced methods for training deep neural networks efficiently across large-scale distributed computing infrastructure, enabling breakthroughs in modern large-scale AI systems.
-
B.
“A fast learning algorithm for deep belief nets”
“A fast learning algorithm for deep belief nets” is a seminal 2006 paper by Geoffrey Hinton that introduced an efficient unsupervised pretraining method for deep neural networks using stacked restricted Boltzmann machines.
-
C.
“Large-Scale Machine Learning with Stochastic Gradient Descent”
“Large-Scale Machine Learning with Stochastic Gradient Descent” is a widely cited work by Léon Bottou that analyzes and advocates stochastic gradient descent as an efficient optimization method for large-scale machine learning problems.
-
D.
“Stochastic Gradient Descent Tricks”
“Stochastic Gradient Descent Tricks” is a well-known paper by Léon Bottou that surveys practical techniques and heuristics for effectively applying stochastic gradient descent in machine learning.
-
E.
Adam: A Method for Stochastic Optimization
"Adam: A Method for Stochastic Optimization" is a highly influential machine learning paper that introduces the Adam optimizer, a widely used adaptive gradient-based optimization algorithm for training deep neural networks.
- 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_69d6aa8a6a548190a750f944ccdc8064 |
completed | April 8, 2026, 7:20 p.m. |
| NER | Named-entity recognition | batch_69d797546f448190946ee6442d657dc5 |
completed | April 9, 2026, 12:11 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69e3453d181081908cb58a957f4d1295 |
completed | April 18, 2026, 8:47 a.m. |
| NEDg | Description generation | batch_69e35570b0bc8190a939b0c8e3ce8105 |
completed | April 18, 2026, 9:57 a.m. |
| NED2 | Entity disambiguation (via description) | batch_69e359508a388190a16d48a17015e13e |
completed | April 18, 2026, 10:13 a.m. |
Created at: April 8, 2026, 9:25 p.m.