An Online Learning Approach to Optimizing Time-Varying Costs of AoI

05/27/2021
by   Vishrant Tripathi, et al.
0

We consider systems that require timely monitoring of sources over a communication network, where the cost of delayed information is unknown, time-varying and possibly adversarial. For the single source monitoring problem, we design algorithms that achieve sublinear regret compared to the best fixed policy in hindsight. For the multiple source scheduling problem, we design a new online learning algorithm called Follow-the-Perturbed-Whittle-Leader and show that it has low regret compared to the best fixed scheduling policy in hindsight, while remaining computationally feasible. The algorithm and its regret analysis are novel and of independent interest to the study of online restless multi-armed bandit problems. We further design algorithms that achieve sublinear regret compared to the best dynamic policy when the environment is slowly varying. Finally, we apply our algorithms to a mobility tracking problem. We consider non-stationary and adversarial mobility models and illustrate the performance benefit of using our online learning algorithms compared to an oblivious scheduling policy.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

06/23/2021

Best-Case Lower Bounds in Online Learning

Much of the work in online learning focuses on the study of sublinear up...
06/09/2021

ChaCha for Online AutoML

We propose the ChaCha (Champion-Challengers) algorithm for making an onl...
01/16/2021

Blind Optimal User Association in Small-Cell Networks

We learn optimal user association policies for traffic from different lo...
11/18/2015

Online learning in repeated auctions

Motivated by online advertising auctions, we consider repeated Vickrey a...
07/28/2021

Efficient Episodic Learning of Nonstationary and Unknown Zero-Sum Games Using Expert Game Ensembles

Game theory provides essential analysis in many applications of strategi...
11/27/2018

Optimal Learning for Dynamic Coding in Deadline-Constrained Multi-Channel Networks

We study the problem of serving randomly arriving and delay-sensitive tr...
03/01/2013

Second-Order Non-Stationary Online Learning for Regression

The goal of a learner, in standard online learning, is to have the cumul...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.