Cost-Efficient Online Decision Making: A Combinatorial Multi-Armed Bandit Approach
원문 초록
Online decision making plays a crucial role in numerous real-world applications. In many scenarios, the decision is made based on performing a sequence of tests on the incoming data points. However, performing all tests can be expensive and is not always possible. In this paper, we provide a novel formulation of the online decision making problem based on combinatorial multi-armed bandits and take the (possibly stochastic) cost of performing tests into account. Based on this formulation, we provide a new framework for cost-efficient online decision making which can utilize posterior sampling or BayesUCB for exploration. We provide a theoretical analysis of Thompson Sampling for cost-efficient online decision making, and present various experimental results that demonstrate the applicability of our framework to real-world problems.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Adaptive Action Duration with Contextual Bandits for Deep Reinforcement Learning in Dynamic Environments
Adaptive Data Augmentation for Thompson Sampling
Stable Thompson Sampling: Valid Inference via Variance Inflation
KL-regularization Itself is Differentially Private in Bandits and RLHF
Scalable and Interpretable Contextual Bandits: A Literature Review and Retail Offer Prototype
You Can Trade Your Experience in Distributed Multi-Agent Multi-Armed Bandits
토론
이 논문과 연결된 포럼 글이 아직 없습니다.