Top-Two Thompson Sampling for Contextual Top-mc Selection Problems

06/30/2023
by   Xinbo Shi, et al.
0

We aim to efficiently allocate a fixed simulation budget to identify the top-mc designs for each context among a finite number of contexts. The performance of each design under a context is measured by an identifiable statistical characteristic, possibly with the existence of nuisance parameters. Under a Bayesian framework, we extend the top-two Thompson sampling method designed for selecting the best design in a single context to the contextual top-mc selection problems, leading to an efficient sampling policy that simultaneously allocates simulation samples to both contexts and designs. To demonstrate the asymptotic optimality of the proposed sampling policy, we characterize the exponential convergence rate of the posterior distribution for a wide range of identifiable sampling distribution families. The proposed sampling policy is proved to be consistent, and asymptotically satisfies a necessary condition for optimality. In particular, when selecting contextual best designs (i.e., mc = 1), the proposed sampling policy is proved to be asymptotically optimal. Numerical experiments demonstrate the good finite sample performance of the proposed sampling policy.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/06/2023

Efficient Learning for Selecting Top-m Context-Dependent Designs

We consider a simulation optimization problem for a context-dependent de...
research
12/10/2020

Efficient Learning for Clustering and Optimizing Context-Dependent Designs

We consider a simulation optimization problem for a context-dependent de...
research
11/27/2022

Convergence Rate Analysis for Optimal Computing Budget Allocation Algorithms

Ordinal optimization (OO) is a widely-studied technique for optimizing d...
research
04/24/2019

Efficient Simulation Budget Allocation for Subset Selection Using Regression Metamodels

This research considers the ranking and selection (R&S) problem of selec...
research
05/12/2023

Efficient Dynamic Allocation Policy for Robust Ranking and Selection under Stochastic Control Framework

This research considers the ranking and selection with input uncertainty...
research
01/09/2022

Selecting the Best Optimizing System

We formulate selecting the best optimizing system (SBOS) problems and pr...
research
11/27/2022

Asymptotic Optimality of Myopic Ranking and Selection Procedures

Ranking and selection (R S) is a popular model for studying discrete-e...

Please sign up or login with your details

Forgot password? Click here to reset