Search Results for author:
Found 2 papers, 0 papers with code
Be Greedy in Multi-Armed Bandits
On the other hand, this heuristic performs reasonably well in practice and it even has sublinear, and even near-optimal, regret bounds in some very specific linear contextual and Bayesian bandit models.
Lifelong Learning in Multi-Armed Bandits
Continuously learning and leveraging the knowledge accumulated from prior tasks in order to improve future performance is a long standing machine learning problem.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
