Simultaneously Achieving Sublinear Regret and Constraint Violations for Online Convex Optimization with Time-varying Constraints

15 November 2021

Papers citing "Simultaneously Achieving Sublinear Regret and Constraint Violations for Online Convex Optimization with Time-varying Constraints"

7 / 7 papers shown

Title
Safety in the Face of Adversity: Achieving Zero Constraint Violation in Online Learning with Slowly Changing Constraints Bassel Hamoud Ilnura Usmanova Kfir Y. Levy 60 0 0 01 May 2025
An Online Feasible Point Method for Benign Generalized Nash Equilibrium Problems Sarah Sachs Hédi Hadiji T. Erven Mathias Staudigl 94 0 0 03 Oct 2024
Optimal Algorithms for Online Convex Optimization with Adversarial Constraints Abhishek Sinha Rahul Vaze 111 16 0 29 Oct 2023
Online Convex Optimization with Switching Cost and Delayed Gradients Spandan Senapati Rahul Vaze 123 2 0 18 Oct 2023
Online Learning under Adversarial Nonlinear Constraints Pavel Kolev Georg Martius Michael Muehlebach 104 7 0 06 Jun 2023
Dynamic Regret Analysis of Safe Distributed Online Optimization for Convex and Non-convex Problems Ting-Jui Chang Sapana Chaudhary D. Kalathil Shahin Shahrampour 102 6 0 23 Feb 2023
On Dynamic Regret and Constraint Violations in Constrained Online Convex Optimization R. Vaze 109 4 0 24 Jan 2023