Online Learning with Vector Costs and Bandits with Knapsacks.
Thomas KesselheimSahil SinglaPublished in: CoRR (2020)
Keyphrases
- online learning
- knapsack problem
- online course
- computer mediated
- regret bounds
- e learning
- higher education
- distance education
- blended learning
- distance learning
- sparse matrix
- multi armed bandits
- stochastic systems
- online learning environment
- online education
- vector data
- expected cost
- online algorithms
- vector space
- feature vectors
- feature extraction