1 citations · 1 across the 11 of their papers we have counts for
5 papers · 1 filter
Multi-Objective Online Convex Optimization
Rahul Vaze, Sumiran Mishra
In this paper, we broaden the horizon of online convex optimization (OCO), and consider multi-objective OCO, where there are distinct loss function sequences, and an algorithm…
Online Convex Optimization with Switching Cost with Only One Single Gradient Evaluation
Harsh Shah, Purna Chandrasekhar, Rahul Vaze
Online convex optimization with switching cost is considered under the frugal information setting where at time , before action is taken, only a single function evaluation…
Beyond Constraint Violation for Online Convex Optimization with Adversarial Constraints
Abhishek Sinha, Rahul Vaze
We study Online Convex Optimization with adversarial constraints (COCO). At each round a learner selects an action from a convex decision set and then an adversary reveals a convex…
Static Regret and Instance Dependent Constraint Violation for Constrained Online Convex Optimization
Rahul Vaze, Abhishek Sinha
The constrained version of the standard online convex optimization (OCO) framework, called COCO is considered, where on every round, a convex cost function and a convex constraint…
Online Bidding Algorithms with Strict Return on Spend (ROS) Constraint
Rahul Vaze, Abhishek Sinha
Auto-bidding problem under a strict return-on-spend constraint (ROSC) is considered, where an algorithm has to make decisions about how much to bid for an ad slot depending on the…