Demo Data from VLDB 2026 / reviewers in the wild / expert
Haoxuan Peng
dblp:322/5140
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2026
0009-0005-8147-9256ORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1 · 1 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Artificial intelligence
1 paper |
Multi-agent systems · 50% Efficient and distributed learning · 50% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Knowledge, reasoning and agents › Multi-agent systems
LLM-based multi-agent systems |
1.0 | 1 | 2026 | AgentSlimming: Towards Efficient and Cost-Aware Multi-Agent Systems · ACL (1) 2026 |
Machine learning › Efficient and distributed learning
model compression |
1.0 | 1 | 2026 | AgentSlimming: Towards Efficient and Cost-Aware Multi-Agent Systems · ACL (1) 2026 |
Methods — techniques the papers use, named apart from their topics
quantization · 1.0pruning · 1.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | AgentSlimming: Towards Efficient and Cost-Aware Multi-Agent SystemsabstractLarge Language Model-based Multi-Agent Systems (MAS) have demonstrated remarkable capabilities in complex tasks.However, manually designing optimal communication topologies is labor-intensive, while automated expansion methods often result in bloated structures with redundant agents, leading to excessive token consumption.To address this problem, we introduce AgentSlimming, a plug-and-play compression framework for graph-structured multiagent workflows.Motivated by pruning and quantization in neural networks, AgentSlimming compresses workflows by first estimating the importance score of each agent with a hybrid mechanism, and then removes redundant agents or replaces them with low-cost ones, where each operation is validated using a baseline-anchored acceptance rule to prevent performance collapse.Experiments show that AgentSlimming reduces average token cost by up to 78.9% with negligible performance degradation, and sometimes even improves accuracy, achieving a strong Pareto-optimal tradeoff between cost and quality.Our code is publicly available at https://github.com/ CitrusYL/AgentSlimming. Yulang Chen, Haoxuan Peng, Zichen Wen, Dongrui Liu |
ACL (1) | 2 |