7 articles tagged with #offline-reinforcement-learning. AI-curated summaries with sentiment analysis and key takeaways from 50+ sources.
Researchers propose Generative Trajectory Policies (GTPs), a unified framework for offline reinforcement learning that bridges the performance gap between slow diffusion models and fast consistency policies by learning continuous-time generative trajectories. The approach achieves state-of-the-art results on D4RL benchmarks, including perfect scores on difficult AntMaze tasks.
Researchers introduce a Goal-Conditioned Decision Transformer designed for offline reinforcement learning in robotics, enabling multi-goal task learning from pre-collected datasets. The method demonstrates superior performance compared to online baselines on complex robotic tasks while maintaining effectiveness in sparse-reward environments with limited expert data.
Researchers introduce RL4F, an open-source benchmark for applying offline reinforcement learning to plasma control in nuclear fusion reactors. Using historical data from the DIII-D tokamak, the framework enables safe algorithm development without costly real-device experimentation, with model-based RL methods showing superior performance across multiple plasma control objectives.
Researchers propose Posterior Hybrid Bayesian Belief (PhyB), a new method for offline reinforcement learning that efficiently manages uncertainty in policy optimization. The approach reformulates complex Bayesian objectives into tractable convex combinations of dynamics models, achieving state-of-the-art performance while providing theoretical guarantees for convergence.
Researchers introduce SPAR (Support-Preserving Action Rectification), a new offline reinforcement learning method that addresses the fundamental tension between maximizing value and staying true to training data. By anchoring policy improvements to frozen behavior cloning and operating in residual space, SPAR achieves state-of-the-art results on D4RL benchmarks while maintaining data distribution fidelity.
Researchers propose Posterior Sampling-based Policy Optimization (PSPO), a novel approach to offline reinforcement learning that addresses the critical challenge of balancing model generalization with robustness against exploitation errors. By formulating dynamics modeling as Bayesian inference, PSPO enables safer learning from out-of-distribution data while maintaining theoretical convergence guarantees.
Researchers introduce Maximum Entropy Adjoint Matching (ME-AM), a new framework for offline reinforcement learning that combines flow-matching generative policies with entropy regularization to overcome limitations in existing Q-learning approaches. The method addresses popularity bias and support binding issues that prevent agents from discovering high-reward actions in low-density regions, demonstrating competitive performance across continuous control benchmarks.
