Unlock: Online Convex Optimization
A general framework for sequential decision-making with convex losses: online gradient descent, follow the regularized leader, adaptive methods, and the square-root-T regret guarantee that unifies many algorithms.
46 Prerequisites0 Mastered0 Working44 Gaps
Prerequisite mastery4%
Recommended probe
Borel-Cantelli Lemmas is your weakest prerequisite with available questions. You haven't been assessed on this topic yet.
Not assessed6 questions
Characteristic FunctionsFoundations
Not assessed5 questions
Not assessed19 questions
Not assessed30 questions
Matrix NormsAxioms
Not assessed5 questions
Modes of Convergence of Random VariablesInfrastructure
Not assessed13 questions
Not assessed16 questions
Triangular DistributionAxioms
Not assessed4 questions
Not assessed5 questions
Convex Optimization BasicsFoundations
Not assessed32 questions
No-Regret LearningAdvanced
Not assessed5 questions
Sign in to track your mastery and see personalized gap analysis.