Triple

T22819712
Position Surface form Disambiguated ID Type / Status
Subject AdaGrad E565192 entity
Predicate describedIn P519 FINISHED
Object Adaptive Subgradient Methods for Online Learning and Stochastic Optimization
"Adaptive Subgradient Methods for Online Learning and Stochastic Optimization" is a seminal 2011 machine learning paper by Duchi, Hazan, and Singer that introduced the AdaGrad algorithm, which adapts learning rates per-parameter based on historical gradients for improved online and stochastic optimization.
E1555012 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: Adaptive Subgradient Methods for Online Learning and Stochastic Optimization | Statement: [AdaGrad, describedIn, Adaptive Subgradient Methods for Online Learning and Stochastic Optimization]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Adaptive Subgradient Methods for Online Learning and Stochastic Optimization
Context triple: [AdaGrad, describedIn, Adaptive Subgradient Methods for Online Learning and Stochastic Optimization]
  • A. 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.
  • B. “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.
  • C. “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.
  • D. Information-Theoretic Regret Bounds for Online Nonparametric Regression
    "Information-Theoretic Regret Bounds for Online Nonparametric Regression" is a research paper that develops theoretical performance guarantees for online learning algorithms in nonparametric regression using tools from information theory.
  • E. “The Tradeoffs of Large Scale Learning”
    “The Tradeoffs of Large Scale Learning” is a research work by Léon Bottou that analyzes how to balance computational efficiency, data scale, and statistical performance in large-scale machine learning systems.
  • 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: Adaptive Subgradient Methods for Online Learning and Stochastic Optimization
Triple: [AdaGrad, describedIn, Adaptive Subgradient Methods for Online Learning and Stochastic Optimization]
Generated description
"Adaptive Subgradient Methods for Online Learning and Stochastic Optimization" is a seminal 2011 machine learning paper by Duchi, Hazan, and Singer that introduced the AdaGrad algorithm, which adapts learning rates per-parameter based on historical gradients for improved online and stochastic optimization.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07
Target entity: Adaptive Subgradient Methods for Online Learning and Stochastic Optimization
Target entity description: "Adaptive Subgradient Methods for Online Learning and Stochastic Optimization" is a seminal 2011 machine learning paper by Duchi, Hazan, and Singer that introduced the AdaGrad algorithm, which adapts learning rates per-parameter based on historical gradients for improved online and stochastic optimization.
  • A. 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.
  • B. “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.
  • C. “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.
  • D. Information-Theoretic Regret Bounds for Online Nonparametric Regression
    "Information-Theoretic Regret Bounds for Online Nonparametric Regression" is a research paper that develops theoretical performance guarantees for online learning algorithms in nonparametric regression using tools from information theory.
  • E. “The Tradeoffs of Large Scale Learning”
    “The Tradeoffs of Large Scale Learning” is a research work by Léon Bottou that analyzes how to balance computational efficiency, data scale, and statistical performance in large-scale machine learning systems.
  • 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_69e2458426188190b58b8ab4844fe420 completed April 17, 2026, 2:36 p.m.
NER Named-entity recognition batch_69f17dcf39a88190bec26affc304236d completed April 29, 2026, 3:41 a.m.
NED1 Entity disambiguation (via context triple) batch_6a0b9ea869348190b4c8edc9f8b5dbc3 completed May 18, 2026, 11:20 p.m.
NEDg Description generation batch_6a0b9f9c46988190baeb6f4e1ec2a419 completed May 18, 2026, 11:24 p.m.
NED2 Entity disambiguation (via description) batch_6a0ba068def08190b22058cf5bd76b4f completed May 18, 2026, 11:27 p.m.
Created at: April 17, 2026, 3:33 p.m.