FL-MAESTRO is a multi‑agent orchestrator that uses three specialized large language model agents to jointly decide the communication topology, per‑client resource allocation, and aggregation rule in each federated learning round. A coordinator merges the agents’ analyses, and a non‑LLM feasibility check validates the decision before execution. By filtering out clients whose updates would never be aggregated, the system eliminates the main source of wasted round energy in volatile edge networks and works across heterogeneous device classes without per‑class energy models, achieving comparable accuracy to the best energy‑aware baseline while reducing wasted energy from over a third to near zero on a non‑IID CIFAR‑10 benchmark.
arXiv:2601. 10560v2 Announce Type: replace-cross Abstract: Multi-agent systems (MAS) coordinate multiple LLM-powered agents through structured workflows, gaining reasoning power but incurring high inference latency from multi-step execution and repeated model invocations.
arXiv:2606. 11440v1 Announce Type: new Abstract: Existing multi-agent LLM orchestration methods, ranging from brute-force ensembles to learned routers, select models and topologies based on task and model features.
Translating natural-language planning intent into verified plans is a longstanding challenge: people communicate goals in language, while classical planners require formal PDDL specifications. Recent agentic frameworks bridge this gap by orchestrating a pool of specialized repair agents inside a verifier-checked refinement loop, but the orchestrator at the centre is itself a prompted frontier LLM, paying a frontier-LLM API call at every refinement step.
arXiv:2606. 10662v1 Announce Type: cross Abstract: Multi-agent systems (MAS) can scale large language model reasoning at test time by decomposing complex problems into parallel subtasks.
arXiv:2606. 03892v1 Announce Type: cross Abstract: Training LLMs to orchestrate multi-step tool calls is held back by three coupled obstacles: realistic stateful execution environments are costly to build, synthetic training queries are often detached from the server's actual state (so the generated tool calls fail to execute), and recall-based RL rewards incentivize verbose tool-calling patterns.
arXiv:2607. 06979v1 Announce Type: new Abstract: Federated Learning (FL) enables training shared models on private, on-device data, but production deployments remain constrained to slow, multi-day refresh cycles due to the complexity of coordinating massive client populations.
BIPPO (Budget-aware Independent Proximal Policy Optimization) is a multi‑agent reinforcement learning framework designed for energy‑efficient client selection in federated learning (FL) over IoT systems. It addresses infrastructure constraints such as limited resources and device churn, which traditional FL and RL approaches overlook. Evaluated on two image‑classification tasks with non‑IID data, BIPPO improves mean accuracy over non‑RL methods, standard PPO, and IPPO while consuming only a negligible portion of the budget, even as client numbers grow.
arXiv:2607. 01366v1 Announce Type: new Abstract: Federated learning (FL) research often depends on many small but consequential algorithmic choices: optimizer variants, server aggregation rules, local training schedules, normalization, regularization, and model architecture.
arXiv:2608. 09250v1 Announce Type: new Abstract: Federated learning (FL) must serve devices with varying computational capabilities.
arXiv:2608. 09208v1 Announce Type: cross Abstract: Decentralized intelligence systems with heterogeneous devices and limited coordination increasingly rely on decentralized federated learning (DFL).
arXiv:2302. 09832v4 Announce Type: replace Abstract: In distributed optimization and federated learning, slow and costly communication between parallel devices and the central server constitutes the primary bottleneck.
arXiv:2607. 08784v1 Announce Type: cross Abstract: Federated continual learning (FCL) evaluates how distributed clients learn from changing data streams while retaining previously learned knowledge.