Online learning of network bottlenecks via minimax paths
From MaRDI portal
Publication:6097144
DOI10.1007/s10994-022-06270-0arXiv2109.08467OpenAlexW3200943860MaRDI QIDQ6097144
Niklas Åkerblom, Morteza Haghir Chehreghani, Fazeleh Sadat Hoseini
Publication date: 12 June 2023
Published in: Machine Learning (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2109.08467
Related Items (2)
Online learning of energy consumption for navigation of electric vehicles ⋮ A unified framework for online trip destination prediction
Cites Work
- Unnamed Item
- A note on two problems in connexion with graphs
- Combinatorial bandits
- Asymptotically efficient adaptive allocation rules
- Online joint bid/daily budget optimization of Internet advertising campaigns
- Unsupervised representation learning with minimax distance measures
- Thompson Sampling: An Asymptotically Optimal Finite-Time Analysis
- Optimal Minimax Path of a Single Service Unit on a Network to Nonservice Destinations
- A Tutorial on Thompson Sampling
- 10.1162/153244303321897663
- Introduction to Multi-Armed Bandits
- Fibonacci heaps and their uses in improved network optimization algorithms
- Learning to Optimize via Posterior Sampling
- The Greatest of a Finite Set of Random Variables
This page was built for publication: Online learning of network bottlenecks via minimax paths
