Fetching the paper…
Reading the bibliography…
We consider the problem of learning an optimal prescriptive tree (i.e., an interpretable treatment assignment policy in the form of a binary tree) of moderate depth, from observational data.
Atamtürk A, Gómez A (2019) Rank-one convexification for sparse regression. arXiv:1901.10334
1901
Earlier work this paper cites.
Olfat M, Aswani A (2018) Spectral algorithms for computing fair support vector machines. International Conference on Artificial Intelligence and Statistics , 1933–1942 (PMLR)
1942
Earlier work this paper cites.
Horvitz DG, Thompson DJ (1952) A generalization of sampling without replacement from a finite universe. Journal of the American statistical Association 47(260):663–685
1952
Earlier work this paper cites.
Rawls J (1974) Some reasons for the maximin criterion. The American Economic Review 64(2):141–146
1974
Earlier work this paper cites.
Dougherty J, Kohavi R, Sahami M (1995) Supervised and unsupervised discretization of continuous features. Machine learning proceedings 1995 , 194–202 (Elsevier)
1995
Earlier work this paper cites.
Zenios SA, Chertow GM, Wein LM (2000) Dynamic allocation of kidneys to candidates on the transplant waiting list. Operations Research 48(4):549–569
2000
Earlier work this paper cites.
Bartle RG (2001) A modern theory of integration , volume 32 (American Mathematical Soc.)
2001
Earlier work this paper cites.
2004
Earlier work this paper cites.
Lunceford JK, Davidian M (2004) Stratification and weighting via the propensity score in estimation of causal treatment effects: a comparative study. Statistics in medicine 23(19):2937–2960
2004
Earlier work this paper cites.
2005
Earlier work this paper cites.
Kotsiantis S, Kanellopoulos D (2006) Discretization techniques: A recent survey. GESTS International Transactions on Computer Science and Engineering 32(1):47–58
2006
Earlier work this paper cites.
Rubin DB (2006) Matched sampling for causal effects (Cambridge University Press), ISBN 8580000722116
2006
Earlier work this paper cites.
2006
Earlier work this paper cites.
Flume PA, O’Sullivan BP, Robinson KA, Goss CH, Mogayzel Jr PJ, Willey-Courand DB, Bujan J, Finder J, Lester M, Quittell L, et al. (2007) Cystic fibrosis pulmonary guidelines: chronic medications for maintenance of lung health. American journal of respiratory and critical care medicine 176(10):957–969
2007
Earlier work this paper cites.
Beygelzimer A, Langford J (2009) The offset tree for learning with partial labels. Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining , 129–138
2009
Earlier work this paper cites.
Consortium IWP (2009) Estimation of the warfarin dose with clinical and pharmacogenetic data. New England Journal of Medicine 360(8):753–764
2009
Earlier work this paper cites.
Li L, Chu W, Langford J, Schapire RE (2010) A contextual-bandit approach to personalized news article recommendation. Proceedings of the 19th international conference on World wide web , 661–670
2010
Earlier work this paper cites.
Dudík M, Langford J, Li H (2011) Doubly robust policy evaluation and learning. Proceedings of the 28th International Conference on Machine Learning, ICML 2011
2011
Earlier work this paper cites.
Qian M, Murphy SA (2011) Performance guarantees for individualized treatment rules. Annals of statistics 39(2):1180
2011
Earlier work this paper cites.
Dwork C, Hardt M, Pitassi T, Reingold O, Zemel R (2012) Fairness through awareness. Proceedings of the 3rd innovations in theoretical computer science conference , 214–226
2012
Earlier work this paper cites.
Bertsimas D, Farias VF, Trichakis N (2013) Fairness, efficiency, and flexibility in organ allocation for kidney transplantation. Operations Research 61(1):73–87
2013
Earlier work this paper cites.
Bottou L, Peters J, Quiñonero-Candela J, Charles DX, Chickering DM, Portugaly E, Ray D, Simard P, Snelson E (2013) Counterfactual reasoning and learning systems: The example of computational advertising. Journal of Machine Learning Research 14(65):3207–3260, URL http://jmlr.org/papers/v14/bottou13a.html
2013
Earlier work this paper cites.
Goldenshluger A, Zeevi A (2013) A linear response bandit problem. Stochastic Systems 3(1):230–261
2013
Cited alongside, same era.
Nikolaev AG, Jacobson SH, Cho WKT, Sauppe JJ, Sewell EC (2013) Balance optimization subset selection (boss): An alternative approach for causal inference with observational data. Operations Research 61(2):398–412
2013
Cited alongside, same era.
Yıldız S, Vielma JP (2013) Incremental and encoding formulations for mixed integer programming. Operations Research Letters 41(6):654–658
2013
Cited alongside, same era.
Zemel R, Wu Y, Swersky K, Pitassi T, Dwork C (2013) Learning fair representations. International conference on machine learning , 325–333 (PMLR)
2013
Cited alongside, same era.
Abrevaya J, Hsu YC, Lieli RP (2015) Estimating conditional average treatment effects. Journal of Business & Economic Statistics 33(4):485–505
Fischetti M, Jo J (2018) Deep neural networks and mixed integer linear optimization. Constraints 23(3):296–309
2018
Later among the works it cites.
Kallus N (2018) Balanced policy evaluation and learning. Advances in Neural Information Processing Systems , volume 2018-December, ISSN 10495258
2018
Later among the works it cites.
2018
Later among the works it cites.
Powers S, Qian J, Jung K, Schuler A, Shah NH, Hastie T, Tibshirani R (2018) Some methods for heterogeneous treatment effect estimation in high dimensions. Statistics in medicine 37(11):1767–1787
2018
Later among the works it cites.
Wager S, Athey S (2018) Estimation and inference of heterogeneous treatment effects using random forests. Journal of the American Statistical Association 113(523):1228–1242
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2015
Cited alongside, same era.
Rucker DD, McShane BB, Preacher KJ (2015) A researcher’s guide to regression, discretization, and median splits of continuous variables. Journal of Consumer Psychology 25(4):666–678
2015
Cited alongside, same era.
Athey S, Imbens G (2016) Recursive partitioning for heterogeneous causal effects. Proceedings of the National Academy of Sciences of the United States of America 113(27), ISSN 10916490, URL http://dx.doi.org/10.1073/pnas.1510489113
2016
Cited alongside, same era.
Bolukbasi T, Chang KW, Zou JY, Saligrama V, Kalai AT (2016) Man is to computer programmer as woman is to homemaker? debiasing word embeddings. Advances in neural information processing systems 29
2016
Cited alongside, same era.
Hardt M, Price E, Srebro N (2016) Equality of opportunity in supervised learning. Advances in neural information processing systems 29
2016
Cited alongside, same era.
2016
Cited alongside, same era.
Bertsimas D, Dunn J (2017) Optimal classification trees. Machine Learning 106(7):1039–1082
2017
Cited alongside, same era.
Bertsimas D, Kallus N, Weinstein AM, Zhuo YD (2017) Personalized diabetes management using electronic medical records. Diabetes care 40(2):210–217
2017
Cited alongside, same era.
2018
Later among the works it cites.
Xu H, Wang K, Vayanos P, Tambe M (2018) Strategic coordination of human patrollers and mobile sensors with signaling for security games. Proceedings of the AAAI Conference on Artificial Intelligence , volume 32
2018
Later among the works it cites.
Aghaei S, Azizi MJ, Vayanos P (2019) Learning optimal and fair decision trees for non-discriminative decision-making. Proceedings of the AAAI Conference on Artificial Intelligence , volume 33, 1418–1426
2019
Later among the works it cites.
Hernán M, Robins J (2019) Causal Inference: What If . Chapman & Hall/CRC (Taylor & Francis), ISBN 9781420076165, URL https://books.google.com/books?id=_KnHIAAACAAJ
2019
Later among the works it cites.
Rudin C (2019) Stop explaining black box machine learning models for high stakes decisions and use interpretable models instead. Nature Machine Intelligence 1(5):206–215
2019
Later among the works it cites.
Verwer S, Zhang Y (2019) Learning optimal classification trees using a binary linear program formulation. Proceedings of the AAAI Conference on Artificial Intelligence , volume 33, 1625–1632
2019
Later among the works it cites.
Bastani H, Bayati M (2020) Online decision making with high-dimensional covariates. Operations Research 68(1):276–294
2020
Later among the works it cites.
Bennett M, Vielma JP, Zubizarreta JR (2020) Building representative matched samples with multi-valued treatments in large observational studies. Journal of Computational and Graphical Statistics 29(4):744–757
2020
Later among the works it cites.
Elmachtoub A, Liang JCN, McNellis R (2020) Decision trees for decision-making under the predict-then-optimize framework. International Conference on Machine Learning , 2858–2867 (PMLR)
2020
Later among the works it cites.
Fan Q, Hsu YC, Lieli RP, Zhang Y (2020) Estimation of conditional average treatment effects with high-dimensional data. Journal of Business & Economic Statistics 1–15
2020
Later among the works it cites.
Linardatos P, Papastefanopoulos V, Kotsiantis S (2020) Explainable ai: A review of machine learning interpretability methods. Entropy 23(1):18
2020
Later among the works it cites.
Mišić VV (2020) Optimization of tree ensembles. Operations Research 68(5):1605–1624
2020
Later among the works it cites.
Xie W, Deng X (2020) Scalable algorithms for the sparse ridge regression. SIAM Journal on Optimization 30(4):3359–3386
2020
Later among the works it cites.
Aghaei S, Gómez A, Vayanos P (2020) Strong optimal classification trees. Technical report, University of Southern California, URL http://www.optimization-online.org/DB_FILE/2021/01/8220.pdf
2021
Closest in time.
Gómez A, Prokopyev OA (2021) A mixed-integer fractional optimization approach to best subset selection. INFORMS Journal on Computing 176(10):957–969
2021
Closest in time.
Mazumder R, Meng X, Wang H (2022) Quant-bnb: A scalable branch-and-bound method for optimal decision trees with continuous features. International Conference on Machine Learning , 15255–15277 (PMLR)
2022
Closest in time.
Zhou Z, Athey S, Wager S (2023) Offline multi-action policy learning: Generalization and optimization. Operations Research 71(1):148–183
2023
Closest in time.