Reinforcement Learning for Adaptive Routing
Leonid Peshkin, Virginia Savova
Abstract
Reinforcement learning means learning a policy--a mapping of observations into actions--based on feedback from the environment. The learning can be viewed as browsing a set of policies while evaluating them by trial through interaction with the environment. We present an application of gradient ascent algorithm for reinforcement learning to a complex domain of packet routing in network communication and compare the performance of this algorithm to other routing methods on a benchmark problem.
Create a lesson
Related papers
SPLICE: Sparse Physics Library Identification and Compositional Expansion
Lucas Thil, Jesse Read, Guillaume Doquet et al.
LLM Evaluation is a Forecasting Problem
Rahul Thomas, Adam Block, Micah Goldblum
ProbabilityBench: Model Evaluation and Calibration with Exact Ground-Truth Uncertainty
Yuyang Dai, Yuting Tang, Futoshi Futami et al.
MAGNET: Manifold-Aware Graph Diffusion Network for Connectome Generation
Protyay Dey, Ayush Roy, Hyuna Cho et al.
Mixture of GFlowNets
Omar G. Younis, Joseph D. Viviano, Chirayu Anant Haryan et al.
A physics-coupled graph neural operator for mid-plane six-component stress tensor field prediction in concrete penetration
Wenpu Du, Peng Zhou, Yunlong Xia et al.