From Predictive to Prescriptive Analytics

References

• Arya S, Mount DM, Netanyahu NS, Silverman R, Wu A (1998) An optimal algorithm for approximate nearest neighbor searching in fixed dimensions. J. ACM 45(6):891–923.Crossref, Google Scholar
• Asur S, Huberman B (2010) Predicting the future with social media. Proc. 2010 IEEE/WIC/ACM Internat. Conf. Web Intelligence Intelligent Agent Tech., vol. 1 (IEEE, Washington, DC), 492–499.Crossref, Google Scholar
• Ban G-Y, Rudin C (2018) The big data newsvendor: Practical insights from machine learning. Oper. Res. 67(1):90–108.Link, Google Scholar
• Bartlett P, Mendelson S (2003) Rademacher and Gaussian complexities: Risk bounds and structural results. J. Machine Learn. Res. 3(November):463–482.Google Scholar
• Belloni A, Chernozhukov V (2011) ℓ1-penalized quantile regression in high-dimensional sparse models. Ann. Stat. 39(1):82–130.Crossref, Google Scholar
• Ben-Tal A, El Ghaoui L, Nemirovski A (2009) Robust Optimization (Princeton University, Princeton, NJ).Crossref, Google Scholar
• Bentley J (1975) Multidimensional binary search trees used for associative searching. Commun. ACM 18(9):509–517.Crossref, Google Scholar
• Berger JO (1985) Statistical Decision Theory and Bayesian Analysis (Springer, New York).Crossref, Google Scholar
• Bertsekas DP (1995) Dynamic Programming and Optimal Control (Athena Scientific, Belmont, MA).Google Scholar
• Bertsimas D, Kallus N (2016) The power and limits of predictive approaches to observational-data-driven optimization. Preprint, submitted May 8, https://arxiv.org/abs/1605.02347.Google Scholar
• Bertsimas D, Gupta V, Kallus N (2018a) Data-driven robust optimization. Math. Programming 167(2):235–292.Crossref, Google Scholar
• Bertsimas D, Gupta V, Kallus N (2018b) Robust sample average approximation. Math. Programming 171(1–2):217–282.Crossref, Google Scholar
• Besbes O, Zeevi A (2009) Dynamic pricing without knowing the demand function: Risk bounds and near-optimal algorithms. Oper. Res. 57(6):1407–1420.Link, Google Scholar
• Birge JR, Louveaux F (2011) Introduction to Stochastic Programming (Springer, New York).Crossref, Google Scholar
• Breiman L (2001) Random forests. Mach. Learn. 45(1):5–32.Crossref, Google Scholar
• Breiman L, Friedman J, Stone C, Olshen R (1984) Classification and Regression Trees (CRC Press, New York).Google Scholar
• Cameron AC, Trivedi PK (2005) Microeconometrics (Cambridge University, Cambridge, UK).Crossref, Google Scholar
• Choi H, Varian H (2012) Predicting the present with Google Trends. Econom. Rec. 88(s1):2–9.Crossref, Google Scholar
• Cleveland WS, Devlin SJ (1988) Locally weighted regression: An approach to regression analysis by local fitting. J. Amer. Statist. Assoc. 83(403):596–610.Crossref, Google Scholar
• Da Z, Engelberg J, Gao P (2011) In search of attention. J. Finance 66(5):1461–1499.Crossref, Google Scholar
• Delage E, Ye Y (2010) Distributionally robust optimization under moment uncertainty with application to data-driven problems. Oper. Res. 55(3):98–112.Google Scholar
• Devroye LP, Wagner TJ (1980) On the L1 convergence of kernel estimators of regression functions with applications in discrimination. Probab. Theory Related Fields 51(1):15–25.Google Scholar
• Geer SA (2000) Empirical Processes in M-estimation (Cambridge University, Cambridge, UK).Google Scholar
• Goel S, Hofman J, Lahaie S, Pennock D, Watts D (2010) Predicting consumer behavior with web search. Proc. Natl. Acad. Sci. USA 107(41):17486–17490.Crossref, Google Scholar
• Gruhl D, Guha R, Kumar R, Novak J, Tomkins A (2005) The predictive power of online chatter. Proc. 11th ACM SIGKDD Internat. Conf. Knowledge Discovery Data Mining (ACM, New York), 78–87.Google Scholar
• Hanasusanto GA, Kuhn D (2013) Robust data-driven dynamic programming. Burges CJC, Bottou L, Welling M, Ghahramani Z, Weinberger KQ, eds. Adv. Neural Inform. Proc. Systems 26 (Curran Associates, Red Hook, NY), 827–835.Google Scholar
• Hannah L, Powell W, Blei DM (2010) Nonparametric density estimation for stochastic optimization with an observable state variable. Lafferty JD, Williams CKI, Shawe-Taylor J, Zemel RS, Culotta A, eds. Adv. Neural Inform. Proc. Systems 23 (Curran Associates, Red Hook, NY), 820–828.Google Scholar
• Hansen BE (2008) Uniform convergence rates for kernel estimation with dependent data. Econometric Theory 24(3):726–748.Crossref, Google Scholar
• Huh WT, Levi R, Rusmevichientong P, Orlin JB (2011) Adaptive data-driven inventory control with censored demand based on Kaplan-Meier estimator. Oper. Res. 59(4):929–941.Link, Google Scholar
• Imbens GW, Rubin DB (2015) Causal Inference in Statistics, Social, and Biomedical Sciences (Cambridge University, Cambridge, UK).Crossref, Google Scholar
• Kallus N (2014) Predicting crowd behavior with big public data. Proc. 23rd Internat. Conf. on World Wide Web (WWW) Companion (ACM, New York), 625–630.Crossref, Google Scholar
• Kao Y-h, Roy BV, Yan X (2009) Directed regression. Bengio Y, Schuurmans D, Lafferty JD, Williams CKI, Culotta A, eds. Adv. Neural Inform. Proc. Systems 22 (Curran Associates, New York), 889–897.Google Scholar
• Kaplan EL, Meier P (1958) Nonparametric estimation from incomplete observations. J. Amer. Statist. Assoc. 53(282):457–481.Crossref, Google Scholar
• Kleywegt A, Shapiro A, Homem-de Mello T (2002) The sample average approximation method for stochastic discrete optimization. SIAM J. Optim. 12(2):479–502.Crossref, Google Scholar
• Lai TL, Robbins H (1985) Asymptotically efficient adaptive allocation rules. Adv. Appl. Math. 6(1):4–22.Crossref, Google Scholar
• Lehmann EL, Casella G (1998) Theory of Point Estimation (Springer, New York).Google Scholar
• Mohri M, Rostamizadeh A, Talwalkar A (2012) Foundations of Machine Learning (MIT, Cambridge, MA).Google Scholar
• Nadaraya E (1964) On estimating regression. Theory Probab. Appl. 9(1):141–142.Crossref, Google Scholar
• Nemirovski A, Juditsky A, Lan G, Shapiro A (2009) Robust stochastic approximation approach to stochastic programming. SIAM J. Optim. 19(4):1574–1609.Crossref, Google Scholar
• Parzen E (1962) On estimation of a probability density function and mode. Ann. Math. Statist. 33(3):1065–1076.Crossref, Google Scholar
• Robbins H (1952) Some aspects of the sequential design of experiments. Bull. Amer. Math. Soc. 58(5):527–535.Crossref, Google Scholar
• Robbins H, Monro S (1951) A stochastic approximation method. Ann. Math. Statist. 22(3):400–407.Crossref, Google Scholar
• Rosenbaum PR, Rubin DB (1983) The central role of the propensity score in observational studies for causal effects. Biometrika 70(1):41–55.Crossref, Google Scholar
• Shapiro A (2003) Monte Carlo sampling methods. Ruszczynski A, Shapiro A, eds. Handbooks in Operations Research and Management Science, vol. 10 (Amsterdam, Elsevier), 353–425.Google Scholar
• Shapiro A, Nemirovski A (2005) On complexity of stochastic programming problems. Jeyakumar V, Rubinov A, eds. Continuous Optimization: Current Trends and Modern Applications (Springer, New York), 111–146.Crossref, Google Scholar
• Tibshirani R (1996) Regression shrinkage and selection via the lasso. J. Royal Statist. Soc. Ser. B. Methodological 58(1):267–288.Crossref, Google Scholar
• Trevor H, Robert T, Friedman J (2001) The Elements of Statistical Learning (Springer, New York).Google Scholar
• Vapnik V (1992) Principles of risk minimization for learning theory. Moody JE, Hanson SJ, Lippmann RP, eds. Adv. Neural Inform. Proc. Systems 4 (Curran Associates, Red Hook, NY), 831–838. Google Scholar
• Wald A (1949) Statistical decision functions. Ann. Math. Statist. 20(2):165–205.Crossref, Google Scholar
• Walk H (2010) Strong laws of large numbers and nonparametric estimation. Korn R, Karasözen B, Kohler M, Devroye L, eds. Recent Developments in Applied Probability and Statistics (Springer, New York), 183–214.Crossref, Google Scholar
• Watson G (1964) Smooth regression analysis. Sankhyā: Indian J. Statist., Ser. A 26(4):359–372.Google Scholar