Search
Skip to Search Results
Filter
Author / Creator / Contributor
Subject / Keyword
- 2Online Learning
- 1Adaptive Optimization
- 1Asynchronous Optimization
- 1Cross-Validation
- 1Delay-Tolerant Optimization
- 1Delayed Feedback
Year
Collections
Languages
Item type
Departments
-
Fall 2012
In this thesis, the multi-armed bandit (MAB) problem in online learning is studied, when the feedback information is not observed immediately but rather after arbitrary, unknown, random delays. In the stochastic" setting when the rewards come from a fixed distribution, an algorithm is given that...
-
Fall 2019
We study three problems in the application, design, and analysis of online optimization algorithms for machine learning. First, we consider speeding-up the common task of k-fold cross-validation of online algorithms, and provide TreeCV, an algorithm that reduces the time penalty of k-fold...
1 - 2 of 2