The paper introduces LFPG‑RL, a reinforcement‑learning approach that estimates dynamic origin‑destination matrices in real time by integrating link‑flow propagation guidance into proximal policy optimization. LFPG‑RL transforms aggregate link‑flow errors into OD‑specific advantages, enabling a single forward pass during deployment. Evaluated on Melbourne arterial network data, it achieves low RMSE, MAPE, and high correlation, outperforming existing calibration methods.
arXiv:2511. 06229v3 Announce Type: replace Abstract: This paper focuses on dynamic origin-destination matrix estimation (DODE), a crucial calibration process necessary for the effective application of microscopic traffic simulations.
The paper introduces Network Feasibility Geometry Reinforcement Learning (NFG‑RL), a method that enforces multi‑layer network constraints—such as interference, power‑rate coupling, flow conservation, service chains, capacity, latency, and reliability—by transporting a proto‑policy through a differentiable feasibility map. By compiling heterogeneous constraints into typed residual blocks and using a variational transport operator, NFG‑RL ensures almost‑sure feasible execution and shapes exploration and gradients to respect active constraints. Experiments on two wireless‑edge surrogate environments show that NFG‑RL boosts feasible utility by 37.5–41.5 %, cuts raw‑action violations by 48.5–60.8 %, and reduces P99 delay by 57.0–75.5 % compared to leading baselines.
arXiv:2607. 11720v1 Announce Type: cross Abstract: Background: Offline reinforcement learning (RL) enables effective policies to be trained from large, previously collected datasets and subsequently improved through limited online interaction.
The paper introduces Solver-Gradient Guided Reinforcement Learning (SG‑RL), a method that augments standard RL with bounded gradients from a differentiable MPC solver to adapt cost‑function weights online. SG‑RL integrates solver‑gradient guidance into PPO through actor‑update scaling, policy loss, advantage estimation, and value‑function learning, achieving comparable or superior closed‑loop performance while requiring up to 70.6% fewer samples. Experiments on two autonomous racing platforms with intentional model mismatch demonstrate that SG‑RL outperforms both RL and gradient‑based policy learning baselines and generalizes zero‑shot to unseen environments.
arXiv:2510. 17709v2 Announce Type: replace-cross Abstract: Training Reinforcement Learning (RL) policies using simulation models before deployment in real-world environments is a common strategy when real-world interaction is expensive.
Background: Offline reinforcement learning (RL) enables effective policies to be trained from large, previously collected datasets and subsequently improved through limited online interaction. This offline-to-online RL (O2O-RL) paradigm is particularly promising in nonstationary domains where interaction is costly or potentially hazardous.
arXiv:2606. 08602v1 Announce Type: cross Abstract: We present an online reinforcement learning (RL) algorithm for fine-tuning flow-matching policies in continuous-control problems.
arXiv:2508. 17218v4 Announce Type: replace Abstract: Correlated link travel times create decision-relevant patterns in partial route histories.
The paper proposes a deployment‑focused framework for deadline‑constrained network control, introducing the Effective Congestion (EC) metric family and Uniform Path Grouping (UPG) heuristic to better capture traffic urgency and balance load. It integrates these with a Multi‑Agent Deep Reinforcement Learning architecture (MADRL EC (p*)) that combines a distributed scheduler and a centralized RL router. A unified training objective merges live‑reward, pre‑collected‑reward, and policy‑imitation terms, leading to the Model‑Guided Annealed Reinforcement Learning (MGA‑RL) protocol built on DDPG, which generalizes offline‑to‑online learning for demonstration‑driven training.
arXiv:2608.28878v1 Announce Type: cross Abstract: This paper develops a hybrid offline-online multi-agent reinforcement learning framework based on decision transformers. The policy is first pretrain...
arXiv:2610.01413v1 Announce Type: cross Abstract: Reinforcement learning (RL) algorithms frequently compare probability distributions, such as state visitation distributions induced by policies and e...
arXiv:2510. 03494v2 Announce Type: replace Abstract: We study finite-horizon offline reinforcement learning (RL) with function approximation for both policy evaluation and policy optimization.