Triple

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).

Phrase: Adaptive Subgradient Methods for Online Learning and Stochastic Optimization | Statement: [AdaGrad, describedIn, Adaptive Subgradient Methods for Online Learning and Stochastic Optimization]

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.

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