Fetching the paper…
Reading the bibliography…
Many techniques for online optimization problems involve making decisions based solely on presently available information: fewer works take advantage of potential predictions.
Portfolio selection
H. Markowitz · 1952
Earlier work this paper cites.
Introduction to time series and forecasting
P. J. Brockwell, R. A. Davis, and M. V. Calder · 2002
Earlier work this paper cites.
Online convex programming and generalized infinitesimal gradient ascent
M. Zinkevich · 2003
Earlier work this paper cites.
Can we learn to beat the best stock
A. Borodin, R. El-Yaniv, and V. Gogan · 2004
Earlier work this paper cites.
Convex optimization
S. Boyd and L. Vandenberghe · 2004
Earlier work this paper cites.
Prediction, learning, and games
N. Cesa-Bianchi and G. Lugosi · 2006
Earlier work this paper cites.
Logarithmic regret algorithms for online convex optimization
E. Hazan, A. Agarwal, and S. Kale · 2007
Earlier work this paper cites.
Robust optimization
A. Ben-Tal, L. El Ghaoui, and A. Nemirovski · 2009
Earlier work this paper cites.
Universal portfolios
T. M. Cover · 2011
Earlier work this paper cites.
Online optimization with gradual variations
C.-K. Chiang, T. Yang, C.-J. Lee, M. Mahdavi, C.-J. Lu, R. Jin, and S. Zhu · 2012
Earlier work this paper cites.
Jointly optimizing multi-user rate adaptation for video transport over wireless systems: Mean-fairness-variability tradeoffs
V. Joseph and G. de Veciana · 2012
Cited alongside, same era.
Online optimization for the smart (micro) grid
B. Narayanaswamy, V. K. Garg, and T. Jayram · 2012
Cited alongside, same era.
Online learning and online convex optimization
S. Shalev-Shwartz et al · 2012
Cited alongside, same era.
Dynamical models and tracking regret in online convex programming
E. Hall and R. Willett · 2013
Cited alongside, same era.
A survey on multiobjective evolutionary algorithms for the solution of the portfolio optimization problem and other finance and economics applications
A. Ponsich, A. L. Jaimes, and C. A. C. Coello · 2013
Cited alongside, same era.
Online portfolio selection: A survey
B. Li and S. C. Hoi · 2014
Introduction to online convex optimization
E. Hazan et al · 2016
Later among the works it cites.
Accelerating online convex optimization via adaptive prediction
M. Mohri and S. Yang · 2016
Later among the works it cites.
Online optimization in dynamic environments: Improved regret rates for strongly convex problems
A. Mokhtari, S. Shahrampour, A. Jadbabaie, and A. Ribeiro · 2016
Later among the works it cites.
Metagrad: Multiple learning rates in online learning
T. van Erven and W. M. Koolen · 2016
Later among the works it cites.
Tracking slowly moving clairvoyant: Optimal dynamic regret of online learning with true and noisy gradient
T. Yang, L. Zhang, R. Jin, and J. Yi · 2016
Later among the works it cites.
Improved dynamic regret for non-degenerate functions
L. Zhang, T. Yang, J. Yi, J. Rong, and Z.-H. Zhou · 2017
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Non-stationary stochastic optimization
O. Besbes, Y. Gur, and A. Zeevi · 2015
Cited alongside, same era.
Time series analysis: forecasting and control
G. E. Box, G. M. Jenkins, G. C. Reinsel, and G. M. Ljung · 2015
Cited alongside, same era.
Online optimization: Competing with dynamic comparators
A. Jadbabaie, A. Rakhlin, S. Shahrampour, and K. Sridharan · 2015
Cited alongside, same era.
Using predictions in online optimization: Looking forward with an eye on the past
N. Chen, J. Comden, Z. Liu, A. Gandhi, and A. Wierman · 2016
Cited alongside, same era.
Later among the works it cites.
Unbiased objective estimation in predictive optimization
S. Ito, A. Yabe, and R. Fujimaki · 2018
Later among the works it cites.
Using predictions in online optimization with switching costs: A fast algorithm and a fundamental limit
Y. Li, G. Qu, and N. Li · 2018
Later among the works it cites.
Adaptive online learning in dynamic environments
L. Zhang, S. Lu, and Z.-H. Zhou · 2018
Later among the works it cites.