Fetching the paper…
Reading the bibliography…
Incorporating side observations in decision making can reduce uncertainty and boost performance, but it also requires we tackle a potentially complex predictive relationship.
Vapnik V, Chervonenkis A (1974) Theory of pattern recognition
1974
Earlier work this paper cites.
Stone CJ (1982) Optimal global rates of convergence for nonparametric regression. The annals of statistics 1040–1053
1982
Earlier work this paper cites.
Dudley R (1987) Universal donsker classes and metric entropy. Ann. Prob. 1306–1326
1987
Earlier work this paper cites.
McCullagh P, Nelder JA (1989) Generalized Linear Models
1989
Earlier work this paper cites.
Pollard D (1990) Empirical processes: Theory and applications. NSF-CBMS Regional Conference Series in Probability and Statistics
1990
Earlier work this paper cites.
Ben-David S, Cesabianchi N, Haussler D, Long PM (1995) Characterizations of learnability for classes of { 0 , … , n } \{0,...,n\} -valued functions. Journal of Computer and System Sciences 50(1):74–86
1995
Earlier work this paper cites.
Devroye L, Lugosi G (1995) Lower bounds in pattern recognition and learning. Pattern recognition 28(7):1011–1018
1995
Earlier work this paper cites.
Van Der Vaart AW, Wellner JA (1996) Weak convergence and empirical processes (Springer)
1996
Earlier work this paper cites.
Bousquet O (2002) A bennett concentration inequality and its application to suprema of empirical processes. Comptes Rendus Mathematique 334(6):495–500
2002
Earlier work this paper cites.
Mendelson S (2002) Geometric parameters of kernel machines. International Conference on Computational Learning Theory , 29–43 (Springer)
2002
Earlier work this paper cites.
Boucheron S, Lugosi G, Massart P, et al. (2003) Concentration inequalities using the entropy method. The Annals of Probability 31(3):1583–1614
2003
Earlier work this paper cites.
Tsybakov AB (2004) Optimal aggregation of classifiers in statistical learning. Ann. Stat. 32(1):135–166
2004
Earlier work this paper cites.
Bartlett PL, Bousquet O, Mendelson S (2005) Local rademacher complexities. Ann. Stat. 33(4):1497–1537
2005
Earlier work this paper cites.
Koltchinskii V, et al. (2006) Local rademacher complexities and oracle inequalities in risk minimization. Ann. of Stat. 34(6):2593–2656
2006
Earlier work this paper cites.
Massart P, Nédélec É (2006) Risk bounds for statistical learning. Ann. Stat. 34(5):2326–2366
2006
Earlier work this paper cites.
Williams CK, Rasmussen CE (2006) Gaussian processes for machine learning . Number 3 (MIT Press)
2006
Cited alongside, same era.
Audibert JY, Tsybakov AB (2007) Fast learning rates for plug-in classifiers. Ann. Stat. 35(2):608–633
2007
Cited alongside, same era.
Van Der Vaart A, Wellner JA (2009) A note on bounds for vc dimensions. IMS Collections 5:103
2009
Cited alongside, same era.
Hu Y, Kallus N, Mao X (2020) Smooth contextual bandits: Bridging the parametric and non-differentiable regret regimes. COLT , 2007–2010
2010
Cited alongside, same era.
Rigollet P, Zeevi A (2010) Nonparametric bandits with covariates. COLT 2010
2010
Cited alongside, same era.
Hanneke S (2011) Rates of convergence in active learning. Ann. Stat. 39(1):333–361
Estes A, Richard JP (2019) Objective-aligned regression for two-stage linear programs
2019
Later among the works it cites.
Ho CP, Hanasusanto GA (2019) On data-driven prescriptive analytics with side information: A regularized nadaraya-watson approach
2019
Later among the works it cites.
Vahn GY, Rudin C (2019) The big data newsvendor: Practical insights from machine learning. Operations Research 67(1):90–108
2019
Later among the works it cites.
Wainwright MJ (2019) High-Dimensional Statistics: A Non-Asymptotic Viewpoint (Cambridge University Press)
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
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2011
Cited alongside, same era.
Barvinok A (2013) A bound for the number of vertices of a polytope with applications. Combinatorica 33(1):1–10
2013
Cited alongside, same era.
Goldenshluger A, Zeevi A (2013) A linear response bandit problem. Stochastic Systems 3(1):230–261
2013
Cited alongside, same era.
Perchet V, Rigollet P (2013) The multi-armed bandit problem with covariates. Ann. Stat. 41(2):693–721
2013
Cited alongside, same era.
Shalev-Shwartz S, Ben-David S (2014) Understanding machine learning: From theory to algorithms
2014
Cited alongside, same era.
Maurer A (2016) A vector-contraction inequality for rademacher complexities. International Conference on Algorithmic Learning Theory , 3–17 (Springer)
2016
Cited alongside, same era.
Donti P, Amos B, Kolter JZ (2017) Task-based end-to-end model learning in stochastic optimization. NeurIPS , 5484–5494
2017
Cited alongside, same era.
Bertsimas D, Kallus N (2020) From predictive to prescriptive analytics. Management Science 66(3):1025–1044
2020
Closest in time.
Diao S, Sen S (2020) Distribution-free algorithms for learning enabled predictive stochastic programming
2020
Closest in time.
Elmachtoub A, Liang JCN, McNellis R (2020) Decision trees for decision-making under the predict-then-optimize framework. ICML , 2858–2867 (PMLR)
2020
Closest in time.
Foster DJ, Rakhlin A, Simchi-Levi D, Xu Y (2020) Instance-dependent complexity of contextual bandits and reinforcement learning
2020
Closest in time.
Ho-Nguyen N, Kılınç-Karzan F (2020) Risk guarantees for end-to-end prediction and optimization processes
2020
Closest in time.
Kallus N, Mao X (2020) Stochastic optimization forests
2020
Closest in time.
Loke G, Tang Q, Xiao Y (2020) Decision-driven regularization: Harmonizing the predictive and prescriptive
2020
Closest in time.
Chen X, Owen Z, Pixton C, Simchi-Levi D (2021) A statistical learning approach to personalization in revenue management. Management Science
2021
Closest in time.
Elmachtoub AN, Grigas P (2021) Smart “predict, then optimize”. Management Science
2021
Closest in time.
Notz PM, Pibernik R (2021) Prescriptive analytics for flexible capacity management. Management Science
2021
Closest in time.