arXiv Machine Learning

The Operable Pareto Front: Distilling Offline Search into Run-Time Control for Multi-Objective UAV Edge-Computing Scheduling

The paper introduces PrefDT, a preference-conditioned Decision Transformer designed for multi‑objective scheduling of UAV mobile edge computing fleets. PrefDT accepts a desired energy‑delay trade‑off as input, enabling a single offline‑trained model to generate any point on the Pareto front during runtime. The authors employ attention pooling with a per‑user bypass to maintain scheduler operation when user reports are lost, and a distillation pipeline to create a preference‑labeled flight corpus, achieving superior trade‑off curves and tight energy budget adherence in simulations.

arXiv AI
Jun 19

Oranits: Mission Assignment and Task Offloading in Open RAN-based ITS using Metaheuristic and Deep Reinforcement Learning

arXiv:2507. 19712v3 Announce Type: replace-cross Abstract: In this paper, we explore mission assignment and task offloading in an Open Radio Access Network (Open RAN)-based intelligent transportation system (ITS), where autonomous vehicles leverage mobile edge computing for efficient processing.

By Ngoc Hung Nguyen, Nguyen Van Thieu, Quang-Trung Luu, Anh Tuan Nguyen, Senura Wanasekara, Nguyen Cong Luong, Fatemeh Kavehmadavani, Van-Dinh Nguyen
arXiv AI
Jun 3

AUGUSTE: Online-Learning dApp for Predictive URLLC Scheduling

arXiv:2606. 03664v1 Announce Type: cross Abstract: Ultra Reliable and Low Latency Communications (URLLC) was one of the main motivations behind 5G, with 3GPP advertising 1-10 ms latency targets for applications such as industrial automation, Vehicle-To-Everything (V2X), tactical edge networking, and unmanned-system control.

By Maxime Elkael, Michele Polese, Yunseong Lee, Koichiro Furueda, Tommaso Melodia
arXiv Machine Learning
Aug 27

Multi-Turn Reasoning LLMs for Task Offloading in Mobile Edge Computing

The paper introduces COMLLM, a generative framework that combines Group Relative Policy Optimization with a Look‑Ahead Collaborative Simulation to enable multi‑turn reasoning for task offloading in Mobile Edge Computing. By performing multi‑step Monte Carlo rollouts that jointly model server queue dynamics, COMLLM incorporates long‑term system evolution into its reward design, achieving near‑optimal latency and improved load‑balancing fairness. The framework demonstrates zero‑shot scalability to larger network topologies, outperforming supervised fine‑tuning, deep reinforcement learning, and heuristic baselines without requiring retraining.

By Ning Yang, Chuangxin Cheng, Haijun Zhang
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
Jun 17

OmniPlan: An Adaptive Framework for Timely and Near-Optimal Network Planning Optimization

arXiv:2606. 18105v1 Announce Type: cross Abstract: Network planning optimization is a fundamental problem across diverse domains, including transportation systems, communication networks, and power grids.

By Longlong Zhu, Jiashuo Yu, Zedi Chen, Yuhan Wu, Zhifan Jiang, Yuchen Xian, Yimeng Liu, Jiajie Su, Shaopeng Zhou, Xingyuan Li, Hongyan Liu, Xuan Liu, Dong Zhang, Chunming Wu, Xiang Chen