Optimal Learning in Linear Regression with Combinatorial Feature Selection

References

• Benson HY, Sağlam Ü (2013a) Mixed-integer second-order cone programming: A survey. Topaloglu H, ed. INFORMS TutORials in Operations Research (INFORMS, Catonsville, MD), 13–36.Link, Google Scholar
• Benson HY, Sağlam Ü (2013b) Smoothing and regularization for mixed-integer second-order cone programming with applications in portfolio optimization. Zuluaga LF, Terlaky T, eds. Modeling and Optimization—Theory and Applications: Selected Contributions from the MOPTA 2012 Conference (Springer, Berlin), 87–111.Crossref, Google Scholar
• Bertsimas D, O’Hair A, Relyea S, Silberholz J (2016) An analytics approach to designing combination chemotherapy regimens for cancer. Management Sci. 62(5):1511–1531.Link, Google Scholar
• Brantley MW, Lee LH, Chen C-H, Chen A (2013) Efficient simulation budget allocation with regression. IIE Trans. 45(3):291–308.Crossref, Google Scholar
• Brantley MW, Lee LH, Chen C-H, Xu J (2014) An efficient simulation budget allocation method incorporating regression for partitioned domains. Automatica 50(5):1391–1400.Crossref, Google Scholar
• Chen C-H, Lee LH (2010) Stochastic Simulation Optimization: An Optimal Computing Budget Allocation (World Scientific, Singapore).Crossref, Google Scholar
• Chen C-H, 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
• Chen KD, Hausman WH (2000) Technical note: Mathematical properties of the optimal product line selection problem using choice-based conjoint analysis. Management Sci. 46(2):327–332.Link, Google Scholar
• Chick SE (2006) Subjective probability and Bayesian methodology. Henderson SG, Nelson BL, eds. Simulation, Handbooks of Operations Research and Management Science, Vol. 13 (Elsevier, North-Holland), 225–258.Crossref, Google Scholar
• Chick SE, Branke J, Schmidt C (2010) Sequential sampling to myopically maximize the expected value of information. INFORMS J. Comput. 22(1):71–80.Link, Google Scholar
• Çinlar E (2011) Probability and Stochastics (Springer-Verlag, New York).Crossref, Google Scholar
• Cohn DA, Ghahramani Z, Jordan MI (1996) Active learning with statistical models. J. Artificial Intelligence Res. 4(1):129–145.Crossref, Google Scholar
• Dani V, Hayes TP, Kakade SM (2008) Stochastic linear optimization under bandit feedback. Proc. 21st Annual Conf. Learn. Theory, Helsinki, Finland, 355–366.Google Scholar
• Defourny B, Ryzhov IO, Powell WB (2015) Optimal information blending with measurements in the L2 sphere. Math. Oper. Res. 40(4):1060–1088.Link, Google Scholar
• Dette H (1997) Designing experiments with respect to “standardized” optimality criteria. J. Roy. Statist. Soc. B59(1):97–110.Crossref, Google Scholar
• Falk A (2007) Gift exchange in the field. Econometrica 75(5):1501–1511.Crossref, Google Scholar
• Fan J, Han F, Liu H (2014) Challenges of big data analysis. National Sci. Rev. 1(2):293–314.Crossref, Google Scholar
• Frazier PI, Powell WB, Dayanik S (2008) A knowledge gradient policy for sequential information collection. SIAM J. Control Optim. 47(5):2410–2439.Crossref, Google Scholar
• Frazier PI, Powell W, Dayanik S (2009) The knowledge-gradient policy for correlated normal beliefs. INFORMS J. Comput. 21(4):599–613.Link, Google Scholar
• Fu MC, Hu J-Q, Chen C-H, Xiong X (2007) Simulation allocation for determining the best design in the presence of correlated sampling. INFORMS J. Comput. 19(1):101–111.Link, Google Scholar
• Glazebrook KD, Meissner J, Schurr J (2013) How big should my store be? On the interplay between shelf-space, demand learning and assortment decisions. Submitted for publication.Google Scholar
• Goemans MX, Williamson DP (1995) Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J. ACM 42(6):1115–1145.Crossref, Google Scholar
• Graf S, Luschgy H (2000) Foundations of Quantization for Probability Distributions (Springer-Verlag, Berlin).Crossref, Google Scholar
• Han B, Ryzhov IO, Defourny B (2013) Efficient learning of donor retention strategies for the American Red Cross. Pasupathy R, Kim S-H, Tolk A, Hill R, Kuhl ME, eds. Proc. 2013 Winter Simulation Conf. (IEEE, Piscataway, NJ), 17–28.Crossref, Google Scholar
• Hong LJ, Nelson BL (2009) A brief introduction to optimization via simulation. Rosetti MD, Hill RR, Johansson B, Dunkin A, Ingalls RG, eds. Proc. 2009 Winter Simulation Conf. (IEEE, Piscataway, NJ), 75–85.Crossref, Google Scholar
• Jones DR, Schonlau M, Welch WJ (1998) Efficient global optimization of expensive black-box functions. J. Global Optim. 13(4):455–492.Crossref, Google Scholar
• Karlan D, List JA, Shafir E (2011) Small matches and charitable giving: Evidence from a natural field experiment. J. Public Econom. 95(5):344–350.Crossref, Google Scholar
• Kim S-H (2013) Statistical ranking and selection. Gass SI, Fu MC, eds. Encyclopedia of Operations Research and Management Science (Springer, Berlin), 1459–1469.Crossref, Google Scholar
• Kim S-H, Nelson BL (2006) Selecting the best system. Henderson SG, Nelson BL, eds. Simulation, Handbooks of Operations Research and Management Science, Vol. 13 (Elsevier, North-Holland), 501–534.Crossref, Google Scholar
• Kim S-H, Nelson BL (2007) Recent advances in ranking and selection. Henderson SG, Biller B, Hsieh M-H, Shortle J, Tew JD, Barton RR, eds. Proc. 2007 Winter Simulation Conf. (IEEE, Piscataway, NJ), 162–172.Google Scholar
• Landry CE, Lange A, List JA, Price MK, Rupp NG (2006) Toward an understanding of the economics of charity: Evidence from a field experiment. Quart. J. Econom. 121(2):747–782.Crossref, Google Scholar
• Lasserre JB (2002) An explicit equivalent positive semidefinite program for nonlinear 0-1 programs. SIAM J. Optim. 12(3):756–769.Crossref, Google Scholar
• Laurent M, Rendl F (2005) Semidefinite programming and integer programming. Aardal K, Nemhauser GL, Weismantel R, eds. Discrete Optimization, Handbooks in Operations Research and Management Science, Vol. 12 (Elsevier, Amsterdam), 393–514.Crossref, Google Scholar
• Minka TP (2010) Bayesian linear regression. Technical report, Microsoft Research, Cambridge, UK.Google Scholar
• Modaresi S, Saure D, Vielma JP (2013) Learning in combinatorial optimization: What and how to explore. Submitted for publication.Google Scholar
• Montgomery DC (2009) Design and Analysis of Experiments, 7th ed. (John Wiley & Sons, Hoboken, NJ).Google Scholar
• Negoescu DM, Frazier PI, Powell WB (2011) The knowledge-gradient algorithm for sequencing experiments in drug discovery. INFORMS J. Comput. 23(3):346–363.Link, Google Scholar
• Nemirovski AS, Todd MJ (2008) Interior-point methods for optimization. Acta Numerica 17:191–234.Crossref, Google Scholar
• Norkin VI, Pflug GCh, Ruszczyński A (1998) A branch and bound method for stochastic global optimization. Math. Programming 83(1–3):425–450.Crossref, Google Scholar
• Pages G, Printems J (2003) Optimal quadratic quantization for numerics: The Gaussian case. Monte Carlo Methods Appl. 9(2):135–166.Crossref, Google Scholar
• Porkolab L, Khachiyan L (1997) On the complexity of semidefinite programs. J. Global Optim. 10(4):351–365.Crossref, Google Scholar
• Powell WB (2011) Approximate Dynamic Programming: Solving the Curses of Dimensionality, 2nd ed. (John Wiley & Sons, Hoboken, NJ).Crossref, Google Scholar
• Powell WB, Ryzhov IO (2012) Optimal Learning (John Wiley & Sons, Inc., Hoboken, NJ).Crossref, Google Scholar
• Qu H, Ryzhov IO, Fu MC (2012) Ranking and selection with unknown correlation structures. Laroque C, Himmelspach J, Pasupathy R, Rose O, Uhrmacher AM, eds. Proc. 2012 Winter Simulation Conf. (IEEE, Piscataway, NJ), 144–155.Crossref, Google Scholar
• Rusmevichientong P, Tsitsiklis JN (2010) Linearly parameterized bandits. Math. Oper. Res. 35(2):395–411.Link, Google Scholar
• Russo D, Van Roy B (2014) Learning to optimize via posterior sampling. Math. Oper. Res. 39(4):1221–1243.Link, Google Scholar
• Ryzhov IO, Han B, Bradić J (2016) Cultivating disaster donors using data analytics. Management Sci. 62(3):849–866.Link, Google Scholar
• Sargeant A, Kähler J (1999) Returns on fundraising expenditures in the voluntary sector. Nonprofit Management Leadership 10(1):5–19.Crossref, Google Scholar
• Sargeant A, Jay E, Lee S (2006) Benchmarking charity performance: Returns from direct marketing in fundraising. J. Nonprofit & Public Sector Marketing 16(1–2):77–94.Crossref, Google Scholar
• Wojtaszek DT, Chinneck JW (2010) Faster MIP solutions via new node selection rules. Comput. Oper. Res. 37(9):1544–1556.Crossref, Google Scholar
• Xu WL, Nelson BL (2013) Empirical stochastic branch-and-bound for optimization via simulation. IIE Trans. 45(7):685–698.Crossref, Google Scholar