Efficient Learning for Selecting Top-m Context-Dependent Designs
Not on the map. Why?
Abstract (arXiv)
We consider a simulation optimization problem for a context-dependent decision-making, which aims to determine the top-m designs for all contexts. Under a Bayesian framework, we formulate the optimal dynamic sampling decision as a stochastic dynamic programming problem, and develop a sequential sampling policy to efficiently learn the performance of each design under each context. The asymptotically optimal sampling ratios are derived to attain the optimal large deviations rate of the worst-case of probability of false selection. The proposed sampling policy is proved to be consistent and its asymptotic sampling ratios are asymptotically optimal. Numerical experiments demonstrate that the proposed method improves the efficiency for selection of top-m context-dependent designs.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 15 of its 63 references that are in the map. First posted on arXiv 6 May 2023.
Builds on
15 of 63 references.
References · 15
- 2019Contextual Bandits with Continuous Actions: Smoothing, Zooming, and Adaptingcited by 42
- 2017Nearly Instance Optimal Sample Complexity Bounds for Top-k Arm Selectioncited by 28
- 2020Review on Ranking and Selection: A New Perspectivecited by 28
- 2014A Neural Networks Committee for the Contextual Bandit Problemcited by 23
- 2015Random Forest for the Contextual Bandit Problem - extended versioncited by 11
- 2021Top-m identification for linear banditscited by 11
- 2017Ranking and Selection with Covariates for Personalized Decision Makingcited by 10
- 2017Ranking and Selection as Stochastic Controlcited by 9
- 2016Sensitivity to Serial Dependency of Input Processes: A Robust Approachcited by 6
- 2019Distributionally Robust Selection of the Bestcited by 5
- 2019Knowledge Gradient for Selection with Covariates: Consistency and Computationcited by 4
- 2020Efficient Learning for Clustering and Optimizing Context-Dependent Designscited by 4
3 more
Built on by
Not cited yet.