arXiv — NLP / Computation & Language · · 3 min read

Reward-Guided Autoregressive Graph Generation for Efficient Multi-Agent Communication Topology Design

Mirrored from arXiv — NLP / Computation & Language for archival readability. Support the source by reading on the original site.

Computer Science > Multiagent Systems

arXiv:2608.20099 (cs)
[Submitted on 20 Aug 2026]

Title:Reward-Guided Autoregressive Graph Generation for Efficient Multi-Agent Communication Topology Design

View a PDF of the paper titled Reward-Guided Autoregressive Graph Generation for Efficient Multi-Agent Communication Topology Design, by Poomphob Suwannapichat and 3 other authors
View PDF HTML (experimental)
Abstract:LLM-based Multi-Agent Systems (MAS) achieve strong performance on complex reasoning tasks by coordinating multiple agents, but at the cost of substantial token consumption. Recent work on automatic topology design, ARG-Designer, has reframed this problem as autoregressive graph generation. However, its training objective provides no explicit incentive for the model to generate sparse and efficient topologies. We address this limitation by introducing a Reward-Guided Autoregressive Graph Generation (RGA-Designer) inspired by Reinforcement Learning from Human Feedback (RLHF). We train a reward model that jointly captures task correctness and structural compactness, and then fine-tune the pretrained graph generator using the reward model as feedback. Our method preserves task accuracy at the level of ARG-Designer while reducing token consumption by an average of 20.5%.
Comments: Full version of extended abstract accepted at ICONIP 2026 (poster)
Subjects: Multiagent Systems (cs.MA); Computation and Language (cs.CL); Machine Learning (cs.LG)
Cite as: arXiv:2608.20099 [cs.MA]
  (or arXiv:2608.20099v1 [cs.MA] for this version)
  https://doi.org/10.48550/arXiv.2608.20099
arXiv-issued DOI via DataCite

Submission history

From: Poomphob Suwannapichat [view email]
[v1] Thu, 20 Aug 2026 14:32:01 UTC (564 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled Reward-Guided Autoregressive Graph Generation for Efficient Multi-Agent Communication Topology Design, by Poomphob Suwannapichat and 3 other authors
  • View PDF
  • HTML (experimental)
  • TeX Source

Current browse context:

cs.MA
< prev   |   next >
Change to browse by:

References & Citations

Loading...

BibTeX formatted citation

loading...
Data provided by:

Bookmark

BibSonomy Reddit
Bibliographic Tools

Bibliographic and Citation Tools

Bibliographic Explorer Toggle
Bibliographic Explorer (What is the Explorer?)
Connected Papers Toggle
Connected Papers (What is Connected Papers?)
Litmaps Toggle
Litmaps (What is Litmaps?)
scite.ai Toggle
scite Smart Citations (What are Smart Citations?)
Code, Data, Media

Code, Data and Media Associated with this Article

alphaXiv Toggle
alphaXiv (What is alphaXiv?)
Links to Code Toggle
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub Toggle
DagsHub (What is DagsHub?)
GotitPub Toggle
Gotit.pub (What is GotitPub?)
Huggingface Toggle
Hugging Face (What is Huggingface?)
ScienceCast Toggle
ScienceCast (What is ScienceCast?)
Demos

Demos

Replicate Toggle
Replicate (What is Replicate?)
Spaces Toggle
Hugging Face Spaces (What is Spaces?)
Spaces Toggle
TXYZ.AI (What is TXYZ.AI?)
Related Papers

Recommenders and Search Tools

Link to Influence Flower
Influence Flower (What are Influence Flowers?)
Core recommender toggle
CORE Recommender (What is CORE?)
About arXivLabs

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Discussion (0)

Sign in to join the discussion. Free account, 30 seconds — email code or GitHub.

Sign in →

No comments yet. Sign in and be the first to say something.

More from arXiv — NLP / Computation & Language