arXiv:2607. 29559v1 Announce Type: new Abstract: Reinforcement Learning (RL) systems are typically trained using a single, well-specified scalar reward function.
By Manith Adikari, Bei Peng, Samuele Vinanzi, Angelo Cangelosi
arXiv:2607. 29246v1 Announce Type: new Abstract: Modern large language models (LLMs) are expected not just to answer correctly, but to adapt their behavior to different human values and use cases.
By Ruiming Liang, Yi Zhong, Yizhen Yuan, Yinan Zheng, Tianyi Tan, Tianyue Wang, Haiyun Guo, Jinqiao Wang, Xianyuan Zhan
arXiv:2605.09364v2 Announce Type: replace
Abstract: This paper investigates robust representation learning in offline goal-conditioned reinforcement learning (GCRL). Particularly in sparse reward sce...
By Valliappan Chidambaram Adaikkappan, Sai Rajeswar, Pietro Mazzaglia, David Meger
arXiv:2609.08211v1 Announce Type: new
Abstract: Real-world Multi-Objective Reinforcement Learning (MORL) often suffers from sparse rewards, reward conflicts, and late-stage reward tug-of-war, causing...
By Shanwen Mao, Hao Zhang, Guangtao nie, Zhiheng Li, Huimu Wang, Sulong Xu, Gu Simiu
arXiv:2602. 07764v2 Announce Type: replace-cross Abstract: Multi-objective reinforcement learning (MORL) seeks to train agents capable of balancing conflicting objectives.
By Tanmay Ambadkar, Sourav Panda, Shreyash Kale, Jonathan Dodge, Abhinav Verma
The paper introduces Meta-Gradient Informed Multi-Objective Multi-Agent Reinforcement Learning (MIRL), a framework that leverages the structure of multiple objectives to enhance cooperation among agents. By formulating MOMARL at both team and individual levels and using objective-wise counterfactual credit assignment, MIRL allows agents to learn how to prioritize objectives individually while jointly optimizing a system-level objective. Experiments on a multi-objective particle environment demonstrate that MIRL, especially its dynamic variant, improves Pareto-front quality compared to baseline methods.
By Qiyue Xia, J. Michael Herrmann
The paper introduces a process‑aware evaluation framework for cooperative multi‑agent reinforcement learning that supplements traditional outcome metrics with diagnostics of interference, coordinated task completion, participation, and coordination efficiency. Using the STAT testbed and two established benchmarks, the authors demonstrate that policies with similar returns can differ markedly in coordination behavior, and that reward shaping can alter coordination without affecting overall task return. The framework reveals distinct process signatures across spatial, task, and agent scaling and remains informative across different coordination mechanisms.
By Maria Ana Cardei, Matthew Landers, Afsaneh Doryab
arXiv:2602.05863v3 Announce Type: replace
Abstract: Group Relative Policy Optimization (GRPO) remains the dominant critic-free approach for fine-tuning LLMs and VLMs, but its compatibility with const...
By Roger Girgis, Rodrigue de Schaetzen, Luke Rowe, Azal\'ee Robitaille, Christopher Pal, Liam Paull
The paper introduces objective‑conflict coefficients to measure how competing goals affect learning efficiency in multi‑objective reinforcement learning. It proposes a routed ensemble policy algorithm that keeps a small set of basis policies and routes trajectories to the most promising one, and a kernel surrogate trajectory attribution method that estimates how feedback from one trajectory influences learning on others. Experiments on Meta‑World and MO‑Gymnasium show routed ensembles boost average performance by 4.3% and the kernel attribution improves correlation with leave‑one‑out analysis by 50%, achieving a 27% reward gain over baseline attribution methods.
By Zhenshuo Zhang, Ruoxuan Xiong, Hongyang R. Zhang
arXiv:2608. 07180v1 Announce Type: cross Abstract: Recent advances in deep reinforcement learning (RL) have shown that improving neural network architectures can yield substantial gains in sample efficiency and asymptotic performance without altering the underlying algorithms.
By Adam \v{S}tafa, Santeri Heiskanen, Petr Novotn\'y, Joni Pajarinen
arXiv:2605.30749v2 Announce Type: replace
Abstract: Maximum entropy reinforcement learning (MaxEnt-RL) enables robust exploration, yet practical implementations often restrict policies to simple Gaus...
By Sungha Kim, Gawon Lee, Jusuk Lee, Jonghae Park, H. Jin Kim, Daesol Cho
arXiv:2607. 08647v1 Announce Type: cross Abstract: As autonomous agents are increasingly deployed across diverse operational contexts, aligning their behavior with human intent demands reward functions that remain robust to such changes rather than overfitting to any single environment.
By Ali Larian, Qian Lin, Chang Zong Wu, Daniel S. Brown