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 propose PVPO, a sample-efficient reinforcement learning method that improves LLM-based LEGO assembly generation by addressing PhysHack, a failure mode where structures satisfy physical constraints but lack semantic or geometric coherence. The approach uses selective data training and couples physical feasibility with geometric rewards, achieving better structural alignment while reducing reliance on rejection sampling.
AINeutralarXiv – CS AI · Jun 56/10
🧠Researchers present CERO, a method for optimizing reinforcement learning post-training in large language models by dynamically allocating rollout budgets across prompts based on their training signal value. The approach uses Bayesian inference to estimate which prompts benefit most from additional computation, improving sample efficiency compared to fixed-budget methods.
AIBullisharXiv – CS AI · Jun 56/10
🧠Researchers propose iCEM+TL, a framework combining the Cross-Entropy Method with transfer learning to improve robotic manipulation planning efficiency. The approach achieves up to 23% success rate improvements in complex tasks like stacking and shelf placement, with validation demonstrated on a real Franka Emika robot.
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 56/10
🧠Researchers propose Extreme Region Policy Distillation (ERPD), a two-stage framework that improves reinforcement learning efficiency for large language models by first extracting maximum training signals through aggressive off-policy optimization, then distilling those signals into a base policy with tighter constraints. The approach achieves comparable or better performance with significantly reduced KL divergence, addressing a fundamental trade-off between sample efficiency and asymptotic performance in LLM training.
AINeutralarXiv – CS AI · Jun 46/10
🧠Researchers propose a rollout-level advantage-prioritized experience replay system for GRPO (Group Relative Policy Optimization) that improves sample efficiency in LLM post-training. By storing individual rollouts with age-based eviction and prioritizing high-advantage samples, the method achieves 4.35 percentage point gains on math benchmarks while maintaining on-policy data freshness.
AINeutralarXiv – CS AI · Jun 46/10
🧠Researchers propose simplicial embeddings, a lightweight geometric technique that constrains neural network representations to discrete, sparse structures, improving sample efficiency in reinforcement learning agents. When integrated into popular actor-critic algorithms like PPO and FastTD3, the method enhances performance and learning speed across diverse control tasks without sacrificing computational speed.
AINeutralarXiv – CS AI · Jun 26/10
🧠Researchers introduce MulFeRL, a reinforcement learning framework that uses multi-turn verbal feedback to improve AI reasoning on failed tasks. By converting qualitative feedback into trainable signals and assigning credit for incremental progress, the approach outperforms traditional reward-based methods on math problems and generalizes well to unseen domains.
AIBullisharXiv – CS AI · Jun 26/10
🧠Researchers propose statistically sound algorithms for evaluating machine learning models using synthetic data generated by AI systems, reducing reliance on expensive human annotations. The approach maintains unbiased results while improving sample efficiency by up to 50% in GPT-4 experiments, addressing a significant bottleneck in ML development.
🧠 GPT-4
AIBullisharXiv – CS AI · Jun 26/10
🧠Researchers provide theoretical and empirical evidence that Predictive Inverse Dynamics Models (PIDM) outperform traditional Behavior Cloning in offline imitation learning by introducing a bias-variance tradeoff. PIDM requires significantly fewer expert demonstrations—up to 5x fewer in 2D tasks and 66% fewer in complex 3D environments—while maintaining comparable performance, offering practical advantages for training AI systems with limited data.
AINeutralarXiv – CS AI · Jun 16/10
🧠Researchers introduce World Action Verifier (WAV), a framework that enables world models to self-correct prediction errors by decomposing action-conditioned predictions into verifiable components: state plausibility and action reachability. The approach achieves 2x higher sample efficiency and 22% policy performance improvements across robotic control tasks by leveraging asymmetries in data availability and feature dimensionality.
AIBullisharXiv – CS AI · May 296/10
🧠Researchers propose PACED-RL, a novel post-training framework that reinterprets the partition function in GFlowNet-based LLM training as a difficulty scheduler rather than merely a normalizer. By leveraging per-prompt accuracy signals, the method improves sample efficiency and maintains generation diversity while outperforming existing reward-maximizing approaches.
AIBullisharXiv – CS AI · May 276/10
🧠Researchers introduce R²VPO, a new reinforcement learning method that replaces hard clipping mechanisms with ratio-variance regularization to improve policy optimization. Tested across large language models and robotic control tasks, the approach achieves better performance on mathematical reasoning and sample efficiency while maintaining stable learning.
$VPO
AINeutralarXiv – CS AI · May 126/10
🧠Researchers introduce Neuro-Symbolic Experience Replay (NSER), a framework that enhances reinforcement learning by combining Large Language Models with symbolic logic to transform passive memory buffers into active knowledge construction systems. The approach grounds LLM-generated behavioral rules into differentiable logic representations, enabling more efficient policy optimization across multiple benchmark environments.
AINeutralarXiv – CS AI · May 116/10
🧠Researchers introduce POETS, a novel framework that optimizes large language models through compute-efficient policy ensembles while quantifying uncertainty. By leveraging KL-regularized Thompson sampling and shared backbone architectures with independent LoRA branches, POETS achieves superior sample efficiency in scientific discovery tasks while reducing computational overhead compared to traditional ensemble methods.
AINeutralarXiv – CS AI · May 116/10
🧠Researchers propose Direct Reasoning Optimization (DRO), a constrained reinforcement learning framework that improves LLM training on unverifiable tasks by combining token-level reasoning rewards with rubric-based feasibility gates. The approach demonstrates faster, more sample-efficient learning across scientific, medical, legal, and financial domains.
AIBullisharXiv – CS AI · May 116/10
🧠Researchers introduce Goldilocks, a curriculum learning strategy that improves reinforcement learning efficiency for language models by having a teacher model dynamically select training questions of optimal difficulty for the student model. This addresses the sample inefficiency problem in sparse-reward RL training and demonstrates performance gains on reasoning tasks compared to standard approaches.
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.
AINeutralarXiv – CS AI · May 76/10
🧠Researchers propose a generalization of differential temporal difference (TD) methods that extends their applicability from infinite-horizon to episodic reinforcement learning problems. By addressing how reward centering affects policy optimization in episodic settings, the work maintains theoretical guarantees while empirically demonstrating improved sample efficiency across multiple algorithms and environments.
AINeutralarXiv – CS AI · May 16/10
🧠Researchers introduce EXPO, a reinforcement learning algorithm that trains expressive policies (like diffusion models) more efficiently by avoiding direct value optimization. The method uses a lightweight Gaussian policy to edit actions from a base policy, achieving 2-3x improvements in sample efficiency for both offline-to-online and fine-tuning scenarios.
AINeutralarXiv – CS AI · Apr 136/10
🧠Researchers introduce WOMBET, a framework that improves reinforcement learning efficiency in robotics by generating synthetic training data from a world model in source tasks and selectively transferring it to target tasks. The approach combines offline-to-online learning with uncertainty-aware planning to reduce data collection costs while maintaining robustness.
AIBullisharXiv – CS AI · Apr 136/10
🧠Researchers propose a neuro-symbolic deep reinforcement learning approach that integrates logical rules and symbolic knowledge to improve sample efficiency and generalization in RL systems. The method transfers partial policies from simple tasks to complex ones, reducing training data requirements and improving performance in sparse-reward environments compared to existing baselines.
AIBullisharXiv – CS AI · Mar 176/10
🧠Researchers propose MA-VLCM, a framework that uses pretrained vision-language models as centralized critics in multi-agent reinforcement learning instead of learning critics from scratch. This approach significantly improves sample efficiency and enables zero-shot generalization while producing compact policies suitable for resource-constrained robots.
AIBullisharXiv – CS AI · Mar 176/10
🧠Researchers introduce XQC, a deep reinforcement learning algorithm that achieves state-of-the-art sample efficiency by optimizing the critic network's condition number through batch normalization, weight normalization, and distributional cross-entropy loss. The method outperforms existing approaches across 70 continuous control tasks while using fewer parameters.
