arXiv:2606. 24437v1 Announce Type: new Abstract: Mixture-of-Agents (MoA) architectures improve inference-time scaling by organizing multiple LLM agents into layered reasoning pipelines.
Mixture-of-Agents (MoA) architectures improve inference-time scaling by organizing multiple LLM agents into layered reasoning pipelines. However, existing MoA variants fail to sustain gains as depth increases, exhibiting degradation, early plateauing, or saturation.
The paper introduces a method to improve test-time scaling (TTS) for large language models by using multi-agent systems (MAS) to split long reasoning chains into manageable contexts. A new dataset, M500, containing 500 multi-agent collaborative reasoning traces, is used to fine‑tune open‑source models, enabling them to learn collaborative patterns and outperform their base versions. An adaptive scaling strategy with a "CEO" agent is proposed to dynamically guide reasoning depth, and experiments in the AgentVerse framework confirm the effectiveness of the approach.
The paper introduces Gated-Memory Routing, a method for efficient collaboration in multi‑agent large language model systems. It uses a learned execution memory with write and retrieval gates to keep only non‑redundant reasoning steps, and an adaptive halting controller to stop execution when enough evidence is gathered. Experiments on five reasoning and code‑generation benchmarks show the approach achieves higher accuracy and reduces inference cost by 31.9% compared to the strongest baseline.
arXiv:2602. 07774v5 Announce Type: replace-cross Abstract: Recent studies increasingly explore Large Language Models (LLMs) as a new paradigm for recommendation systems due to their scalability and world knowledge.
arXiv:2606. 17803v1 Announce Type: new Abstract: Large language models achieve strong reasoning performance by scaling inference-time compute, yet remain fundamentally stateless, discarding the rich, self-produced reasoning traces generated during this process.
arXiv:2604. 20140v2 Announce Type: replace Abstract: Direct Preference Optimization (DPO) is an effective framework for aligning large language models with human preferences, but it struggles with complex reasoning tasks.
arXiv:2607. 22562v1 Announce Type: new Abstract: Managing long-context dependencies remains a primary bottleneck in LLM agents, as redundant and irrelevant information can degrade multi-step reasoning.
arXiv:2606. 06036v1 Announce Type: new Abstract: Despite recent progress, LLM agents still struggle with reasoning over long interaction histories.
The paper introduces AMA, a framework that uses multiple agents—Constructor, Retriever, Judge, and Refresher—to manage memory for large language model agents. AMA’s hierarchical memory design dynamically adjusts retrieval granularity to match task complexity, while the Judge and Refresher ensure relevance, consistency, and timely updates. Experiments on long-context benchmarks show AMA outperforms existing baselines and cuts token usage by about 80% compared to full-context approaches.
arXiv:2609.14066v1 Announce Type: cross Abstract: Although existing multi-agent Retrieval-Augmented Generation (RAG) systems have demonstrated promise on complex multimodal reasoning tasks, they rema...
arXiv:2608. 05095v1 Announce Type: new Abstract: Agents for long term reasoning require a memory that can be efficiently and effectively updated over time, as new facts and external feedback continue to arrive.
The paper introduces rEDMRec, a method that compresses a large language model’s reasoning about user preferences and item comparisons into a compact, editable memory. This memory, organized into four channels—long‑term preference, short‑term context, item perception, and counterfactual hard‑negative comparisons—can be updated by an LLM controller and queried by a lightweight student LLM for ranking, eliminating the need to re‑run the expensive teacher model for each request. Experiments on ML‑1M, Amazon Beauty, and Steam datasets show that rEDMRec consistently outperforms zero‑shot, few‑shot, RAG, and GraphRAG baselines, achieving up to a 13.3% improvement in HR@1 on ML‑1M.