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
Showing 2026Show all

5 papers · 1 filter

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…