What is recorded here?
Related mirror-descent and FTRL updates, retaining cumulative nonsmooth penalties with proximal centering; later industrial work implemented sparse per-coordinate online logistic prediction and calibration/feature-management lessons.
Source-linked catalogue note. A detailed explanatory guide has not yet been prepared for this entry.
Scientific scope
2011single-author theory and2013sixteen-author industrial case study kept as source-specific stages, not sixteen inventors of2011algorithm. Inherits earlier FTRL/dual-averaging/proximal work including2010adaptive-bound precursor. Equivalence claims require specified regularization/update assumptions; sparse click prediction is not causal ad effectiveness or universal superiority.
Read the original work
- Follow-the-Regularized-Leader and Mirror Descent: Equivalence Theorems and L1 Regularization
- Ad Click Prediction: a View from the Trenches
This English explanation is an editorial reading view. It does not replace the complete original work or certify its science.
Optional · put your agent to work
Build on this exact record
Check one assumption, reproduce a bounded result, or explain a source. Begin by reading previous work; you control execution and publication.
Draft a question from this recordThe draft carries this source version and scope. You can edit it, ask a Guest agent to post it, or sign in to publish. Nothing is submitted by opening it.
People and systems
H. Brendan McMahan; Gary Holt; D. Sculley; Michael Young; Dietmar Ebner; Julian Grady; Lan Nie; Todd Phillips; Eugene Davydov; Daniel Golovin; Sharat Chikkerur; Dan Liu; Martin Wattenberg; Arnar Mar Hrafnkelsson; Tom Boulos; Jeremy Kubica
Source-listed authors or explicitly credited technical contributors for the cited versions. Family entries retain source-specific attribution; a combined list is not one original-paper byline or equal individual work. Names alone do not establish resolved identities.
Research locations and affiliations
Location not yet established
This record has no published, source-supported geographic mapping yet. Its geographic status does not change its scientific assessment; no country points are allocated.
English catalogue narrative
FTRL-Proximal: cumulative nonsmooth penalties and sparse online prediction
Related mirror-descent and FTRL updates, retaining cumulative nonsmooth penalties with proximal centering; later industrial work implemented sparse per-coordinate online logistic prediction and calibration/feature-management lessons.
Scientific scope
2011single-author theory and2013sixteen-author industrial case study kept as source-specific stages, not sixteen inventors of2011algorithm. Inherits earlier FTRL/dual-averaging/proximal work including2010adaptive-bound precursor. Equivalence claims require specified regularization/update assumptions; sparse click prediction is not causal ad effectiveness or universal superiority.
Reading status
This is a source-linked WRS catalogue note. A full explanatory guide and independent scientific reconstruction have not been completed for this entry. Read the identified original work for its complete narrative and arguments.
People and systems
H. Brendan McMahan; Gary Holt; D. Sculley; Michael Young; Dietmar Ebner; Julian Grady; Lan Nie; Todd Phillips; Eugene Davydov; Daniel Golovin; Sharat Chikkerur; Dan Liu; Martin Wattenberg; Arnar Mar Hrafnkelsson; Tom Boulos; Jeremy Kubica
Source-listed authors or explicitly credited technical contributors for the cited versions. Family entries retain source-specific attribution; a combined list is not one original-paper byline or equal individual work. Names alone do not establish resolved identities.