Challenge: Existing LLM-based agents have strong performance on held-in tasks, but their generalizability to unseen tasks remains poor.
Approach: They propose a reward-based generalizable reward model to guide the policy model for effective test-time search.
Outcome: The proposed agentRM outperforms existing agents on held-in tasks by 8.8 points on average.

Similar Papers

AgentTuning: Enabling Generalized Agent Abilities for LLMs (2024.findings-acl)

Copied to clipboard

Challenge: Open large language models (LLMs) with great performance in various tasks are far inferior to commercial models such as ChatGPT and GPT-4 when acting as agents to tackle complex tasks in the real world.
Approach: They propose a method to enhance the agent capabilities of LLMs while maintaining their general abilities.
Outcome: The AgentLM-70B is comparable to GPT-3.5-turbo on unseen agent tasks, demonstrating generalized agent capabilities.
ToolRM: Towards Agentic Tool-Use Reward Modeling (2026.findings-acl)

Copied to clipboard

Challenge: lack of reliable reward models for tool-use tasks has limited progress toward agentic AI . recent advances in agentic artificial intelligence are driven by tool-using capabilities of large language models.
Approach: They propose a pipeline that constructs pairwise preference data using rule-based scoring and multidimensional sampling to build lightweight reward models.
Outcome: The proposed model outperforms existing models on tool calling tasks with higher accuracy.
On the Limited Generalization Capability of the Implicit Reward Model Induced by Direct Preference Optimization (2024.findings-emnlp)

Copied to clipboard

Challenge: Reinforcement Learning from Human Feedback (RLHF) is an effective approach for aligning language models to human preferences.
Approach: They compare the accuracy of DPORM and EXRM with a reward function for scoring human preferences.
Outcome: The proposed methods can approximate an EXRM on the limit infinite samples, but it is unclear how effective they are in practice.
AgentV-RL: Scaling Reward Modeling with Agentic Verifier (2026.findings-acl)

Copied to clipboard

Challenge: Existing approaches to improve LLM reasoning are limited in complex domains and lack external grounding makes verifiers unreliable on computation-intensive tasks.
Approach: They propose a framework that transforms reward modeling into a multi-turn, tool-augmented deliberative process.
Outcome: The proposed framework surpasses state-of-the-art ORMs by 25.2% under parallel and sequential TTS.
Agent-RewardBench: Towards a Unified Benchmark for Reward Modeling across Perception, Planning, and Safety in Real-World Multimodal Agents (2025.acl-long)

Copied to clipboard

Challenge: Multimodal Large Language Models (MLLMs) are developing but lack external feedback . there is no clear on how to select reward models for agents .
Approach: They propose a benchmark to evaluate agent reward modeling ability in MLLMs . they use multiple dimensions and real-world agent scenarios evaluation .
Outcome: The proposed benchmark evaluates agent performance in multimodal large language models . it covers perception, planning, and safety with 7 scenarios and is highly difficult and high-quality .
Dynamic and Generalizable Process Reward Modeling (2025.acl-long)

Copied to clipboard

Challenge: Existing Process Reward Models lack cross-domain generalization and focus on feedback results.
Approach: They propose a process reward model that uses a reward tree to capture and store fine-grained, multi-dimensional reward criteria.
Outcome: The proposed model performs on prevailing benchmarks and out-of-distribution scenarios.
Teaching LLM to be Persuasive: Reward-Enhanced Policy Optimization for Alignment from Heterogeneous Rewards (2026.acl-industry)

Copied to clipboard

Challenge: a large language model (LLM) is used as a business development agent for persuasive price negotiation in online travel agencies.
Approach: They propose a reward-enhancing policy optimization method that integrates three complementary reward sources-a preference-trained reward model and an LLM-as-a-judge.
Outcome: The proposed method improves average dialogue rating to 4.63 (+0.33 over GRPO) and raises share of conversations with at least one excellent response to 66.67% (+23.34 pp over grepo).
From General Reward to Targeted Reward: Improving Open-ended Long-context Generation Models (2025.emnlp-main)

Copied to clipboard

Challenge: Current research on long-form context in Large Language Models (LLMs) focuses on understanding of long-contexts, but the open-ended Long Text Generation (Open-LTG) remains underexplored.
Approach: They propose a method that uses data synthesis and a reward signal to enhance model performance.
Outcome: The proposed method outperforms GPT-4-Turbo and improves performance by 20% on the Open-LTG task.
ConsistRM: Improving Generative Reward Models via Consistency-Aware Self-Training (2026.acl-long)

Copied to clipboard

Challenge: ConsistRM is a self-training framework that enables effective and stable GRM training without human annotations.
Approach: They propose a self-training framework that enables effective and stable GRM training without human annotations.
Outcome: The proposed framework outperforms vanilla Reinforcement Fine-Tuning (RFT) by 1.5% on five benchmark datasets.
ReSo: A Reward-driven Self-organizing LLM-based Multi-Agent System for Reasoning Tasks (2025.emnlp-main)

Copied to clipboard

Challenge: Multi-agent systems (MAS) are limited by poor flexibility and scalability, with underdeveloped optimization strategies.
Approach: They propose a task graph generation and a reward-driven two-stage agent selection process to integrate multi-agent systems to improve their reasoning capabilities.
Outcome: The proposed model outperforms existing methods on Math-MAS and SciBench-MAS SciBech, while other methods completely fail.

What is GenGO?

GenGO is an NLP powered publication search system. It currenctly indexes 30k+ papers from ACL Anthology, and implements multi-aspect summarization, semantic search, and more!

Information

About
Limitations