Fetching the paper…
Reading the bibliography…
As a metric to measure the performance of an online method, dynamic regret with switching cost has drawn much attention for online decision making problems.
Model predictive control: past, present and future
Manfred Morari and Jay H. Lee. 1999 · 1999
Earlier work this paper cites.
On-line Learning and the Metrical Task System Problem
Avrim Blum and Carl Burch. 2000 · 2000
Earlier work this paper cites.
Mirror descent and nonlinear projected subgradient methods for convex optimization
Amir Beck and Marc Teboulle. 2003 · 2003
Earlier work this paper cites.
Online Convex Programming and Generalized Infinitesimal Gradient Ascent. In Proceedings of International Conference on Machine Learning (ICML) . 928–935
Martin Zinkevich. 2003 · 2003
Earlier work this paper cites.
Online Classification on a Budget
Koby Crammer, Jaz Kandola, and Yoram Singer. 2004 · 2004
Earlier work this paper cites.
Dynamic oligopolistic competition on an electric power network with ramping costs and joint sales constraints
Reetabrata Mookherjee, Benjamin F. Hobbs, Terry Lee Friesz, and Matthew A. Rigdon. 2008 · 2008
Earlier work this paper cites.
A Regularization Approach to Metrical Task Systems. In Proceedings of the 21st International Conference on Algorithmic Learning Theory (ALT) . Springer-Verlag, Berlin, Heidelberg, 270–284
Jacob Abernethy, Peter L. Bartlett, Niv Buchbinder, and Isabelle Stanton. 2010 · 2010
Earlier work this paper cites.
Metrical Task Systems and the K-server Problem on HSTs. In Proceedings of the 37th International Colloquium Conference on Automata, Languages and Programming
Nikhil Bansal, Niv Buchbinder, and Joseph Naor. 2010 · 2010
Earlier work this paper cites.
Online Classification with Specificity Constraints
Andrey Bernstein, Shie Mannor, and Nahum Shimkin. 2010 · 2010
Earlier work this paper cites.
Introduction to Online Optimization
Sébastien Bubeck. 2011 · 2011
Earlier work this paper cites.
Dynamic right-sizing for power-proportional data centers. In Proceedings of IEEE International Conference on Computer Communications (INFOCOMM) . 1098–1106
M. Lin, A. Wierman, L. L. H. Andrew, and E. Thereska. 2011 · 2011
Earlier work this paper cites.
Unified Algorithms for Online Learning and Competitive Analysis. In Proceedings of the 25th Annual Conference on Learning Theory (COLT) , Shie Mannor, Nathan Srebro, and Robert C. Williamson (Eds.), Vol. 23. Edinburgh, Scotland, 5.1–5.18
Niv Buchbinder, Shahar Chen, Joshep (Seffi) Naor, and Ohad Shamir. 2012 · 2012
Earlier work this paper cites.
Online Optimization with Gradual Variations
Chao Kai Chiang, Tianbao Yang, Chia Jung Lee, Mehrdad Mahdavi, Chi Jen Lu, Rong Jin, and Shenghuo Zhu. 2012 · 2012
Earlier work this paper cites.
Online Optimization with Switching Cost
Minghong Lin, Adam Wierman, Alan Roytman, Adam Meyerson, and Lachlan L.H. Andrew. 2012 · 2012
Earlier work this paper cites.
On Online Algorithms with Advice for the k-Server Problem. In Approximation and Online Algorithms , Roberto Solis-Oba and Giuseppe Persiano (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg, 198–210
Marc P. Renault and Adi Rosén. 2012 · 2012
Earlier work this paper cites.
Online Learning and Online Convex Optimization
Shai Shalev-Shwartz. 2012 · 2012
Earlier work this paper cites.
Dynamic Service Placement in Geographically Distributed Clouds. In Proceedings of the IEEE 32nd International Conference on Distributed Computing Systems (ICDCS) . 526–535
Q. Zhang, Q. Zhu, M. F. Zhani, and R. Boutaba. 2012 · 2012
Cited alongside, same era.
A Tale of Two Metrics: Simultaneous Bounds on Competitiveness and Regret. In Proceedings of the ACM International Conference on Measurement and Modeling of Computer Systems . 329–330
Lachlan Andrew, Siddharth Barman, Katrina Ligett, Minghong Lin, Adam Meyerson, Alan Roytman, and Adam Wierman. 2013 · 2013
Cited alongside, same era.
Dynamical Models and tracking regret in online convex programming.. In Proceedings of International Conference on International Conference on Machine Learning (ICML)
Eric C Hall and Rebecca Willett. 2013 · 2013
Cited alongside, same era.
Confidence Weighted Mean Reversion Strategy for Online Portfolio Selection
Bin Li, Steven C. H. Hoi, Peilin Zhao, and Vivekanand Gopalkrishnan. 2013 · 2013
Cited alongside, same era.
Online optimization in dynamic environments: Improved regret rates for strongly convex problems. In Proceedings of IEEE Conference on Decision and Control (CDC) . IEEE, 7195–7201
Aryan Mokhtari, Shahin Shahrampour, Ali Jadbabaie, and Alejandro Ribeiro. 2016 · 2016
Later among the works it cites.
Online Ensemble Learning of Data Streams with Gradually Evolved Classes
Y. Sun, K. Tang, L. L. Minku, S. Wang, and X. Yao. 2016 · 2016
Later among the works it cites.
Improving Advertisement Recommendation by Enriching User Browser Cookie Attributes. In Proceedings of the 25th ACM International on Conference on Information and Knowledge Management (CIKM) . 2401–2404
Liang Wang, Kuang-chih Lee, and Quan Lu. 2016 · 2016
Later among the works it cites.
Tracking Slowly Moving Clairvoyant - Optimal Dynamic Regret of Online Learning with True and Noisy Gradient.. In Proceedings of the 34th International Conference on Machine Learning (ICML)
Tianbao Yang, Lijun Zhang, Rong Jin, and Jinfeng Yi. 2016 · 2016
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
T. Lu, M. Chen, and L. L. H. Andrew. 2013 · 2013
Cited alongside, same era.
Efficient Online Learning for Multitask Feature Selection
Haiqin Yang, Michael R. Lyu, and Irwin King. 2013 · 2013
Cited alongside, same era.
Online Portfolio Selection: A Survey
Bin Li and Steven C. H. Hoi. 2014 · 2014
Cited alongside, same era.
Exploring Smart Grid and Data Center Interactions for Electric Power Load Balancing
Hao Wang, Jianwei Huang, Xiaojun Lin, and Hamed Mohsenian-Rad. 2014 · 2014
Cited alongside, same era.
Non-Stationary Stochastic Optimization
Omar Besbes, Yonatan Gur, and Assaf J Zeevi. 2015 · 2015
Cited alongside, same era.
Online Convex Optimization Using Predictions. In Proceedings of the ACM International Conference on Measurement and Modeling of Computer Systems . 191–204
Niangjun Chen, Anish Agarwal, Adam Wierman, Siddharth Barman, and Lachlan L.H. Andrew. 2015 · 2015
Cited alongside, same era.
Online Convex Optimization in Dynamic Environments
Eric C Hall and Rebecca M Willett. 2015 · 2015
Cited alongside, same era.
Online Optimization : Competing with Dynamic Comparators. In Proceedings of International Conference on Artificial Intelligence and Statistics (AISTATS) . 398–406
Ali Jadbabaie, Alexander Rakhlin, Shahin Shahrampour, and Karthik Sridharan. 2015 · 2015
Cited alongside, same era.
An Online Convex Optimization Approach to Proactive Network Resource Allocation
Tianyi Chen, Qing Ling, and Georgios B. Giannakis. 2017 · 2017
Later among the works it cites.
A Tight Lower Bound for Online Convex Optimization with Switching Costs. In Approximation and Online Algorithms . Springer International Publishing, Cham, 164–175
Antonios Antoniadis, Kevin Schewior, and Rudolf Fleischer. 2018 · 2018
Later among the works it cites.
K-server via Multiscale Entropic Regularization. In Proceedings of the 50th Annual ACM Symposium on Theory of Computing (STOC) . ACM, New York, NY, USA, 3–16
Sébastien Bubeck, Michael B. Cohen, Yin Tat Lee, James R. Lee, and Aleksander M k · 2018
Later among the works it cites.
Smoothed Online Convex Optimization in High Dimensions via Online Balanced Descent. In Proceedings of the 31st Conference On Learning Theory (COLT) , Vol. 75. 1574–1594
Niangjun Chen, Gautam Goel, and Adam Wierman. 2018 · 2018
Later among the works it cites.
Online Learning with Non-Convex Losses and Non-Stationary Regret. In Proceedings of the Twenty-First International Conference on Artificial Intelligence and Statistics (AISTATS) , Amos Storkey and Fernando Perez-Cruz (Eds.), Vol. 84. 235–243
Xiand Gao, Xiaobo Li, and Shuzhong Zhang. 2018 · 2018
Later among the works it cites.
Fusible HSTs and the randomized k-server conjecture.. In Proceedings of the IEEE 59th Annual Symposium on Foundations of Computer Science
James R Lee. 2018 · 2018
Later among the works it cites.
Differentially Private Distributed Online Learning
C. Li, P. Zhou, L. Xiong, Q. Wang, and T. Wang. 2018 · 2018
Later among the works it cites.
Online Optimization with Predictions and Switching Costs: Fast Algorithms and the Fundamental Limit
Yingying Li, Guannan Qu, and Na Li. 2018 · 2018
Later among the works it cites.
Proximal Online Gradient is Optimum for Dynamic Regret
Yawei Zhao, Shuang Qiu, and Ji Liu. 2018 · 2018
Later among the works it cites.
Metrical task systems on trees via mirror descent and unfair gluing. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA)
Sébastien Bubeck, Michael B Cohen, James R Lee, and Yin Tat Lee. 2019 · 2019
Closest in time.
Differential Privacy Oriented Distributed Online Learning for Mobile Social Video Prefetching
M. Wang, C. Xu, X. Chen, H. Hao, L. Zhong, and S. Yu. 2019 · 2019
Closest in time.