MARS-RA: Rank Aggregation for Credit Assignment via Multimodal Comparisons in Embodied Multi-Agent Cooperation (2026.acl-long)
Copied to clipboard
Dawei Wang, Di Zhao, Xinyuan Liu, Marci Chi Ma, Xiaoyang Liu, Chengming Zhou, Gary Ushaw, Richard Davison
| Challenge: | Embodied AI systems are open, where agents may leave or enter mid-task due to hardware failures or task-related errors. |
| Approach: | They propose a framework that reformulates credit assignment as a rank aggregation problem using contribution-based pairwise comparisons among agents generated by large multimodal models. |
| Outcome: | The proposed framework can guide agents toward effective cooperation in complex tasks of different types. |
Similar Papers
MARS2: Scaling Multi-Agent Tree Search via Reinforcement Learning for Code Generation (2026.acl-long)
Copied to clipboard
Pengfei Li, Shijie Wang, Fangyuan Li, Yikun Fu, Kaifeng Liu, Kaiyan Zhang, Dazhi Zhang, Yuqiang Li, Biqing Qi, Bowen Zhou
| Challenge: | Existing approaches to reinforcement learning are decoupled from structured search due to limited trajectory diversity. |
| Approach: | They propose a unified RL framework that integrates multiple agents within a shared tree-structured search environment. |
| Outcome: | Experiments show that MARS2 improves performance across diverse model combinations and training settings. |
Proximity-Based Multi-Turn Optimization: Practical Credit Assignment for LLM Agent Training (2026.acl-industry)
Copied to clipboard
| Challenge: | Existing group-based policy optimization methods rely on statistical deviation within discrete batches, misallocating credit when task difficulty fluctuates. |
| Approach: | They propose a framework for multi-turn LLM agents that integrates global context . they propose GRPO, which integrates success-rate-aware modulation and proximity-based soft aggregation . |
| Outcome: | The proposed framework yields performance gains over existing baselines with negligible computational cost. |
SQL-ASTRA: Alleviating Sparse Feedback in Agentic SQL via Column-Set Matching and Trajectory Aggregation (2026.findings-acl)
Copied to clipboard
| Challenge: | Agentic SQL is a framework for multiturn agent learning, but it is limited to single-turn paradigms. |
| Approach: | They propose a framework that provides a universal two-tiered reward mechanism for credit assignment . they propose 'Aggregated Trajectory Reward' to resolve multi-turn credit assignment. |
| Outcome: | The proposed framework outperforms SOTA Arctic-Text2SQL-R1-7B on BIRD and Spider 2.0 using identical models. |
CriticSearch: Fine-Grained Credit Assignment for Search Agents via a Retrospective Critic (2026.findings-acl)
Copied to clipboard
| Challenge: | Existing search agent pipelines rely on sparse outcome rewards, leading to inefficient exploration and unstable training. |
| Approach: | They propose a tool-integrated reasoning framework that provides turn-level feedback via a retrospective critic mechanism. |
| Outcome: | The proposed framework outperforms baselines in multi-hop reasoning benchmarks and achieves faster convergence and training stability. |
From Credit Assignment to Entropy Regularization: Two New Algorithms for Neural Sequence Prediction (P18-1)
Copied to clipboard
| Challenge: | equivalence between credit assignment problem and entropy regularized reinforcement learning is established . a wide range of successful sequence prediction algorithms have been developed . |
| Approach: | They propose to extend credit assignment in reward augmented maximum likelihood learning by credit assignment and entropy regularization. |
| Outcome: | The proposed algorithms outperform RAML and Actor-Critic on two benchmark datasets. |
Harmonizing Dense and Sparse Signals in Multi-turn RL: Dual-Horizon Credit Assignment for Industrial Sales Agents (2026.acl-industry)
Copied to clipboard
| Challenge: | Large language models for industrial sales require balancing long-term commercial objectives with immediate linguistic constraints such as fluency and compliance. |
| Approach: | They propose a framework that disentangles optimization across time scales by normalizing advantages from turn-level and session-level rewards before fusion. |
| Outcome: | The proposed framework outperforms the state-of-the-art GRPO model in conversion rate and identity detection rate. |
MAPRO: Recasting Multi-Agent Prompt Optimization as Maximum a Posteriori Inference (2026.findings-eacl)
Copied to clipboard
| Challenge: | Large language models (LLMs) have demonstrated remarkable capabilities across diverse tasks. |
| Approach: | They propose a framework that optimizes MAS prompts as a maximum a posteriori problem and then iteratively updates agent prompts. |
| Outcome: | The proposed framework surpasses manual and automated benchmarks in multiple tasks and provides general guidelines for building more reliable and principled multi-agent systems in the future. |
R3-SQL: Ranking Reward and Resampling for Text-to-SQL (2026.findings-acl)
Copied to clipboard
| Challenge: | Existing rankers assign inconsistent scores to functionally equivalent SQL queries . ranking cannot recover when the correct SQL is absent from the pool. |
| Approach: | They propose a Text-to-SQL framework that rewards ranking and resampling . it first groups candidates by execution result and ranks groups for consistency . |
| Outcome: | The proposed framework achieves 75.03 execution accuracy on BIRD-dev, a new state of the art among methods using models with disclosed sizes. |
Towards Efficient LLM Grounding for Embodied Multi-Agent Collaboration (2025.findings-acl)
Copied to clipboard
| Challenge: | Existing methods for grounding large language models suffer from inefficient querying . Existing approaches that rely on physical verification or self-reflection suffer from excessive querying. |
| Approach: | They propose a framework that introduces Reinforced Advantage feedback for efficient self-refinement of plans. |
| Outcome: | The proposed framework surpasses baselines in success rate and significantly decreases interaction steps of agents and query rounds of LLMs. |
RB-LoRA: Rank-Balanced Aggregation for Low-Rank Adaptation with Federated Fine-Tuning (2026.findings-eacl)
Copied to clipboard
| Challenge: | Low-rank adaptation (LoRA) improves fine-tuning of foundation models by updating only compact adapter matrices . varying client device capabilities lead to different adapter ranks, causing rank heterogeneity that undermines aggregation. |
| Approach: | They propose a rank-balanced aggregation framework that decomposes each update into rank-wise components and aligns them using analytically derived weights. |
| Outcome: | Experiments on language and vision models show that RB-LoRA improves under one and three rounds of communication in federated learning environments. |