[KongchangAI]
ConceptOnline Gradient Descent

Online Gradient Descent

A classic algorithm in online convex optimization. At each round it updates the decision along the gradient direction of the current loss function and has theoretical regret guarantees.

Timeline (last 90 days)

Oct 21

Algorithms such as online gradient descent can guarantee O(√T) regret under convex or approximately convex assumptions.

Unverified50%

All Facts (1)

Source Articles