Optimistic Learning for Communication Networks
Not on the map. Why?
Abstract (arXiv)
AI/ML-based tools are at the forefront of resource management solutions for communication networks. Deep learning, in particular, is highly effective in facilitating fast and high-performing decision-making whenever representative training data is available to build offline accurate models. Conversely, online learning solutions do not require training and enable adaptive decisions based on runtime observations, alas are often overly conservative. This extensive tutorial proposes the use of optimistic learning (OpL) as a decision engine for resource management frameworks in modern communication systems. When properly designed, such solutions can achieve fast and high-performing decisions -- comparable to offline-trained models -- while preserving the robustness and performance guarantees of the respective online learning approaches. We introduce the fundamental concepts, algorithms and results of OpL, discuss the roots of this theory and present different approaches to defining and achieving optimism. We proceed to showcase how OpL can enhance resource management in communication networks for several key problems such as caching, edge computing, network slicing, and workload assignment in decentralized O-RAN platforms. Finally, we discuss the open challenges that must be addressed to unlock the full potential of this new resource management approach.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 73 of its 151 references that are in the map. First posted on arXiv 4 Apr 2025.
Builds on
73 of 151 references.
References · 73
- 2021Convex optimizationcited by 2,479
- 2019Introduction to Online Convex Optimizationcited by 793
- 2019Online Learning: A Modern Introduction Using Convex Optimizationcited by 407
- 2018Competitive caching with machine learned advicecited by 194
- 2013Online Learning under Delayed Feedbackcited by 137
- 2016Coin Betting and Parameter-Free Online Learningcited by 131
- 2018Black-Box Reductions for Parameter-free Online Learning in Banach Spacescited by 124
- 2018Deep Learning in Mobile and Wireless Networking: A Surveycited by 117
- 2017Online Convex Optimization with Stochastic Constraintscited by 94
- 2019Online Control with Adversarial Disturbancescited by 92
- 2014Bandits with concave rewards and convex knapsackscited by 83
- 2018Adversarial Bandits with Knapsackscited by 73
38 more
- 2017Deep Learning-Based Communication Over the Aircited by 72
- 2015Adaptive Algorithms for Online Convex Optimization with Long-term Constraintscited by 65
- 2013Online Learning with Switching Costs and Other Adaptive Adversariescited by 60
- 2018Online convex optimization for cumulative constraintscited by 47
- 2017An Online Convex Optimization Approach to Dynamic Network Resource Allocationcited by 42
- 20216G Internet of Things: A Comprehensive Surveycited by 39
- 2020Online Learning with Imperfect Hintscited by 37
- 2021Online Learning with Optimism and Delaycited by 33
- 2020Minimizing Dynamic Regret and Adaptive Regret Simultaneouslycited by 30
- 2021Revisiting Smoothed Online Learningcited by 29
- 2019Distributed Online Convex Optimization with Time-Varying Coupled Inequality Constraintscited by 28
- 2014Online Linear Optimization via Smoothingcited by 23
- 2017A Modular Analysis of Adaptive (Non-)Convex Optimization: Optimism, Composite Objectives, and Variational Boundscited by 23
- 2019Combining Online Learning Guaranteescited by 22
- 2023Optimistic Online Mirror Descent for Bridging Stochastic and Adversarial Online Convex Optimizationcited by 22
- 2022Between Stochastic and Adversarial Online Convex Optimization: Improved Regret Bounds via Smoothnesscited by 21
- 2020Projection-free Online Learning over Strongly Convex Setscited by 20
- 2018Bandit Online Learning with Unknown Delayscited by 18
- 2019Machine Learning for Resource Management in Cellular and IoT Networks: Potentials, Current Solutions, and Open Challengescited by 18
- 2023Machine Learning for Large-Scale Optimization in 6G Wireless Networkscited by 18
- 2015A Tale of Two Metrics: Simultaneous Bounds on Competitiveness and Regretcited by 17
- 2022Follow-the-Perturbed-Leader for Adversarial Markov Decision Processes with Bandit Feedbackcited by 16
- 2019Learning to Cache With No Regretscited by 15
- 2022Enabling Long-term Fairness in Dynamic Resource Allocationcited by 15
- 2020LeadCache: Regret-Optimal Caching in Networkscited by 14
- 2019Online Convex Optimization with Perturbed Constraintscited by 12
- 2021No-Regret Caching via Online Mirror Descentcited by 12
- 2021Online Caching with Optimal Switching Regretcited by 11
- 2022Leveraging the Hints: Adaptive Bidding in Repeated First-Price Auctionscited by 11
- 2023Data-Dependent Bounds for Online Portfolio Selection Without Lipschitzness and Smoothnesscited by 11
- 2024An Optimistic Algorithm for Online Convex Optimization with Adversarial Constraintscited by 11
- 2020Follow the Perturbed Leader: Optimism and Fast Parallel Algorithms for Smooth Minimax Gamescited by 10
- 2022Smoothed Online Optimization with Unreliable Predictionscited by 10
- 2022Optimistic No-regret Algorithms for Discrete Cachingcited by 10
- 2018The Role of Caching in Future Communication Systems and Networkscited by 9
- 2024Beyond the Edge: An Advanced Exploration of Reinforcement Learning for Mobile Edge Computing, its Applications, and Future Research Trajectoriescited by 9
- 2024An Equivalence Between Static and Dynamic Regret Minimizationcited by 9
- 2016Wireless Caching: Technical Misconceptions and Business Barrierscited by 7
50 most cited of 73 All 73 (JSON)
Built on by
Not cited yet.