Fetching the paper…
Reading the bibliography…
This paper studies a penalized statistical decision rule for the treatment assignment problem.
1906
Earlier work this paper cites.
Koltchinskii, Vladimir (2001), “Rademacher penalties and structural risk minimization.” IEEE Transactions on Information Theory , 47, 1902–1914
1914
Earlier work this paper cites.
Vapnik, Vladimir N and Alexey J Chervonenkis (1974), “Theory of pattern recognition.”
1974
Earlier work this paper cites.
Alexander, Kenneth S (1984), “Probability inequalities for empirical processes and a law of the iterated logarithm.” The Annals of Probability , 12, 1041–1067
1984
Earlier work this paper cites.
Birgé, Lucien and Pascal Massart (1993), “Rates of convergence for minimum contrast estimators.” Probability Theory and Related Fields , 97, 113–150
1993
Earlier work this paper cites.
Györfi, L, L Devroye, and G Lugosi (1996), A probabilistic theory of pattern recognition . Springer-Verlag
1996
Earlier work this paper cites.
Van Der Vaart, Aad W and Jon A Wellner (1996), “Weak convergence.” In Weak Convergence and Empirical Processes , 16–28, Springer
1996
Earlier work this paper cites.
Györfi, L, L Devroye, and G Lugosi (1996), A probabilistic theory of pattern recognition . Springer-Verlag
1996
Earlier work this paper cites.
Van Der Vaart, Aad W and Jon A Wellner (1996), “Weak convergence.” In Weak Convergence and Empirical Processes , 16–28, Springer
1996
Earlier work this paper cites.
Bloom, Howard S, Larry L Orr, Stephen H Bell, George Cave, Fred Doolittle, Winston Lin, and Johannes M Bos (1997), “The benefits and costs of jtpa title ii-a programs: Key findings from the national job training partnership act study.” Journal of human resources , 549–576
1997
Earlier work this paper cites.
Dudley, Richard M (1999), Uniform central limit theorems , volume 23. Cambridge Univ Press
1999
Earlier work this paper cites.
Dudley, Richard M (1999), Uniform central limit theorems , volume 23. Cambridge Univ Press
1999
Earlier work this paper cites.
Mammen, Enno, Alexandre B Tsybakov, et al. (1999), “Smooth discrimination analysis.” The Annals of Statistics , 27, 1808–1829
1999
Earlier work this paper cites.
van de Geer, Sara A (2000), Empirical Processes in M-estimation , volume 6. Cambridge university press
2000
Earlier work this paper cites.
Bartlett, Peter L, Stéphane Boucheron, and Gábor Lugosi (2002), “Model selection and error estimation.” Machine Learning , 48, 85–113
2002
Earlier work this paper cites.
Bartlett, Peter L and Shahar Mendelson (2002), “Rademacher and gaussian complexities: Risk bounds and structural results.” Journal of Machine Learning Research , 3, 463–482
2002
Earlier work this paper cites.
Bartlett, Peter L, Stéphane Boucheron, and Gábor Lugosi (2002), “Model selection and error estimation.” Machine Learning , 48, 85–113
2002
Earlier work this paper cites.
Zadrozny, Bianca (2003), “Policy mining: Learning decision policies from fixed sets of data.”
2003
Earlier work this paper cites.
Beresteanu, Arie (2004), “Nonparametric estimation of regression functions under restrictions on partial derivatives.” Technical report, Duke University, Department of Economics
2004
Cited alongside, same era.
Manski, Charles F (2004), “Statistical treatment rules for heterogeneous populations.” Econometrica , 72, 1221–1246
2004
Cited alongside, same era.
Audibert, J-Y (2004), “Classification under polynomial entropy and margin assumptions and randomized estimators.”
2004
Cited alongside, same era.
Tsybakov, Alexandre B (2004), “Optimal aggregation of classifiers in statistical learning.” Annals of Statistics , 135–166
2004
Cited alongside, same era.
Boucheron, Stéphane, Olivier Bousquet, and Gábor Lugosi (2005), “Theory of classification: A survey of some recent advances.” ESAIM: probability and statistics , 9, 323–375
2005
Stoye, Jörg (2012), “Minimax regret treatment choice with covariates or with limited validity of experiments.” Journal of Econometrics , 166, 138–156
2012
Later among the works it cites.
Tetenov, Aleksey (2012), “Statistical treatment choice based on asymmetric minimax regret criteria.” Journal of Econometrics , 166, 157–165
2012
Later among the works it cites.
Zhao, Yingqi, Donglin Zeng, A John Rush, and Michael R Kosorok (2012), “Estimating individualized treatment rules using outcome weighted learning.” Journal of the American Statistical Association , 107, 1106–1118
2012
Later among the works it cites.
Boucheron, Stéphane, Gábor Lugosi, and Pascal Massart (2013), Concentration inequalities: A nonasymptotic theory of independence . Oxford university press
2013
Later among the works it cites.
Armstrong, Timothy and Shu Shen (2015), “Inference on optimal treatment assignments.”
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Dehejia, Rajeev H (2005), “Program evaluation as a decision problem.” Journal of Econometrics , 125, 141–173
2005
Cited alongside, same era.
Scott, Clayton and Robert D Nowak (2006), “Minimax-optimal classification with dyadic decision trees.” IEEE transactions on information theory , 52, 1335–1353
2006
Cited alongside, same era.
Massart, Pascal and Élodie Nédélec (2006), “Risk bounds for statistical learning.” The Annals of Statistics , 34, 2326–2366
2006
Cited alongside, same era.
Massart, Pascal (2007), “Concentration inequalities and model selection.”
2007
Cited alongside, same era.
Schlag, Karl H (2007), “Eleven - designing randomized experiments under minimax regret.” Unpublished manuscript, European University Institute
2007
Cited alongside, same era.
Bartlett, Peter L (2008), “Fast rates for estimation error and oracle inequalities for model selection.” Econometric Theory , 24, 545–552
2008
Cited alongside, same era.
Koltchinskii, V (2008), “Oracle inequalities in empirical risk minimization and sparse recovery problems: Lecture notes.” Technical report, Technical report, Ecole d’ete de Probabilités de Saint-Flour, 2008. 12.6
2008
Cited alongside, same era.
2015
Later among the works it cites.
Swaminathan, Adith and Thorsten Joachims (2015), “Batch learning from logged bandit feedback through counterfactual risk minimization.” Journal of Machine Learning Research , 16, 1731–1755
2015
Later among the works it cites.
Chen, Le-Yu and Sokbae Lee (2016), “Best subset binary prediction.” arXiv preprint arXiv:1610.02738
2016
Closest in time.
2016
Closest in time.
Bertsimas, Dimitris, Angela King, Rahul Mazumder, et al. (2016), “Best subset selection via a modern optimization lens.” The Annals of Statistics , 44, 813–852
2016
Closest in time.
Athey, Susan and Stefan Wager (2017), “Efficient policy learning.” arXiv preprint arXiv:1702.02896
2017
Closest in time.
Kock, Anders Bredahl and Martin Thyrsgaard (2017), “Optimal sequential treatment allocation.”
2017
Closest in time.
Abadie, Alberto, Matthew M Chingos, and Martin R West (2018), “Endogenous stratification in randomized experiments.” Review of Economics and Statistics , 100, 567–580
2018
Closest in time.
Kitagawa, Toru and Aleksey Tetenov (2018), “Who should be treated? empirical welfare maximization methods for treatment choice.” Econometrica , 86, 591–616
2018
Closest in time.
Rai, Yoshiyasu (2018), “Statistical inference for treatment assignment policies.”
2018
Closest in time.
2018
Closest in time.
Kitagawa, Toru and Aleksey Tetenov (2018), “Who should be treated? empirical welfare maximization methods for treatment choice.” Econometrica , 86, 591–616
2018
Closest in time.