Nash-Pruned CredMAS: Dynamic Panel Pruning for VLM-MAS using Nash-based Selection and Doubly-Robust Credits (2026.findings-acl)
Copied to clipboard
| Challenge: | Multi-Agent Systems (MAS) are expensive due to static panel designs, where all N agents communicate at every T round. |
| Approach: | They propose an economic framework that transforms agent selection into a dynamic resource allocation game. |
| Outcome: | The proposed system reduces token consumption by over 25% on challenging benchmarks while reducing token consumption. |
Similar Papers
AT²PO: Agentic Turn-based Policy Optimization via Tree Search (2026.acl-long)
Copied to clipboard
| Challenge: | Recent advances in large language models (LLMs) have catalyzed the development of autonomous agents capable of executing complex, multi-turn tasks. |
| Approach: | They propose a framework for agentic reinforcement learning that integrates turn-level tree search with tree search to address key challenges. |
| Outcome: | The proposed framework addresses key challenges: limited exploration diversity, sparse credit assignment, and misaligned policy optimization. |
VisPCO: Visual Token Pruning Configuration Optimization via Budget-Aware Pareto-Frontier Learning for Vision-Language Models (2026.acl-long)
Copied to clipboard
| Challenge: | Existing methods for visual token pruning rely on predefined configurations without determining whether they achieve optimal performance. |
| Approach: | They propose a framework that formulates visual token pruning as a Pareto configuration optimization problem to automatically identify optimal configurations. |
| Outcome: | The proposed framework approximates the empirical Pareto frontier obtained through grid search and generalizes well across pruning methods and VLM architectures. |
Generative Gamer: Learning Equilibrium Strategy by LLM-driven Dynamic Deduction (2026.acl-long)
Copied to clipboard
| Challenge: | Large Language Models (LLMs) falter in domains requiring deep strategic reasoning. |
| Approach: | They propose a framework that trains LLMs to reason like an expert player . they propose action pruning based on policy confidence, state pruning via value estimation and branch pruning inspired by alpha-beta principles to train the model effectively. |
| Outcome: | Experiments on Tic-Tac-Toe and Leduc Poker show that GenGamer significantly improves the strategic capabilities of large language models. |
RAG-on-a-Diet: A Reinforcement Learning-Based Dynamic Resource Optimization Framework for RAG (2026.acl-long)
Copied to clipboard
| Challenge: | Existing frameworks for knowledge-intensive multi-hop question answering do not adapt to how a trajectory unfolds. |
| Approach: | They propose a lightweight reinforcement-learning agent that treats each reasoning hop as an independent decision and selects the smallest model sufficient for it. |
| Outcome: | The proposed agent cuts Monetary Inference Cost by 60.07% against IRCoT with only a 3.7% F1 drop and matches Adaptive-RAG’s F1 at 37.30% lower cost. |
RouterHGC: Optimized Router for LLM-based Multi-Agent Systems via Heterogeneous Graph Contrastive Learning (2026.findings-acl)
Copied to clipboard
| Challenge: | Large Language Models (LLMs)-driven Multi-Agent Systems (MAS) have demonstrated remarkable scalability and generalizability across complex tasks. |
| Approach: | They propose a new framework for routing using large language models . they formalize routing as node selection through edge-weight prediction . |
| Outcome: | The proposed framework outperforms the best single LLM and baselines on five datasets . it achieves 0.80%–6.17% accuracy gains on MATH and HotpotQA while reducing inference cost by 27.40%. |
EOP-LLM: Energy Oriented Pruning for Large Language Models (2026.findings-acl)
Copied to clipboard
| Challenge: | Inference energy consumption has grown rapidly in large language models (LLMs) but existing methods focus on reducing FLOPs or latency rather than modeling or enforcing end-to-end inference energy constraints. |
| Approach: | They propose an energy-oriented dynamic pruning framework that enables LLM inference under explicit per-sequence energy budgets. |
| Outcome: | EOP-LLM outperforms state-of-the-art dynamic pruning baselines while adhering to per-sequence energy constraints. |
From Individual Excellence to Collective Sustainability: Seeking Strategic Equilibrium in Proactive Multi-Agent Teams (2026.findings-acl)
Copied to clipboard
| Challenge: | a team of proactive agents suffer from a greedy optimization for immediate task accuracy . a new approach to improve team collaboration is based on the opportunity cost . |
| Approach: | They propose a game-theoretic proactive multi-agent reinforcement learning framework to solve this imbalance . they use a Positive-Unlabeled scorer to anchor intervention quality under sparse supervision . |
| Outcome: | The proposed framework maintains high performance while preventing experts from over-developing. |
"Penny Wise, Pixel Foolish": Bypassing Price Constraints in Multimodal Agents via Visual Adversarial Perturbations (2026.findings-acl)
Copied to clipboard
| Challenge: | Mobile Agents are a key component of the “Agentic Economy” where they perform high-stakes financial transactions. |
| Approach: | They propose a systemic vulnerability termed Visual Dominance Hallucination (VDH) VDH exploits the modality gap in CLIP-based encoders via a novel Semantic-Decoupling Loss. |
| Outcome: | The proposed framework exploits the modality gap in CLIP-based encoders by preserving fidelity. |
Look Less, Reason More: Rollout-Guided Adaptive Pixel-Space Reasoning (2026.acl-long)
Copied to clipboard
| Challenge: | Recent work has shown promise by incorporating pixel-level visual information into the reasoning process, enabling VLMs to access high-resolution visual details during their thought process. |
| Approach: | They propose a framework that dynamically determines necessary pixel-level operations based on the input query. |
| Outcome: | The proposed model achieves 73.4% accuracy on HR-Bench 4K while maintaining a tool usage ratio of only 20.1%, improving accuracy and reducing tool usage by 66.5% compared to the previous methods. |
AgentDropout: Dynamic Agent Elimination for Token-Efficient and High-Performance LLM-Based Multi-Agent Collaboration (2025.acl-long)
Copied to clipboard
| Challenge: | Existing methods for MAS suffer from high token consumption and inefficiency due to frequent generation and communication among multiple agents. |
| Approach: | They propose a multi-agent system based on large language models that identifies redundant agents and communication across different communication rounds by optimizing the adjacency matrices of the communication graphs and eliminates them to enhance both token efficiency and task performance. |
| Outcome: | The proposed method reduces prompt token consumption and completion token consumption by 18.4% and improves task performance by 1.14. |