REVIEW 9 cited by
ReSo: A Reward-driven Self-organizing LLM-based Multi-Agent System for Reasoning Tasks
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
Multi-agent systems (MAS) have emerged as a promising approach for enhancing the reasoning capabilities of large language models in complex problem-solving; however, current MAS frameworks suffer from poor flexibility and scalability with underdeveloped optimization strategies. To address these challenges, we propose ReSo, which integrates task graph generation with a reward-driven two-stage agent selection process centered on our Collaborative Reward Model that provides fine-grained reward signals to optimize MAS cooperation. We also introduce an automated data synthesis framework for generating MAS benchmarks without any human annotations. Experimental results show that ReSo matches or outperforms existing methods, achieving 33.7 percent accuracy on Math-MAS and 32.3 percent accuracy on SciBench-MAS, where other approaches completely fail.
Forward citations
Cited by 9 Pith papers
-
The Vision Wormhole: Latent-Space Communication in Heterogeneous Multi-Agent Systems
Reasoning messages between heterogeneous VLMs can be routed through the image-token span: a distilled universal codec plus affine alignment transmits latent traces across model families, cutting wall-clock time in sma...
-
Latent Collaboration in Multi-Agent Systems
Replacing text inter-agent dialogue with direct transfer of hidden-state (KV-cache) representations cuts output tokens by ~70-84%, speeds inference ~4x, and keeps multi-agent accuracy roughly on par or slightly better.
-
Attributes as Textual Genes: Leveraging LLMs as Genetic Algorithm Simulators for Conditional Synthetic Data Generation
Genetic Prompt uses LLMs to run semantic-level crossover and mutation on text attributes from two far-apart parent examples, producing synthetic data that improves downstream NLP performance, especially for rare classes.
-
Dynamic Collaboration of Multi-Language Models based on Minimal Complete Semantic Units
MCSU-based vocabulary alignment plus distance-based dynamic selection (DDS) lets several LLMs vote token-by-token, beating single models and prior ensemble baselines on multiple reasoning benchmarks without training.
-
G-Memory: Tracing Hierarchical Memory for Multi-Agent Systems
G-Memory stores past multi-agent teamwork in a three-tier graph and retrieves it to boost performance on five benchmarks.
-
X-MAS: Towards Building Multi-Agent Systems with Heterogeneous LLMs
A benchmark-guided selection of different LLMs for different agent roles consistently improves multi-agent system accuracy over using one model everywhere.
-
Swarm Intelligence Enhanced Reasoning: A Density-Driven Framework for LLM-Based Multi-Agent Optimization
SIER uses kernel density estimation and Pareto-style selection to preserve diversity in PRM-guided multi-agent reasoning, improving pass@8 and prm@8 on math benchmarks at higher token cost.
-
Toward Efficient Agents: Memory, Tool learning, and Planning
A survey that organizes efficiency techniques for LLM agents into memory, tool learning, and planning, and consolidates benchmarks and metrics for measuring cost-performance trade-offs.
-
Graph-Augmented Large Language Model Agents: Current Progress and Future Prospects
A survey that categorizes Graph-augmented LLM Agent research into planning, memory, tool management, and multi-agent design, and outlines open directions.
Discussion (0). Continue with ORCID to comment.