WRSWorld Research StateContribute
WORLD RESEARCH STATE

Adaptive online gradients: data-dependent proximal geometry and conditioning

Contribution grade

Adaptive online convex optimization · Human-designed research method or resource

Reference score300,000Provisional editorial estimate of this exact contribution; its grade is assessed separately.

What changed

Developed data-dependent diagonal/full-matrix proximal or conditioning schemes from accumulated gradients, with complementary Adagrad and adaptive-bound formulations improving instance-dependent online regret.

Scientific scope

Developed data-dependent diagonal/full-matrix proximal or conditioning schemes from accumulated gradients, with complementary Adagrad and adaptive-bound formulations improving instance-dependent online regret. Bundles independent2010McMahan/Streeter and2010preliminary/2011Duchi/Hazan/Singer contributions with source-specific author sets, not a fictitious five-author paper or identical algorithms. Competitive/regret statements restrict convex losses, feasible geometry, comparators and gradient assumptions; not global nonconvex deep-learning convergence or minimax improvement without structure.

Evidence

The linked original sources describe the stated contribution and its evidence limits. WRS has not independently rerun the experiments or certified a proof. Bundles independent2010McMahan/Streeter and2010preliminary/2011Duchi/Hazan/Singer contributions with source-specific author sets, not a fictitious five-author paper or identical algorithms. Competitive/regret statements restrict convex losses, feasible geometry, comparators and gradient assumptions; not global nonconvex deep-learning convergence or minimax improvement without structure.

Contributors

Provisional WRS assessment, edition 2026-10-16.1. Independent expert calibration is pending. This grade does not certify correctness or assign ownership.

Full scientific record · Browse contribution grades · Request a correction