AIBullisharXiv – CS AI · Apr 137/10
🧠Researchers propose Advantage-Guided Diffusion (AGD-MBRL), a novel approach that improves model-based reinforcement learning by using advantage estimates to guide diffusion models during trajectory generation. The method addresses the short-horizon myopia problem in existing diffusion-based world models and demonstrates 2x performance improvements over current baselines on MuJoCo control tasks.
AINeutralarXiv – CS AI · Jun 235/10
🧠Researchers propose NASDAQ, a reinforcement learning framework that addresses performance degradation in low-dimensional observation tasks by normalizing observation spaces before dynamics prediction. The method balances reconstruction losses across observation dimensions and achieves competitive performance with faster training than existing model-based and self-predictive RL approaches.
AINeutralarXiv – CS AI · Jun 235/10
🧠Researchers introduce UBP2, a model-based reinforcement learning method that improves sample efficiency in preference-based learning by actively directing exploration through uncertainty quantification across reward, dynamics, and value functions. The approach achieves sublinear regret guarantees and demonstrates substantially higher sample efficiency than existing methods on benchmark tasks.
AINeutralarXiv – CS AI · Jun 106/10
🧠Researchers introduce QR-MAX, a model-based reinforcement learning algorithm designed for non-Markovian reward decision processes that depend on complete system history rather than current state alone. The algorithm provides formal PAC convergence guarantees with polynomial sample complexity, advancing a previously under-theorized area of RL with practical applications to temporal-dependency tasks.
AINeutralarXiv – CS AI · Jun 96/10
🧠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.
AINeutralarXiv – CS AI · May 276/10
🧠Researchers propose HyperCRL, a continual learning method for model-based reinforcement learning that uses task-conditional hypernetworks to efficiently learn dynamics models across sequential tasks without retraining on historical data. The approach maintains fixed-capacity networks while achieving competitive performance with methods that store growing amounts of past experience, enabling faster training cycles critical for long-horizon robot learning applications.
AINeutralarXiv – CS AI · May 116/10
🧠Researchers propose AGWM (Affordance-Grounded World Models), a machine learning framework that improves how AI agents understand which actions are executable in dynamic environments by explicitly tracking prerequisite dependencies. The approach addresses a fundamental limitation in conventional world models that fail to account for how actions reshape the availability of future actions, reducing multi-step prediction errors and improving generalization.
AINeutralarXiv – CS AI · May 116/10
🧠Researchers develop a hybrid neural network approach for solving Hamilton-Jacobi-Bellman equations in continuous-time reinforcement learning, combining physics-informed neural solvers with stabilized finite-difference methods. The work provides rigorous error analysis separating residual, policy, and model-identification errors, with experimental validation across multiple control benchmarks.
AIBullisharXiv – CS AI · Mar 37/108
🧠Researchers propose EfficientZero-Multitask (EZ-M), a multi-task model-based reinforcement learning algorithm that scales the number of tasks rather than samples per task for robotics training. The approach achieves state-of-the-art performance on HumanoidBench with significantly higher sample efficiency by leveraging shared world models across diverse tasks.
AINeutralarXiv – CS AI · Mar 34/104
🧠Researchers introduce COMBRL, a new reinforcement learning algorithm designed for continuous-time systems using nonlinear ordinary differential equations. The algorithm achieves sublinear regret and better sample efficiency compared to existing methods by combining probabilistic models with uncertainty-aware exploration.
