# Age of Information Optimization in Multi-Channel Network with Sided Information

arXiv: https://arxiv.org/abs/2212.07114 · HTML: https://mlsanity.com/paper/2212.07114/

## Key facts

- Cited by 2 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 14 Dec 2022.

## Built on by (most cited first, 2 of 2)

- [On the Regularity and Fairness of Combinatorial Multi-Armed Bandit](https://mlsanity.com/paper/2509.12457/) (2025)
- [Resource Allocation in Hybrid Radio-Optical IoT Networks using GNN with Multi-task Learning](https://mlsanity.com/paper/2511.07428/) (2025)

## Abstract (arXiv)

We consider a discrete-time multi-channel network where the destination collects time-sensitive packets from multiple sources with sided channel information. The popular metric, Age of Information (AoI), is applied to measure the data freshness at the destination. Due to the interference constraint, only disjoint source-channel pairs can be chosen for transmission in each time slot, and the decision maker should choose the optimal scheduling pairs to minimize the average AoI at the destination. To learn the optimal channel selection, we apply the linear contextual bandit (LCB) framework by utilizing the sided information provided by pilots. Concretely, we establish the relationship between AoI regret and sub-optimal channel selection times and propose both age-independent and age-dependent algorithms. The former method is proven to achieve the sub-linear AoI regret but is outperformed by the latter algorithm both in the linear and non-linear contextual model in simulation.