arXiv AI

MARA: Flow-Matching-Guided Multi-Agent Resource Allocation for Computational Resource Efficient Learning

arXiv:2608. 09130v1 Announce Type: cross Abstract: Allocating limited computation among concurrent learning tasks is difficult when each task must reach a target loss before a deadline but its required training effort is unknown.

arXiv Machine Learning
Aug 31

DART-FL: Burst-Aware Multitask Federated Learning under Dynamic Inference Demand at the Edge

DART-FL is a multitask federated learning framework designed for edge devices that must balance online inference and model training under limited resources. It dynamically allocates resources between inference and training based on current inference backlog and service capacity, then distributes remaining training capacity among tasks using a queue‑aware scheduler that adjusts loss weights. Experiments on image classification datasets with synthetic and real workloads show that DART‑FL adapts to bursty inference demand, improving accuracy for high‑demand tasks while preserving overall multitask performance.

By Yiming Xie, Pinrui Yu, Geng Yuan, Xue Lin, Ningfang Mi
arXiv Machine Learning
Aug 24

BIPPO: Budget-Aware Independent PPO for Energy-Efficient Federated Learning Services

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.

By Anna Lackinger, Andrea Morichetta, Pantelis A. Frangoudis, Schahram Dustdar
arXiv AI
Jun 11

Offline Diffusion Policy for Multi-User Delay-Constrained Scheduling

arXiv:2501. 12942v2 Announce Type: replace Abstract: Effective multi-user delay-constrained scheduling is crucial in various real-world applications, including embodied AI, instant messaging, live streaming, and data center management, where efficient resource allocation is required among users with diverse delay sensitivities.

By Zhuoran Li, Ruishuo Chen, Hai Zhong, Longbo Huang