Top-Two Thompson Sampling for Contextual Selection Problems

We aim to efficiently allocate a fixed simulation budget to identify the best designs for each context among a finite number of contexts. The performance of each design in a context is measured by an identifiable statistical characteristic, possibly with the existence of nuisance parameters. In a Bayesian framework, we extend the top-two Thompson sampling method designed for selecting the best design in a single context to the contextual 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 establish a posterior large deviations principle for the focal model, characterizing the exponential convergence rate of the posterior distribution for a broad range of identifiable sampling distribution families. The proposed sampling policy is then proved to be consistent and asymptotically satisfies a necessary and sufficient condition for optimality. We also discuss extending the proposed sampling policy to solve the contextual top-[Formula: see text] problems and show that a necessary condition for optimality is asymptotically attained. Numerical experiments demonstrate the good finite-sample performance of the proposed sampling policy. Funding: This work was supported in part by the National Natural Science Foundation of China (NSFC) [Grants 72250065, 72022001, 71901003, 72325007, and 72501012], the China Postdoctoral Science Foundation [Grants 2025T180219 and 2025M770795], and the China Scholarship Council [Grant CSC202206010152]. This work was also supported in part by the Xiangjiang Laboratory Key Project [Grant 23XJ02004] and the Science and Technology Innovation Program of Hunan Province [Grant 2024RC7003]. Supplemental Material: The online appendix is available at https://doi.org/10.1287/moor.2023.0198 .

Authors

Institutions

Publication Details

Journal
Mathematics of Operations Research
Published
2026-07-17
DOI
https://doi.org/10.1287/moor.2023.0198
Primary Topic
Markov Chains and Monte Carlo Methods
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Top-Two Thompson Sampling for Contextual Selection Problems

Yijie Peng, Gongbo Zhang, Xinbo Shi
Mathematics of Operations Research
Markov Chains and Monte Carlo Methods
article

Top-Two Thompson Sampling for Contextual Selection Problems

Yijie Peng, Gongbo Zhang, Xinbo Shi
article en

Abstract

We aim to efficiently allocate a fixed simulation budget to identify the best designs for each context among a finite number of contexts. The performance of each design in a context is measured by an identifiable statistical characteristic, possibly with the existence of nuisance parameters. In a Bayesian framework, we extend the top-two Thompson sampling method designed for selecting the best design in a single context to the contextual 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 establish a posterior large deviations principle for the focal model, characterizing the exponential convergence rate of the posterior distribution for a broad range of identifiable sampling distribution families. The proposed sampling policy is then proved to be consistent and asymptotically satisfies a necessary and sufficient condition for optimality. We also discuss extending the proposed sampling policy to solve the contextual top-[Formula: see text] problems and show that a necessary condition for optimality is asymptotically attained. Numerical experiments demonstrate the good finite-sample performance of the proposed sampling policy. Funding: This work was supported in part by the National Natural Science Foundation of China (NSFC) [Grants 72250065, 72022001, 71901003, 72325007, and 72501012], the China Postdoctoral Science Foundation [Grants 2025T180219 and 2025M770795], and the China Scholarship Council [Grant CSC202206010152]. This work was also supported in part by the Xiangjiang Laboratory Key Project [Grant 23XJ02004] and the Science and Technology Innovation Program of Hunan Province [Grant 2024RC7003]. Supplemental Material: The online appendix is available at https://doi.org/10.1287/moor.2023.0198 .

Mathematics of Operations Research
Peking University (CN), Wuhan University (CN), Beihang University (CN)
Industry, innovation and infrastructure
Openalex Percentile: Top 6%
Markov Chains and Monte Carlo Methods
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.