Efficient Contextual Bandits with Continuous Actions
We create a computationally tractable algorithm for contextual bandits with continuous actions having unknown structure. Our reduction-style algorithm composes with most supervised learning representations. We prove that it works in a general sense and verify the new functionality with large-scale experiments.
Code (1)
Tasks
Multi-Armed BanditsSimilar Papers 제목 키워드 기반
Oracle-Efficient Pessimism: Offline Policy Optimization in Contextual Bandits
We consider offline policy optimization (OPO) in contextual bandits, where one is given a fixed dataset of logged interactions. While pessimistic regularizers are typically used to mitigate distribution shift, prior impl…
Multi-Armed BanditsOnline Continuous Hyperparameter Optimization for Generalized Linear Contextual Bandits
In stochastic contextual bandits, an agent sequentially makes actions from a time-dependent action set based on past experience to minimize the cumulative regret. Like many other machine learning algorithms, the performa…
Hyperparameter OptimizationMulti-Armed BanditsThompson SamplingLocal Metric Learning for Off-Policy Evaluation in Contextual Bandits with Continuous Actions
We consider local kernel metric learning for off-policy evaluation (OPE) of deterministic policies in contextual bandits with continuous action spaces. Our work is motivated by practical scenarios where the target policy…
Metric LearningMulti-Armed BanditsOff-policy evaluationSafety by Design: Realized-Cost Constraints for Contextual Bandits with Continuous Actions
Contextual bandits are a standard framework for sequential decision-making under uncertainty, with applications in clinical trials, dosage selection, recommendation systems, and autonomous systems. Safety is central in m…
Recommendation SystemsAutonomous DrivingContextual Bandits with Continuous Actions: Smoothing, Zooming, and Adapting
We study contextual bandit learning with an abstract policy class and continuous action space. We obtain two qualitatively different regret bounds: one competes with a smoothed version of the policy class under no contin…
Multi-Armed Bandits