Stochastic Online Learning with Feedback Graphs: Finite-Time and Asymptotic Optimality.
Teodor Vanislavov MarinovMehryar MohriJulian ZimmertPublished in: NeurIPS (2022)
Keyphrases
- online learning
- asymptotic optimality
- asymptotically optimal
- sufficient conditions
- discrete random variables
- e learning
- online course
- higher education
- flowshop
- distance education
- relevance feedback
- graph theory
- distance learning
- online algorithms
- decision making
- graph matching
- graph mining
- scheduling problem
- lower bound
- online convex optimization