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

v1v2v3 (latest)

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

ArXiv (abs)PDF HTML

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
Online Convex Optimization with Stochastic Constraints Hao Yu M. Neely Xiaohan Wei 69 224 0 12 Aug 2017
Adaptive Algorithms for Online Convex Optimization with Long-term Constraints Rodolphe Jenatton Jim C. Huang Cédric Archambeau 142 158 0 23 Dec 2015
Projection-free Online Learning Elad Hazan Satyen Kale 110 248 0 18 Jun 2012
Trading Regret for Efficiency: Online Convex Optimization with Long Term Constraints M. Mahdavi Rong Jin Tianbao Yang 191 266 0 25 Nov 2011
Bidding for Representative Allocations for Display Advertising Arpita Ghosh Preston Mcafee Kishore Papineni Sergei Vassilvitskii 80 138 0 05 Oct 2009