A Personalized Choice beside a Plan-Improvement Probability

Authors

  • Daniel Collins Author
  • Julian Foster Author
  • Liam Hayes Author

Abstract

Patient-specific treatment selection and radiation planning can share contexts while retaining distinct terminal events. Evaluation should state the profile and baseline used for each comparison and independently check numerical recommendations. A planning probability is not a measured treatment benefit, and a contextual policy's average success can conceal an unresolved sparse-profile decision. This focused synthesis develops an empirical comparison that preserves the terminal action, observation process, and total verification cost. Its proposed tests are prospective; no new simulation run, model-training result, or intervention effect is reported.

References

  1. J. Du, S. Gao, and C.-H. Chen, “A Contextual Ranking and Selection Method for Personalized Medicine,” Manufacturing & Service Operations Management, vol. 26, no. 1, pp. 167–181, 2024.
  2. S. Gao, X. Zhang, and L. Shi, “Evaluation of Improvement Probability for IMRT Plans,” Proceedings of the 2013 IEEE International Conference on Automation Science and Engineering, pp. 474–479, 2013.
  3. Ankenman, Bruce, Barry L. Nelson, and Jeremy Staum. “Stochastic Kriging for Simulation Metamodeling.” Operations Research, vol. 58, no. 2, 2010, pp. 371–382. https://doi.org/10.1287/opre.1090.0754.
  4. Kim, Seong-Hee, and Barry L. Nelson. “A Fully Sequential Procedure for Indifference-Zone Selection in Simulation.” ACM Transactions on Modeling and Computer Simulation, vol. 11, no. 3, 2001, pp. 251–273. https://doi.org/10.1145/502109.502111.
  5. Chick, Stephen E., and Koichiro Inoue. “New Two-Stage and Sequential Procedures for Selecting the Best Simulated System.” Operations Research, vol. 49, no. 5, 2001, pp. 732–743. https://doi.org/10.1287/opre.49.5.732.10615.
  6. Frazier, Peter I., Warren B. Powell, and Savas Dayanik. “A Knowledge-Gradient Policy for Sequential Information Collection.” SIAM Journal on Control and Optimization, vol. 47, no. 5, 2008, pp. 2410–2439. https://doi.org/10.1137/070693424.
  7. Rasmussen, Carl Edward, and Christopher K. I. Williams. Gaussian Processes for Machine Learning. MIT Press, 2006. https://gaussianprocess.org/gpml/.
  8. Sacks, Jerome, William J. Welch, Toby J. Mitchell, and Henry P. Wynn. “Design and Analysis of Computer Experiments.” Statistical Science, vol. 4, no. 4, 1989, pp. 409–423. https://doi.org/10.1214/ss/1177012413.
  9. Bertsimas, Dimitris, and Melvyn Sim. “The Price of Robustness.” Operations Research, vol. 52, no. 1, 2004, pp. 35–53. https://doi.org/10.1287/opre.1030.0065.
  10. Campi, Marco C., and Simone Garatti. “The Exact Feasibility of Randomized Solutions of Uncertain Convex Programs.” SIAM Journal on Optimization, vol. 19, no. 3, 2008, pp. 1211–1230. https://doi.org/10.1137/07069821X.

Downloads

Published

2025-12-02