“…In this setting an online learner iteratively picks an action š¦ š” and then suffers a convex hitting cost š š” (š¦ š” ) and a (linear) switching cost š (š¦ š” , š¦ š” ā1 , ā¢ ā¢ ā¢ , š¦ š” āš ), depending on current and previous š actions. This type of online optimization with memory has deep connections to convex body chasing [5,9,10,27] and has wide applications in areas such as power systems [6,19,21], electric vehicle charging [14,19], cloud computing [11,12,25], and online control [16,20,22,24,31].…”