{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,20]],"date-time":"2025-12-20T22:05:13Z","timestamp":1766268313038,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":28,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,8,4]],"date-time":"2023-08-04T00:00:00Z","timestamp":1691107200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,8,6]]},"DOI":"10.1145\/3580305.3599474","type":"proceedings-article","created":{"date-parts":[[2023,8,4]],"date-time":"2023-08-04T18:10:58Z","timestamp":1691172658000},"page":"711-721","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Prescriptive PCA: Dimensionality Reduction for Two-stage Stochastic Optimization"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9951-7450","authenticated-orcid":false,"given":"Long","family":"He","sequence":"first","affiliation":[{"name":"George Washington University, Washington, DC, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4289-8029","authenticated-orcid":false,"given":"Ho-Yin","family":"Mak","sequence":"additional","affiliation":[{"name":"Georgetown University, Washington, DC, USA"}]}],"member":"320","published-online":{"date-parts":[[2023,8,4]]},"reference":[{"doi-asserted-by":"publisher","key":"e_1_3_2_2_1_1","DOI":"10.1287\/msom.2018.0725"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_2_1","DOI":"10.1287\/opre.2018.1757"},{"key":"e_1_3_2_2_3_1","volume-title":"Adjustable robust solutions of uncertain linear programs. Mathematical programming","author":"Ben-Tal Aharon","year":"2004","unstructured":"Aharon Ben-Tal , Alexander Goryashko , Elana Guslitzer , and Arkadi Nemirovski . 2004. Adjustable robust solutions of uncertain linear programs. Mathematical programming , Vol. 99 , 2 ( 2004 ), 351--376. Aharon Ben-Tal, Alexander Goryashko, Elana Guslitzer, and Arkadi Nemirovski. 2004. Adjustable robust solutions of uncertain linear programs. Mathematical programming, Vol. 99, 2 (2004), 351--376."},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_4_1","DOI":"10.5555\/3122009.3122038"},{"key":"e_1_3_2_2_5_1","first-page":"1","article-title":"Solving large-scale sparse PCA to certifiable (near) optimality","volume":"23","author":"Bertsimas Dimitris","year":"2022","unstructured":"Dimitris Bertsimas , Ryan Cory-Wright , and Jean Pauphilet . 2022 . Solving large-scale sparse PCA to certifiable (near) optimality . Journal of Machine Learning Research , Vol. 23 , 13 (2022), 1 -- 35 . Dimitris Bertsimas, Ryan Cory-Wright, and Jean Pauphilet. 2022. Solving large-scale sparse PCA to certifiable (near) optimality. Journal of Machine Learning Research, Vol. 23, 13 (2022), 1--35.","journal-title":"Journal of Machine Learning Research"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_6_1","DOI":"10.1287\/moor.1100.0444"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_7_1","DOI":"10.1287\/mnsc.2018.3253"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_8_1","DOI":"10.1287\/mnsc.2017.2952"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_9_1","DOI":"10.1287\/opre.1070.0457"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_10_1","DOI":"10.1287\/opre.1080.0605"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_11_1","DOI":"10.1002\/9781118032343"},{"key":"e_1_3_2_2_12_1","article-title":"Optimal Solutions for Sparse Principal Component Analysis","volume":"9","author":"Aspremont Alexandre","year":"2008","unstructured":"Alexandre d' Aspremont , Francis Bach , and Laurent El Ghaoui . 2008 . Optimal Solutions for Sparse Principal Component Analysis . Journal of Machine Learning Research , Vol. 9 , 7 (2008). Alexandre d'Aspremont, Francis Bach, and Laurent El Ghaoui. 2008. Optimal Solutions for Sparse Principal Component Analysis. Journal of Machine Learning Research, Vol. 9, 7 (2008).","journal-title":"Journal of Machine Learning Research"},{"key":"e_1_3_2_2_13_1","volume-title":"Michael Jordan, and Gert Lanckriet.","author":"Aspremont Alexandre","year":"2004","unstructured":"Alexandre d' Aspremont , Laurent El Ghaoui , Michael Jordan, and Gert Lanckriet. 2004 . A direct formulation for sparse PCA using semidefinite programming. Advances in neural information processing systems, Vol. 17 (2004). Alexandre d'Aspremont, Laurent El Ghaoui, Michael Jordan, and Gert Lanckriet. 2004. A direct formulation for sparse PCA using semidefinite programming. Advances in neural information processing systems, Vol. 17 (2004)."},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_14_1","DOI":"10.1007\/BF02288367"},{"key":"e_1_3_2_2_15_1","volume-title":"Generalization bounds in the predict-then-optimize framework. Advances in neural information processing systems","author":"Balghiti Othman El","year":"2019","unstructured":"Othman El Balghiti , Adam N Elmachtoub , Paul Grigas , and Ambuj Tewari . 2019. Generalization bounds in the predict-then-optimize framework. Advances in neural information processing systems , Vol. 32 ( 2019 ). Othman El Balghiti, Adam N Elmachtoub, Paul Grigas, and Ambuj Tewari. 2019. Generalization bounds in the predict-then-optimize framework. Advances in neural information processing systems, Vol. 32 (2019)."},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_16_1","DOI":"10.1287\/mnsc.2020.3922"},{"key":"e_1_3_2_2_17_1","volume-title":"Bin Hong Alex Lee, and David Simchi-Levi","author":"Ferreira Kris Johnson","year":"2016","unstructured":"Kris Johnson Ferreira , Bin Hong Alex Lee, and David Simchi-Levi . 2016 . Analytics for an online retailer: Demand forecasting and price optimization. Manufacturing & service operations management, Vol. 18 , 1 (2016), 69--88. Kris Johnson Ferreira, Bin Hong Alex Lee, and David Simchi-Levi. 2016. Analytics for an online retailer: Demand forecasting and price optimization. Manufacturing & service operations management, Vol. 18, 1 (2016), 69--88."},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_18_1","DOI":"10.1287\/msom.2018.0759"},{"key":"e_1_3_2_2_19_1","volume-title":"Distributionally robust optimization and its tractable approximations. Operations research","author":"Goh Joel","year":"2010","unstructured":"Joel Goh and Melvyn Sim . 2010. Distributionally robust optimization and its tractable approximations. Operations research , Vol. 58 , 4-part-1 ( 2010 ), 902--917. Joel Goh and Melvyn Sim. 2010. Distributionally robust optimization and its tractable approximations. Operations research, Vol. 58, 4-part-1 (2010), 902--917."},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_20_1","DOI":"10.1007\/s10107-015-0958-2"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_21_1","DOI":"10.1111\/poms.13143"},{"key":"e_1_3_2_2_22_1","volume-title":"Learning a factor model via regularized PCA. Machine learning","author":"Kao Yi-Hao","year":"2013","unstructured":"Yi-Hao Kao and Benjamin Van Roy . 2013. Learning a factor model via regularized PCA. Machine learning , Vol. 91 , 3 ( 2013 ), 279--303. Yi-Hao Kao and Benjamin Van Roy. 2013. Learning a factor model via regularized PCA. Machine learning, Vol. 91, 3 (2013), 279--303."},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_23_1","DOI":"10.1287\/mnsc.2019.3366"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_24_1","DOI":"10.1007\/s10107-009-0331-4"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_25_1","DOI":"10.1007\/s10107-016-1019-1"},{"key":"e_1_3_2_2_26_1","volume-title":"Chung Piaw Teo, and Zhichao Zheng","author":"Natarajan Karthik","year":"2011","unstructured":"Karthik Natarajan , Chung Piaw Teo, and Zhichao Zheng . 2011 . Mixed 0--1 linear programs under objective uncertainty: A completely positive representation. Operations research, Vol. 59 , 3 (2011), 713--728. Karthik Natarajan, Chung Piaw Teo, and Zhichao Zheng. 2011. Mixed 0--1 linear programs under objective uncertainty: A completely positive representation. Operations research, Vol. 59, 3 (2011), 713--728."},{"key":"e_1_3_2_2_27_1","volume-title":"Robust approximation to multiperiod inventory management. Operations research","author":"Sim Melvyn","year":"2010","unstructured":"Chuen-Teck See and Melvyn Sim . 2010. Robust approximation to multiperiod inventory management. Operations research , Vol. 58 , 3 ( 2010 ), 583--594. Chuen-Teck See and Melvyn Sim. 2010. Robust approximation to multiperiod inventory management. Operations research, Vol. 58, 3 (2010), 583--594."},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_28_1","DOI":"10.1287\/opre.2017.1714"}],"event":{"sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"],"acronym":"KDD '23","name":"KDD '23: The 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining","location":"Long Beach CA USA"},"container-title":["Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3580305.3599474","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3580305.3599474","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:37:37Z","timestamp":1750178257000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3580305.3599474"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8,4]]},"references-count":28,"alternative-id":["10.1145\/3580305.3599474","10.1145\/3580305"],"URL":"https:\/\/doi.org\/10.1145\/3580305.3599474","relation":{},"subject":[],"published":{"date-parts":[[2023,8,4]]},"assertion":[{"value":"2023-08-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}