Fetching the paper…
Reading the bibliography…
We study an online contextual decision-making problem with resource constraints.
Directed regression
Y.-h. Kao, B. Roy, and X. Yan · 2009
Earlier work this paper cites.
Near optimal online algorithms and fast approximation algorithms for resource allocation problems
N. R. Devanur, K. Jain, B. Sivan, and C. A. Wilkens · 2011
Earlier work this paper cites.
Trading regret for efficiency: online convex optimization with long term constraints
M. Mahdavi, R. Jin, and T. Yang · 2012
Earlier work this paper cites.
Online learning and online convex optimization
S. Shalev-Shwartz et al · 2012
Earlier work this paper cites.
Thompson sampling for contextual bandits with linear payoffs
S. Agrawal and N. Goyal · 2013
Earlier work this paper cites.
Bandits with knapsacks
A. Badanidiyuru, R. Kleinberg, and A. Slivkins · 2013
Earlier work this paper cites.
A dynamic near-optimal algorithm for online linear programming
S. Agrawal, Z. Wang, and Y. Ye · 2014
Earlier work this paper cites.
Resourceful contextual bandits
A. Badanidiyuru, J. Langford, and A. Slivkins · 2014
Earlier work this paper cites.
Adam: A method for stochastic gradient descent
D. P. Kingma and J. L. Ba · 2015
Earlier work this paper cites.
Linear contextual bandits with knapsacks
S. Agrawal and N. Devanur · 2016
Earlier work this paper cites.
Adaptive algorithms for online convex optimization with long-term constraints
R. Jenatton, J. Huang, and C. Archambeau · 2016
Cited alongside, same era.
Task-based end-to-end model learning in stochastic optimization
P. Donti, B. Amos, and J. Z. Kolter · 2017
Cited alongside, same era.
Bandits with knapsacks
A. Badanidiyuru, R. Kleinberg, and A. Slivkins · 2018
Cited alongside, same era.
Online network revenue management using thompson sampling
K. J. Ferreira, D. Simchi-Levi, and H. Wang · 2018
Cited alongside, same era.
Generalization bounds in the predict-then-optimize framework
O. El Balghiti, A. N. Elmachtoub, P. Grigas, and A. Tewari · 2019
Cited alongside, same era.
Objective-aligned regression for two-stage linear programs
A. Estes and J.-P. Richard · 2019
Cited alongside, same era.
From predictive to prescriptive analytics
D. Bertsimas and N. Kallus · 2020
Later among the works it cites.
Fast rates for contextual linear optimization
Y. Hu, N. Kallus, and X. Mao · 2020
Later among the works it cites.
Smart “predict, then optimize”
A. N. Elmachtoub and P. Grigas · 2021
Later among the works it cites.
End-to-end constrained optimization learning: A survey
J. Kotary, F. Fioretto, P. Van Hentenryck, and B. Wilder · 2021
Later among the works it cites.
Online linear programming: Dual convergence, new algorithms, and regret bounds
X. Li and Y. Ye · 2021
Later among the works it cites.
Risk bounds and calibration for a smart predict-then-optimize method
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
On data-driven prescriptive analytics with side information: A regularized nadaraya-watson approach
C. P. Ho and G. A. Hanasusanto · 2019
Cited alongside, same era.
Cautious regret minimization: Online optimization with long-term budget constraints
N. Liakopoulos, A. Destounis, G. Paschos, T. Spyropoulos, and P. Mertikopoulos · 2019
Cited alongside, same era.
Prescriptive analytics for flexible capacity management
P. M. Notz and R. Pibernik · 2019
Cited alongside, same era.
The best of many worlds: Dual mirror descent for online allocation problems
S. Balseiro, H. Lu, and V. Mirrokni · 2020
Cited alongside, same era.
Bandits with concave rewards and convex knapsacks
S. Agrawal and N. R. Devanur
Cited in the paper.
Fast algorithms for online stochastic convex programming
S. Agrawal and N. R. Devanur
Cited in the paper.
H. Liu and P. Grigas · 2021
Later among the works it cites.
Joint online learning and decision-making via dual mirror descent
A. Lobos, P. Grigas, and Z. Wen · 2021
Later among the works it cites.
Stochastic bandits with linear constraints
A. Pacchiano, M. Ghavamzadeh, P. Bartlett, and H. Jiang · 2021
Later among the works it cites.
Online allocation and pricing: Constant regret via bellman inequalities
A. Vera, S. Banerjee, and I. Gurvich · 2021
Later among the works it cites.
Risk guarantees for end-to-end prediction and optimization processes
N. Ho-Nguyen and F. Kılınç-Karzan · 2022
Closest in time.