From the 1 of 9 linked papers with an AI index.
9 papers
Simultaneous Coverage and Efficiency Guarantee in Online Conformal Prediction
Rahul Vaze
The paper proposes new online conformal prediction methods that simultaneously guarantee non‑cancelling coverage and efficient prediction‑set sizes, even under adversarial or shift…
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…
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…
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…
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…
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…