Efficient Learning for Clustering and Optimizing Context-Dependent Designs

References

• Allesiardo R, Féraud R, Bouneffouf D (2014) A neural networks committee for the contextual bandit problem. Internat. Conf. Neural Inform. Processing (Springer, New York), 374–381.Google Scholar
• Arora N, Dreze X, Ghose A, Hess JD, Iyengar R, Jing B, Joshi Y, et al. (2008) Putting one-to-one marketing to work: Personalization, customization, and choice. Marketing Lett. 19(3):305–321.Crossref, Google Scholar
• Auer P (2000) Using upper confidence bounds for online learning. Proc. 41st Annual Sympos. Foundation Comput. Sci. (IEEE Computer Society, Washington, DC), 270–293.Google Scholar
• Ben-Tal A, El Ghaoui L, Nemirovski A (2009) Robust Optimization, vol. 28 (Princeton University Press, Princeton, NJ).Crossref, Google Scholar
• Bertsekas DP (1995) Dynamic Programming and Optimal Control, vol. 1 (Athena Scientific, Belmont, MA).Google Scholar
• Bertsimas D, Brown DB, Caramanis C (2011) Theory and applications of robust optimization. SIAM Rev. 53(3):464–501.Crossref, Google Scholar
• Bertsimas D, Kallus N, Weinstein AM, Zhuo YD (2017) Personalized diabetes management using electronic medical records. Diabetes Care 40(2):210–217.Crossref, Google Scholar
• Bubeck S, Cesa-Bianchi N (2012) Regret analysis of stochastic and nonstochastic multi-armed bandit problems. Foundations Trends Machine Learn. 5(1):1–122.Google Scholar
• Chen CH, Chick SE, Lee LH, Pujowidianto NA (2015) Ranking and selection: Efficient simulation budget allocation. Fu MC, ed. Handbook of Simulation Optimization, International Series in Operations Research & Management Science (Springer, Berlin), 45–80.Crossref, Google Scholar
• Chen CH, Lin J, Yücesan E, Chick SE (2000) Simulation budget allocation for further enhancing the efficiency of ordinal optimization. Discrete Event Dynam. Systems 10(3):251–270.Crossref, Google Scholar
• Cheng Y (1995) Mean shift, mode seeking, and clustering. IEEE Trans. Pattern Anal. Machine Intelligence 17(8):790–799.Crossref, Google Scholar
• Chick SE, Frazier P (2012) Sequential sampling with economics of selection procedures. Management Sci. 58(3):550–569.Link, Google Scholar
• Choi SE, Perzan KE, Tramontano AC, Kong CY, Hur C (2014) Statins and aspirin for chemoprevention in Barrett’s esophagus: Results of a cost-effectiveness analysis. Cancer Prevention Res. 7(3):341–350.Crossref, Google Scholar
• Dempster AP, Laird NM, Rubin DB (1977) Maximum likelihood from incomplete data via the EM algorithm. J. Roy. Statist. Soc. Series B Methodological 39(1):1–22.Google Scholar
• Ester M, Kriegel HP, Sander J, Xu X (1996) A density-based algorithm for discovering clusters in large spatial databases with noise. Proc. Second Internat. Conf. Knowledge Discovery Data Mining (AAAI Press, Menlo Park, CA), 96:226–231.Google Scholar
• Faloon M, Scherer B (2017) Individualization of robo-advice. J. Wealth Management 20(1):30–36.Crossref, Google Scholar
• Fan W, Hong LJ, Zhang X (2020) Distributionally robust selection of the best. Management Sci. 66(1):190–208.Link, Google Scholar
• Féraud R, Allesiardo R, Urvoy T, Clérot F (2016) Random forest for the contextual bandit problem. Proc. 19th Internat. Conf. Artificial Intelligence Statist. (JMLR.org), 51:93–101.Google Scholar
• Foster S, Mohler-Kuo M, Tay L, Hothorn T, Seibold H (2019) Estimating patient-specific treatment advantages in the ‘treatment for adolescents with depression study.’ J. Psychiatric Res. 112(2019):61–70.Crossref, Google Scholar
• Fraley C, Raftery AE (2002) Model-based clustering, discriminant analysis, and density estimation. J. Amer. Statist. Assoc. 97(458):611–631.Crossref, Google Scholar
• Gao S, Chen W, Shi L (2017a) A new budget allocation framework for the expected opportunity cost. Oper. Res. 65(3):787–803.Link, Google Scholar
• Gao S, Du J, Chen CH (2019) Selecting the optimal system design under covariates. Proc. 15th IEEE Internat. Conf. Automation Sci. Engrg. (IEEE Press, New York), 547–552.Google Scholar
• Gao S, Xiao H, Zhou E, Chen W (2017b) Robust ranking and selection with optimal computing budget allocation. Automatica J. IFAC 81:30–36.Crossref, Google Scholar
• Ghosh S, Lam H (2019) Robust analysis in stochastic simulation: Computation and performance guarantees. Oper. Res. 67(1):232–249.Link, Google Scholar
• Glasserman P, Xu X (2014) Robust risk measurement and model risk. Quant. Finance 14(1):29–58.Crossref, Google Scholar
• Glynn P, Juneja S (2004) A large deviations perspective on ordinal optimization. Ingalls RG, Rossetti MD, Smith JS, Peters BA, eds. Proc. 36th Conf. Winter Simulation (IEEE, Piscataway, NJ), 577–585.Google Scholar
• Han Y, Zhou Z, Zhou Z, Blanchet J, Glynn PW, Ye Y (2020) Sequential batch learning in finite-action linear contextual bandits. Preprint, submitted April 14, https://arxiv.org/abs/2004.06321.Google Scholar
• Hansson L, Zanchetti A, Carruthers SG, Dahlöf B, Elmfeldt D, Julius S, Ménard J, et al.. (1998) Effects of intensive blood-pressure lowering and low-dose aspirin in patients with hypertension: Principal results of the hypertension optimal treatment (HOT) randomised trial. Lancet 351(9118):1755–1762.Crossref, Google Scholar
• Hartigan JA, Wong MA (1979) Algorithm as 136: A k-means clustering algorithm. J. Roy. Statist. Soc. Series C Appl. Statist. 28(1):100–108.Google Scholar
• Hong TP, Song WP, Chiu CT (2011) Evolutionary composite attribute clustering. 2011 Internat. Conf. Tech. Appl. Artificial Intelligence (IEEE Computer Society, Los Alamitos, CA), 305–308.Google Scholar
• Hu Z, Hong LJ (2013) Kullback-Leibler divergence constrained distributionally robust optimization. Preprint, submitted November 23, https://optimization-online.org/?p=12225.Google Scholar
• Hu Z, Hong LJ (2015) Robust simulation of stochastic systems with input uncertainties modeled by statistical divergences. Working paper, Tongji University, Shanghai, China.Google Scholar
• Hu Z, Cao J, Hong LJ (2012) Robust simulation of global warming policies using the dice model. Management Sci. 58(12):2190–2206.Link, Google Scholar
• Hur C, Nishioka NS, Gazelle GS (2004) Cost-effectiveness of aspirin chemoprevention for Barrett’s esophagus. J. National Cancer Inst. 96(4):316–325.Crossref, Google Scholar
• Kazerouni A, Wein LM (2021) Best arm identification in generalized linear bandits. Oper. Res. Lett. 49(3):365–371.Crossref, Google Scholar
• Kim SH, Nelson BL (2001) A fully sequential procedure for indifference-zone selection in simulation. ACM Trans. Model. Comput. Simulation 11(3):251–273.Crossref, Google Scholar
• Kim SH, Nelson BL (2006) Selecting the best system. Handbook Oper. Res. Management Sci. 13:501–534.Google Scholar
• Kim ES, Herbst RS, Wistuba II, Lee JJ, Blumenschein GR, Tsao A, Stewart DJ, et al.. (2011) The BATTLE trial: Personalizing therapy for lung cancer. Cancer Discovery 1(1):44–53.Crossref, Google Scholar
• Lam H (2016) Robust sensitivity analysis for stochastic systems. Math. Oper. Res. 41(4):1248–1275.Link, Google Scholar
• Lam H (2018) Sensitivity to serial dependency of input processes: A robust approach. Management Sci. 64(3):1311–1327.Link, Google Scholar
• Li X, Zhang X, Zheng Z (2018) Data-driven ranking and selection: High-dimensional covariates and general dependence. Proc. 2018 Winter Simulation Conf. (IEEE, Piscataway, NJ), 1933–1944.Google Scholar
• Li H, Lam H, Liang Z, Peng Y (2020) Context-dependent ranking and selection under a Bayesian framework. Proc. 2020 Winter Simulation Conf. (IEEE, Piscataway, NJ).Google Scholar
• Luo J, Hong LJ, Nelson BL, Wu Y (2015) Fully sequential procedures for large-scale ranking-and-selection problems in parallel computing environments. Oper. Res. 63(5):1177–1194.Link, Google Scholar
• Peng Y, Chen CH, Fu MC, Hu JQ (2016) Dynamic sampling allocation and design selection. INFORMS J. Comput. 28(2):195–208.Link, Google Scholar
• Peng Y, Chong EK, Chen CH, Fu MC (2018) Ranking and selection as stochastic control. IEEE Trans. Automatic Control 63(8):2359–2373.Crossref, Google Scholar
• Peng Y, Xu J, Lee LH, Hu JQ, Chen CH (2019) Efficient simulation sampling allocation using multi-fidelity models. IEEE Trans. Automat. Control 64(8):3156–3169.Crossref, Google Scholar
• Perchet V, Rigollet P (2013) The multi-armed bandit problem with covariates. Ann. Statist. 41(2):693–721.Crossref, Google Scholar
• Rigollet P, Zeevi A (2010) Nonparametric bandits with covariates. Preprint, submitted March 8, https://arxiv.org/abs/1003.1630.Google Scholar
• Rinott Y (1978) On two-stage selection procedures and related probability-inequalities. Comm. Statist. Theory Methods 7(8):799–811.Crossref, Google Scholar
• Schütze H, Manning CD, Raghavan P (2008) Introduction to Information Retrieval, vol. 39 (Cambridge University Press, Cambridge, UK).Google Scholar
• Seo M, White IR, Furukawa TA, Imai H, Valgimigli M, Egger M, Zwahlen M, Efthimiou O (2021) Comparing methods for estimating patient-specific treatment effects in individual patient data meta-analysis. Statist. Medicine 40(6):1553–1573.Crossref, Google Scholar
• Shen H, Hong LJ, Zhang X (2021) Ranking and selection with covariates for personalized decision making. INFORMS J. Comput. 33(4):1500–1519.Abstract, Google Scholar
• Sibson R (1973) Slink: An optimally efficient algorithm for the single-link cluster method. Comput. J. 16(1):30–34.Crossref, Google Scholar
• Slivkins A (2014) Contextual bandits with similarity information. J. Machine Learn. Res. 15(1):2533–2568.Google Scholar
• Soare M, Lazaric A, Munos R (2014) Best-arm identification in linear bandits. Adv. Neural Inform. Processing Systems, 828–836.Google Scholar
• Xu L, Honda J, Sugiyama M (2018) A fully adaptive algorithm for pure exploration in linear bandits. Internat. Conf. Artificial Intelligence Statist. (PMLR), 84:843–851.Google Scholar