activity
20212026
most citedOnline Convex Optimization with Switching Cost and Delayed Gradients

1 citations · 1 across the 11 of their papers we have counts for

collaborators

14 papers

cs.LG2026

Convex Optimization with Nested Evolving Feasible Sets (CONES) under Time-Varying Loss Functions

Rahul Vaze

Convex Optimization with Nested Evolving Feasible Sets (CONES)} was introduced in \cite{CONESVaze} where the objective function \(f\) remains fixed but the feasible region evolves…

cs.LG2026

Simultaneous Coverage and Efficiency Guarantee in Online Conformal Prediction

Rahul Vaze

Adaptive conformal inference (ACI) of Gibbs and Cand{è}s and its variants are the standard approach to online conformal prediction under distribution shift, but they suffer from th…

cs.LG2026

Lower Bound on the Cumulative Constrained Violation for the OGD+Projection algorithm for Constrained Online Convex Optimization (COCO)

Haricharan Balasundaram, Karthick Krishna Mahendran, Rahul Vaze

The problem of constrained online convex optimization is considered, where at each round, once a learner commits to an action , a convex l…

cs.LG2026

Convex Optimization with Nested Evolving Feasible Sets

Karthick Krishna M., Haricharan Balasundaram, Rahul Vaze

\emph{Convex Optimization with Nested Evolving Feasible Sets (CONES)} is considered where the objective function \(f\) remains fixed but the feasible region evolves over time as a…

cs.LG2026

Breaking the Cumulative Constraint Violation Barrier while Achieving Static Regret in Constrained Online Convex Optimization

Haricharan Balasundaram, Karthick Krishna Mahendran, Rahul Vaze

The problem of constrained online convex optimization is considered, where at each round, once a learner commits to an action , a convex l…

cs.LG2025

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…

math.OC2025

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…

cs.LG2025

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…

cs.LG2025

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…

cs.GT2025

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…

cs.LG2024

Tight Bounds for Online Convex Optimization with Adversarial Constraints

Abhishek Sinha, Rahul Vaze

A well-studied generalization of the standard online convex optimization (OCO) is constrained online convex optimization (COCO). In COCO, on every round, a convex cost function and…

cs.LG2023★ 1 cited

Online Convex Optimization with Switching Cost and Delayed Gradients

Spandan Senapati, Rahul Vaze

We consider the online convex optimization (OCO) problem with quadratic and linear switching cost in the limited information setting, where an online algorithm can choose its actio…

cs.LG2023

Optimal Algorithms for Online Convex Optimization with Adversarial Constraints

Abhishek Sinha, Rahul Vaze

A well-studied generalization of the standard online convex optimization (OCO) framework is constrained online convex optimization (COCO). In COCO, on every round, a convex cost fu…

cs.LG2021

Scheduling to Learn In An Unsupervised Online Streaming Model

R. Vaze, Santanu Rathod

An unsupervised online streaming model is considered where samples arrive in an online fashion over slots. There are classifiers, whose confusion matrices are unknown a pri…