AIBullisharXiv – CS AI · Jun 106/10
🧠Researchers develop an event-driven reinforcement learning framework for optimizing semiconductor manufacturing operations, demonstrating significant improvements in throughput and utilization across complex production systems. The approach addresses long-horizon control challenges inherent in wafer fabrication by coordinating system-wide decisions through a centralized agent policy.
AIBullisharXiv – CS AI · Jun 96/10
🧠Researchers introduce CLPO, a curriculum learning framework that dynamically adapts training difficulty for large language models during reinforcement learning. The approach automatically identifies solved, medium, and hard problems, then strategically restructures tasks to match the model's evolving capabilities, achieving substantial improvements over existing methods on mathematical and reasoning benchmarks.
AINeutralarXiv – CS AI · Jun 96/10
🧠Researchers propose Position-Aware Entropy Calibration (PAEC), a novel technique that selectively manages entropy in reinforcement learning systems used to improve large language model reasoning. The method addresses policy-entropy collapse by applying targeted entropy penalties only at decision-critical token positions rather than uniformly across all tokens, demonstrating improved performance on mathematical reasoning benchmarks.
AIBullisharXiv – CS AI · Jun 96/10
🧠Researchers introduce ISPO (Intrinsic Signal Policy Optimization), a new reinforcement learning method that improves long-chain reasoning in large language models by densifying reward signals with intrinsic metrics derived from the model's own probabilities. The approach addresses critical failure modes in existing GRPO-based methods and shows consistent improvements across mathematical reasoning benchmarks.
AINeutralarXiv – CS AI · Jun 96/10
🧠Researchers propose T²-GRPO, a reinforcement learning framework that optimizes large language models for dementia caregiver agents by balancing immediate patient feedback with long-term care outcomes. The method uses environment-grounded rewards and safety constraints to improve emotional intelligence in AI caregiving scenarios.
AIBullisharXiv – CS AI · Jun 96/10
🧠Researchers introduce AdaGRPO, a reinforcement learning framework that selectively applies reward signals in generative recommendation systems rather than uniformly, addressing the problem of noisy reward models trained on biased data. The approach combines supervised learning with adaptive gating mechanisms and demonstrates significant improvements in e-commerce recommendation metrics and production performance.
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 86/10
🧠Researchers propose CHDP (Cooperative Hybrid Diffusion Policies), a novel reinforcement learning framework that addresses the challenge of optimizing hybrid action spaces combining discrete and continuous parameters. The method employs two cooperative agents with separate diffusion policies and achieves up to 19.3% performance improvement over existing approaches in robot control and game AI applications.
AINeutralarXiv – CS AI · Jun 56/10
🧠Researchers propose TAPO (Tool-Aware Policy Optimization), a method that fixes credit misassignment problems in reinforcement learning for multimodal search agents. The technique improves training efficiency for AI systems that use tools, delivering consistent improvements across multiple benchmarks without requiring additional annotations or computational overhead.
AINeutralarXiv – CS AI · Jun 56/10
🧠Researchers propose MDP-GRPO, an improved reinforcement learning method that stabilizes group relative policy optimization for instruction-following tasks by addressing three fundamental instabilities in reward normalization. The technique achieves up to 5% improvement in constraint satisfaction on language models while maintaining general performance capabilities.
🧠 Llama
AINeutralarXiv – CS AI · Jun 56/10
🧠Researchers have developed TLA-Prover, a 20-billion-parameter AI model that significantly improves the synthesis of TLA+ formal specifications for distributed systems, achieving 30% correctness on verified benchmarks—roughly 3.5x better than previous baselines. The model combines supervised fine-tuning with repair-based policy optimization and uses TLC model checker feedback directly as a reward signal, eliminating the need for learned reward models.
AINeutralarXiv – CS AI · Jun 56/10
🧠Researchers demonstrate that sparse reward functions outperform dense, engineered rewards when training autonomous cyber defence agents using deep reinforcement learning. The study reveals that sparse rewards produce more reliable training, lower-risk policies, and better alignment with defender objectives without explicit penalties for costly actions.
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 45/10
🧠Researchers developed Neetyabhas, an agent-based simulation framework that models pandemic policy decisions under real-world uncertainty, incorporating individual behavioral choices and imperfect data. Using reinforcement learning, the model demonstrates that masks and vaccines effectively reduce outbreak severity when policies account for implementation errors and measurement gaps.
AIBullisharXiv – CS AI · Jun 46/10
🧠Researchers introduce BiasGRPO, a novel framework using Group Relative Policy Optimization to mitigate social bias in Large Language Models more effectively than existing methods. The approach stabilizes training in high-variance reward landscapes by normalizing rewards across sampled completions, outperforming Direct Preference Optimization and Proximal Policy Optimization while maintaining computational efficiency.
AINeutralarXiv – CS AI · Jun 46/10
🧠Researchers demonstrate that the Boolean Task Algebra (BTA) framework for reinforcement learning can be substantially simplified by eliminating redundant base tasks. Their goal-set-based composition method achieves comparable performance while reducing computational costs for both learning and composition across diverse environments, with experiments showing that additional base tasks provide no performance benefits.
AINeutralarXiv – CS AI · Jun 46/10
🧠Researchers prove that success conditioning—a widely-used policy improvement technique in machine learning—solves a specific trust-region optimization problem with automatic regularization. The method emerges as a conservative improvement operator that cannot degrade performance, making it theoretically sound for applications like reinforcement learning and imitation learning.
AINeutralarXiv – CS AI · Jun 46/10
🧠Researchers present a novel approach to training task-oriented dialogue agents that enables proactive behavior through a Cognitive User Simulator and asymmetric policy optimization. The method addresses a fundamental limitation in LLM-based dialogue systems by conditioning agent responses on modeled user concerns, achieving persuasive capabilities beyond what traditional reinforcement learning methods can accomplish.
AINeutralarXiv – CS AI · Jun 46/10
🧠Researchers present a unified mathematical framework for certifying locality in scalable multi-agent reinforcement learning (MARL) systems by decomposing the state-transition matrix into environment and policy sensitivity components. The approach uses spectral radius analysis to weaken prior Dobrushin bounds and applies temperature-scaled softmax policies to control locality, enabling exponentially decaying truncation bias in networked agent systems.
AINeutralarXiv – CS AI · Jun 26/10
🧠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.
AINeutralarXiv – CS AI · Jun 26/10
🧠Researchers introduce ReSkill, an RL-in-the-loop framework that improves how AI agents create and refine reusable skills during policy learning. The method synchronizes skill evolution with policy optimization, enabling agents to automatically develop, test, and prune strategies that generalize across tasks more effectively than existing approaches.
🏢 Anthropic
AIBullisharXiv – CS AI · Jun 26/10
🧠Researchers propose EAPO, a reinforcement learning framework that teaches AI agents to use external tools selectively rather than excessively. The method improves accuracy while reducing redundant tool calls by 18-25% across multiple language models, demonstrating that agents can learn optimal tool-use patterns without compromising reasoning capabilities.
🧠 Llama
AIBullisharXiv – CS AI · Jun 26/10
🧠Researchers propose DriftQL, a new offline reinforcement learning method that combines drift-based behavioral regularization with critic-driven policy improvement to outperform diffusion and flow-based policies. The approach achieves single forward-pass inference while maintaining robustness under degraded data quality, advancing state-of-the-art performance on standard benchmarks.
AIBullisharXiv – CS AI · Jun 26/10
🧠Researchers propose PaW, a co-training framework that enhances language model agents by simultaneously optimizing reinforcement learning policies and world models using data from standard RL rollouts. The approach eliminates the need for separate simulators or training stages while demonstrating consistent improvements across multiple benchmarks.
AINeutralarXiv – CS AI · Jun 26/10
🧠Researchers investigate when multi-agent reinforcement learning improves large language model workflows, comparing shared versus isolated policy training approaches across three model scales. The study reveals that policy-sharing is a conditional design tradeoff rather than a universal stability solution, with performance dependent on workflow topology, task type, and model scale rather than policy architecture alone.
