Delay-Tolerant OCO With Long-Term Constraints: Algorithm and Its Application to Network Resource Allocation

We consider online convex optimization (OCO) with multi-slot feedback delay. An agent selects a sequence of online decisions to minimize the accumulation of time-varying convex loss functions, subject to short-term and long-term constraints that may be time-varying. Both the convex loss function and...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	IEEE/ACM transactions on networking Ročník 31; číslo 1; s. 147 - 163
Hlavní autori:	Wang, Juncheng, Dong, Min, Liang, Ben, Boudreau, Gary, Abou-Zeid, Hatem
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York IEEE 01.02.2023 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:	Algorithms Benchmark testing Benchmarks Computational geometry constraint violation Constraints Convexity Decision theory Delay Delays dynamic regret Feedback Heuristic algorithms long-term constraint Mathematical analysis multi-slot delay Online convex optimization online network resource allocation Optimization Regularization Resource allocation Resource management Upper bounds Wireless communication
ISSN:	1063-6692, 1558-2566
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!