Skip to content
Preprint

FL-MAESTRO: Multi-Agent LLM Orchestration for Resource-Constrained Federated Learning

Aug 2026 · 0 citations · 15 references
Computer Science

TL;DR

FL-MAESTRO is proposed, a multi-agent orchestrator that makes the joint runtime FL decision directly through three specialist LLM agents, one per decision dimension, and matches the accuracy of the strongest energy-aware baseline while cutting wasted round energy from over a third to near zero.

Abstract

In Federated Learning (FL), the communication topology is a runtime variable rather than a fixed design choice, since links and edge devices drop in and out during training. Each round, the server must commit three coupled decisions, namely the communication topology, per-client resource allocation, and the aggregation rule for combining local updates. Recent agentic systems have begun bringing large language models (LLM) into FL, but the existing line of work either operates at setup time or handles a single runtime dimension such as client selection. We propose FL-MAESTRO, a multi-agent orchestrator that makes the joint runtime FL decision directly through three specialist LLM agents, one per decision dimension. A coordinator combines their analyses into a single decision, and a non-LLM feasibility check confirms it before the round executes. Because the orchestrator consumes the server's predicted-failure list, it withholds clients whose updates would never be aggregated, which removes the dominant source of wasted round energy in classical FL on volatile edge networks. Because client state is read as natural-text profiles, the same orchestrator extends to heterogeneous device classes without per-class energy models. On a non-IID CIFAR-10 benchmark, FL-MAESTRO matches the accuracy of the strongest energy-aware baseline while cutting wasted round energy from over a third to near zero. Code is available at https://github.com/denoslab/FL-MAESTRO.

View source

Similar papers

Review 2026

The Systems Architecture of LLM Multi-Agent Systems: Routing, Memory, and Resource Optimisation

This survey presents a systematic taxonomy and technical review of dynamic orchestration strategies designed to address communication overhead, KV cache management challenges, and increased token consumption within large Language Model-based Multi-Agent Systems.

Heet Nagoriya, H. Raithatha · 0 citations
Preprint Aug 2026

EASy: Towards Efficient LLM-Based Agentic System

EASy is proposed, a trainable agentic framework that jointly optimizes task performance and computational efficiency through reinforcement learning and consistently achieves stronger performance-efficiency trade-offs than strong agentic baselines.

Junnan Liu, Linhao Luo, Thuy-Trang Vu et al. · 0 citations
Preprint Aug 2026

ProgRouter: Online Progress-Guided Orchestration for Multi-Agent LLM Workflows under Quality-Cost Tradeoffs

ProgRouter is presented, an online progress-guided routing framework that adaptively selects LLM agents across workflow steps to preserve task-solving quality while adhering to time and cost budgets and reduces the operating cost relative to key baselines while maintaining strong task-solving performance.

Song-Yuan Li, Ahmed M. Abdelmoniem, Shi-Qiang Wang · 0 citations
Jul 2026

HACO: Hedged Agent Computing for Reliable LLM Systems

HACO is proposed, a runtime control scheme that treats each role request as a reliability-constrained selection problem over candidate agent instances, each coupling a role type, an LLM, and a concrete execution environment.

Enhan Li, Hongyang Du · 0 citations
#artificial intelligence Preprint Aug 2026

Learning What to Retain: Gated-Memory Routing for Efficient Collaboration in Multi-Agent LLM Systems

Gated-Memory Routing is proposed, which conditions each decision on the query and a learned execution memory, and attains the best average accuracy, exceeding the strongest baseline by 2.44 points, while reducing HumanEval inference cost by 31.9% relative to that baseline.

Rakibul Hasan Rajib, Meng Zheng, Qian Lou · 1 citation

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.