AIBullisharXiv – CS AI · Mar 167/10
🧠Researchers introduce Guided Policy Optimization (GPO), a new reinforcement learning framework that addresses challenges in partially observable environments by co-training a guider with privileged information and a learner through imitation learning. The method demonstrates theoretical optimality comparable to direct RL and shows strong empirical performance across various tasks including continuous control and memory-based challenges.
AINeutralarXiv – CS AI · Jun 236/10
🧠Researchers propose Analytic Policy Gradients (APG), a method that computes exact policy gradients through backpropagation in differentiable simulators, contrasting with model-free approaches like PPO that rely on sampled rewards. Testing across four continuous control tasks shows APG achieves superior sample efficiency, with a segmented backpropagation scheme that mitigates gradient degradation on long-horizon problems.
AINeutralarXiv – CS AI · Jun 196/10
🧠Researchers present PAVE, a theoretical and practical framework addressing policy instability in actor-critic reinforcement learning by stabilizing the critic's Q-function gradient field rather than directly regularizing policy outputs. The work demonstrates that policy smoothness is fundamentally determined by the critic's differential geometry, offering a more principled approach to deploying learned policies in physical systems.
AIBullisharXiv – CS AI · Jun 116/10
🧠Researchers introduce Noise-Guided Transport (NGT), a lightweight machine learning method that enables effective imitation learning with minimal expert demonstrations—as few as 20 data samples. The approach frames imitation as an optimal transport problem solved through adversarial training, requiring no pretraining or specialized hardware while achieving strong performance on complex control tasks.
AINeutralarXiv – CS AI · Jun 96/10
🧠Researchers introduce SV-QD-RL, a reinforcement learning framework that generates diverse policy repertoires by conditioning actor networks on learned structural masks and pairing them with branch-specific critics. The approach demonstrates improved performance on continuous control tasks while maintaining behavioral diversity through structure-aware archive management.
AINeutralarXiv – CS AI · Jun 96/10
🧠Researchers present RLDT, a reinforcement learning algorithm that fine-tunes flow-matching policies by treating policy improvement as density transport toward high-reward regions. The method addresses limitations in existing approaches by preserving multimodal modeling capacity while using Stein Variational Gradient Descent and expected-target estimation to stabilize training across continuous-control tasks.
AINeutralarXiv – CS AI · Jun 56/10
🧠Researchers introduce ReMax Actor-Critic (ReMAC), extending retry-based policy gradient methods from discrete to continuous action spaces. The approach uses pathwise derivative estimators to optimize pass@K and max@K objectives, promoting exploration through policy-gradient landscape reshaping rather than explicit entropy bonuses, achieving performance comparable to SAC.
AIBullisharXiv – CS AI · Jun 56/10
🧠Researchers introduce Reflex, a reinforcement learning framework that exploits reflection symmetry in state-based continuous control tasks to improve sample efficiency. The method integrates with both on-policy (PPO) and off-policy (SAC) algorithms and demonstrates superior performance on standard benchmarks compared to baseline approaches.
🏢 OpenAI🏢 Google
AINeutralarXiv – CS AI · Jun 46/10
🧠Researchers present a theoretical framework for deep reinforcement learning in continuous environments using continuous-time stochastic processes and stochastic control theory. The work establishes a two time-scale model for actor-critic algorithms with neural networks, deriving equations that describe how state distributions evolve during training in the infinite width limit.
AINeutralarXiv – CS AI · Jun 26/10
🧠Researchers present a logic-driven framework using neural certificate functions to evaluate how well reinforcement learning algorithms generalize to unseen tasks. The method validates RL-generated trajectories against key conditions, with empirical results showing that lower certificate violations correlate with higher success rates on test tasks, establishing a principled benchmarking approach for RL generalization.
AINeutralarXiv – CS AI · Jun 25/10
🧠Researchers demonstrate a reinforcement learning framework using the Twin Delayed Deep Deterministic Policy Gradient (TD3) algorithm to control a Twin Rotor Aerodynamic System, achieving superior performance compared to traditional PID controllers in both simulations and real-world laboratory experiments, even under wind disturbance conditions.
AINeutralarXiv – CS AI · Jun 16/10
🧠Researchers introduce Prompted Policy Optimization (PromptPO), a method using large language models as black-box policy optimizers for reinforcement learning tasks. The approach demonstrates competitive or superior performance to traditional RL algorithms in exploration-heavy and robotics domains while requiring fewer environment interactions, though it underperforms in continuous control tasks like MuJoCo.
AINeutralarXiv – CS AI · May 126/10
🧠Researchers conduct a comprehensive benchmarking study of expert-guided reinforcement learning methods, revealing three critical failure modes that single-paper evaluations miss. They propose a decision rule based on pre-training observables to guide method selection, introducing EDGE as a new design point that exposes exploitable architectural dimensions.
AINeutralarXiv – CS AI · May 126/10
🧠Researchers propose a marginalized reparameterization (MRP) estimator to enable practical use of mixture policies in reinforcement learning, addressing a long-standing gap between theoretical potential and practical implementation. By reducing variance compared to likelihood-ratio methods, MRP mixture policies achieve performance parity with standard Gaussian policies while offering greater flexibility in continuous action spaces.
🏢 Google
AINeutralarXiv – CS AI · May 96/10
🧠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.
AINeutralarXiv – CS AI · May 96/10
🧠Researchers propose VPSD-RL, a reinforcement learning framework that discovers value-preserving structures in continuous control tasks using Lie-group operators and diffusion models. The method improves data efficiency and robustness by identifying nonlinear transformations that preserve optimal value functions, addressing brittleness in RL systems under environmental variability.
AIBullisharXiv – CS AI · Mar 166/10
🧠Researchers introduce FastDSAC, a new framework that successfully applies Maximum Entropy Reinforcement Learning to high-dimensional humanoid control tasks. The system uses Dimension-wise Entropy Modulation and continuous distributional critics to achieve 180% and 400% performance gains on challenging control tasks compared to deterministic methods.
AIBullisharXiv – CS AI · Mar 126/10
🧠Researchers propose a novel self-finetuning framework for AI agents that enables continuous learning without handcrafted rewards, demonstrating superior performance in dynamic Radio Access Network slicing tasks. The approach uses bi-perspective reflection to generate autonomous feedback and distill long-term experiences into model parameters, outperforming traditional reinforcement learning methods.
AIBullisharXiv – CS AI · Mar 37/108
🧠Researchers introduce State-Action Inpainting Diffuser (SAID), a new AI framework that addresses signal delay challenges in continuous control and reinforcement learning. SAID combines model-based and model-free approaches using a generative formulation that can be applied to both online and offline RL, demonstrating state-of-the-art performance on delayed control benchmarks.
AINeutralarXiv – CS AI · Mar 36/104
🧠Researchers introduce a new reinforcement learning framework called Distributions-as-Actions (DA) that treats parameterized action distributions as actions, making all action spaces continuous regardless of original type. The approach includes a new policy gradient estimator (DA-PG) with lower variance and a practical actor-critic algorithm (DA-AC) that shows competitive performance across discrete, continuous, and hybrid control tasks.
AIBullisharXiv – CS AI · Mar 26/1014
🧠Researchers introduced AC3 (Actor-Critic for Continuous Chunks), a new reinforcement learning framework that addresses challenges in long-horizon robotic manipulation tasks with sparse rewards. The system uses continuous action chunks with stabilization mechanisms and achieved superior performance on 25 benchmark tasks using minimal demonstrations.
AINeutralarXiv – CS AI · Apr 145/10
🧠Researchers propose Enhanced-FQL(λ), a fuzzy reinforcement learning framework that combines fuzzified eligibility traces and segmented experience replay to improve interpretability and efficiency in continuous control tasks. The method demonstrates competitive performance with neural network approaches while maintaining computational simplicity through interpretable fuzzy rule bases rather than complex black-box architectures.
$FET
