arXiv:2601. 23225v2 Announce Type: replace-cross Abstract: Deep reinforcement learning (RL) is increasingly deployed in resource-constrained environments, yet go-to function approximators - multilayer perceptrons (MLPs) - are often parameter-inefficient due to an imperfect inductive bias for the smooth structure of many value functions.
arXiv:2608. 00737v1 Announce Type: new Abstract: Hard-constrained recurrent physics-informed networks (HRPINNs) embed known dynamics inside a recurrent numerical integrator and restrict a neural branch to learning only the residual dynamics that the first-principles model does not capture.
arXiv:2606. 26002v1 Announce Type: new Abstract: We present HiReLC, a hierarchical ensemble-reinforcement learning framework for automated joint quantization and structured pruning of deep neural networks.
arXiv:2409. 19716v2 Announce Type: replace-cross Abstract: Constrained Reinforcement Learning (RL) has emerged as a significant research area within RL, where integrating constraints with rewards is crucial for enhancing safety and performance across diverse control tasks.
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.
arXiv:2606. 00561v1 Announce Type: cross Abstract: Deep reinforcement learning (RL) offers a promising route to real-time power grid operation, yet large neural policies are costly to evaluate, hard to deploy on constrained hardware, and opaque to operators.
arXiv:2606. 09825v1 Announce Type: cross Abstract: Training reinforcement learning (RL) policies from scratch is costly: it requires careful reward and environment design, extensive tuning, and substantial computation.
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:2501. 12942v2 Announce Type: replace Abstract: Effective multi-user delay-constrained scheduling is crucial in various real-world applications, including embodied AI, instant messaging, live streaming, and data center management, where efficient resource allocation is required among users with diverse delay sensitivities.
RL-VLA$^3$ is a fully asynchronous distributed reinforcement learning framework designed for Vision‑Language‑Action (VLA) model training. It allows fine‑grained asynchronous interaction between simulation, inference, and training via dynamic batching schedulers and flexible environment sharding, addressing the variable, resource‑intensive latencies of physical simulators. Experiments across multiple simulation backends, VLA architectures, and RL algorithms show throughput gains of up to 85.2% over synchronous baselines while preserving sample efficiency, and the system scales from 8 to 256 GPUs.
arXiv:2512. 09084v3 Announce Type: replace Abstract: The Kolmogorov-Arnold representation theorem offers a theoretical alternative to Multi-Layer Perceptrons (MLPs) by placing learnable univariate functions on edges rather than nodes.
BVR Sim is an open‑source, Gymnasium‑style environment for heterogeneous air‑combat reinforcement learning, supporting multiple JSBSim aircraft models (F‑15, F‑16, F/A‑18, F‑22) with configurable weapons, sensors, and opponents. It offers a unified tactical action interface, interchangeable Python and accelerated C++ backends, entity‑oriented observations, compositional rewards, scripted opponents, replay and visualization, and adapters for multi‑agent learning frameworks. At a 0.4‑second decision interval, the C++ backend achieves 104 simulated seconds per wall‑clock second in 1‑vs‑1 and remains practical through 10‑vs‑10 scenarios, and a policy trained on the F‑16 transfers to four unseen aircraft with a 45.5% mean win rate after controller adaptation.
arXiv:2605. 05481v2 Announce Type: replace Abstract: We revisit a classic "chicken-and-egg" problem in reinforcement learning: to safely improve a policy, the value function must be accurate on the state-visitation distribution of the updated policy.