$A Low Complexity Algorithm with $O(\sqrt{T})$ Regret and $O(1)$ Constraint Violations for Online Convex Optimization with Long Term Constraints$

A Low Complexity Algorithm with $O(\sqrt{T})$ Regret and $O(1)$ Constraint Violations for Online Convex Optimization with Long Term Constraints

8 April 2016

Papers citing "A Low Complexity Algorithm with $O(\sqrt{T})$ Regret and $O(1)$ Constraint Violations for Online Convex Optimization with Long Term Constraints"

5 / 5 papers shown

Title
Provably Efficient Model-Free Algorithm for MDPs with Peak Constraints Qinbo Bai Vaneet Aggarwal Ather Gattami 22 7 0 11 Mar 2020
Robust Online Learning for Resource Allocation -- Beyond Euclidean Projection and Dynamic Fit Ezra Tampubolon Holger Boche 20 2 0 21 Oct 2019
Distributed Online Convex Optimization with Time-Varying Coupled Inequality Constraints Xinlei Yi Xiuxian Li Lihua Xie Karl H. Johansson 24 152 0 06 Mar 2019
The Online Saddle Point Problem and Online Convex Optimization with Knapsacks Adrian Rivera Cardoso He Wang Huan Xu 40 11 0 21 Jun 2018
Online Convex Optimization with Stochastic Constraints Hao Yu M. Neely Xiaohan Wei 22 219 0 12 Aug 2017