A Contextual Combinatorial Semi-Bandit Approach to Network Bottleneck Identification
Not on the map. Why?
Abstract (arXiv)
Bottleneck identification is a challenging task in network analysis, especially when the network is not fully specified. To address this task, we develop a unified online learning framework based on combinatorial semi-bandits that performs bottleneck identification in parallel with learning the specifications of the underlying network. Within this framework, we adapt and study various combinatorial semi-bandit methods such as epsilon-greedy, LinUCB, BayesUCB, NeuralUCB, and Thompson Sampling. In addition, our framework is capable of using contextual information in the form of contextual bandits. Finally, we evaluate our framework on the real-world application of road networks and demonstrate its effectiveness in different settings.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 9 of its 38 references that are in the map. First posted on arXiv 16 Jun 2022.
Builds on
9 of 38 references.
References · 9
- 2017A Tutorial on Thompson Samplingcited by 433
- 2013Learning to Optimize Via Posterior Samplingcited by 256
- 2013Finite-Time Analysis of Kernelised Contextual Banditscited by 177
- 2018Deep Bayesian Bandits Showdown: An Empirical Comparison of Bayesian Deep Networks for Thompson Samplingcited by 169
- 2020Neural Thompson Samplingcited by 128
- 2018Thompson Sampling for Combinatorial Semi-Banditscited by 78
- 2021EE-Net: Exploitation-Exploration Neural Networks in Contextual Banditscited by 44
- 2021Online Learning of Network Bottlenecks via Minimax Pathscited by 9
- 2020An Online Learning Framework for Energy-Efficient Navigation of Electric Vehiclescited by 8
Built on by
Citing papers per year: 2024: 1; 2025: 0; 2026: 1.
2 papers.