Delay-Tolerant Constrained OCO with Application to Network Resource Allocation
Juncheng Wang, Ben Liang, Min Dong, Gary Boudreau, and Hatem Abou-zeid

TL;DR
This paper introduces DTC-OCO, an algorithm for online convex optimization with delayed feedback and constraints, achieving sublinear regret and applying it to network resource allocation with promising simulation results.
Contribution
It develops a novel delay-tolerant constrained OCO algorithm with double regularization, addressing feedback delays and dynamic constraints in online decision-making.
Findings
Sublinear bounds on dynamic and static regret.
Effective handling of multi-slot feedback delays.
Significant performance improvements in network resource allocation simulations.
Abstract
We consider online convex optimization (OCO) with multi-slot feedback delay, where an agent makes a sequence of online decisions to minimize the accumulation of time-varying convex loss functions, subject to short-term and long-term constraints that are possibly time-varying. The current convex loss function and the long-term constraint function are revealed to the agent only after the decision is made, and they may be delayed for multiple time slots. Existing work on OCO under this general setting has focused on the static regret, which measures the gap of losses between the online decision sequence and an offline benchmark that is fixed over time. In this work, we consider both the static regret and the more practically meaningful dynamic regret, where the benchmark is a time-varying sequence of per-slot optimizers. We propose an efficient algorithm, termed Delay-Tolerant…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
