Learning And Information In Stochastic Networks And Queues

Abstract

We review the role of information and learning in the stability and optimization of queueing systems. In recent years, techniques from supervised learning, bandit learning and reinforcement learning have been applied to queueing systems supported by increasing role of information in decision making. We present observations and new results that help rationalize the application of these areas to queueing systems. We prove that the MaxWeight and BackPressure policies are an application of Blackwell's Approachability Theorem. This connects queueing theoretic results with adversarial learning. We then discuss the requirements of statistical learning for service parameter estimation. As an example, we show how queue size regret can be bounded when applying a perceptron algorithm to classify service. Next, we discuss the role of state information in improved decision making. Here we contrast the roles of epistemic information (information on uncertain parameters) and aleatoric information (

Stats

• citations15
• S2 citations—
• github stars0
• HF likes0
• heat score9.03
• arxiv keywalton2021learning

Related papers

• Intervention-assisted Policy Gradient Methods For Online Stochastic Queuing Network Optimization: Technical Report (2024)0.00
• Information-theoretic Methods For Planning And Learning In Partially Observable Markov Decision Processes (2016)0.00
• Stable Reinforcement Learning With Unbounded State Space (2020)0.00
• On Information Asymmetry In Competitive Multi-agent Reinforcement Learning: Convergence And Optimality (2020)0.00
• Quantifying The Impact Of Non-stationarity In Reinforcement Learning-based Traffic Signal Control (2020)8.35
• Information Theoretic Model Predictive Q-learning (2019)0.00
• On The Stability Of Learning In Network Games With Many Players (2024)0.00
• Decentralized Optimal Equilibrium Learning In Stochastic Games Via Single-bit Feedback (2026)0.00