SearcharxivSearch

arXiv subjects

Shuo Wan

Publications and source records attributed to Shuo Wan.

15 recordsLinked to original sources

AInfer-PD: Communication-Safe In-Place Prefill-Decode Multiplexing for Distributed MoE Rollouts

Rollout inference often dominates the wall-clock time of large-scale reinforcement learning (RL). In agentic RL, each trajectory alternates between model generation and environment interaction over multiple turns. Asynchronous trajectories consequently introduce new prefill (P) work while other trajectories remain in decode (D), making P/D coexistence a persistent property of the rollout rather than a one-time prompt-ingestion event. On shared accelerators, persistent P/D coexistence can make prefill interfere with latency-sensitive decode and prolong rollout completion. P/D disaggregation avoids this co-location but requires separate device pools and KV-cache transfers. In-place multiplexing retains shared devices and KV state, but existing designs lack the communication isolation needed for large MoE deployments that combine attention TP/DP with distributed expert execution. In practical implementations, P and D can issue intersecting collectives in inconsistent cross-rank orders; DeepEP's P and D paths also share mutable protocol state. We present AInfer-PD, which extends in-place P/D multiplexing to distributed MoE rollouts. AInfer-PD coordinates P/D collective order across ranks and gives the two DeepEP paths independent communication state, making crossed ADP/ATP and DeepEP paths safe for concurrent P/D execution. The design retains shared model weights and KV storage while coordinating P and D on the same devices. Across repeated single-node prefill-intensive workloads, AInfer-PD reduces fixed-workload rollout completion time by 7.1-22.5% relative to the same AInfer engine with P/D multiplexing disabled and by 24.8-32.9% relative to SGLang. On two nodes, the reductions are 18.0-35.3% and 18.3-31.8%, respectively. In a same-engine ablation, fine-grained boundaries reduce completion time by a further 8.6-19.8% over whole-epoch asynchronous enqueue.

cs.DC

How global observation works in Federated Learning: Integrating vertical training into Horizontal Federated Learning

Federated learning (FL) has recently emerged as a transformative paradigm that jointly train a model with distributed data sets in IoT while avoiding the need for central data collection. Due to the limited observation range, such data sets can only reflect local information, which limits the quality of trained models. In practice, the global information and local observations would require a joint consideration for learning to make a reasonable policy. However, in horizontal FL, the central agency only acts as a model aggregator without utilizing its global observation to further improve the model. This could significantly degrade the performance in some missions such as traffic flow prediction in network systems, where the global information may enhance the accuracy. Meanwhile, the global feature may not be directly transmitted to agents for data security. How to utilize the global observation residing in the central agency while protecting its safety thus rises up as an important problem in FL. In this paper, we develop a vertical-horizontal federated learning (VHFL) process, where the global feature is shared with the agents in a procedure similar to that of vertical FL without any extra communication rounds. By considering the delay and packet loss, we will analyze VHFL convergence and validate its performance by experiments. It is shown that the proposed VHFL could enhance the accuracy compared with horizontal FL while still protecting the security of global data.

cs.LG

Convergence Analysis and System Design for Federated Learning over Wireless Networks

Federated learning (FL) has recently emerged as an important and promising learning scheme in IoT, enabling devices to jointly learn a model without sharing their raw data sets. However, as the training data in FL is not collected and stored centrally, FL training requires frequent model exchange, which is largely affected by the wireless communication network. Therein, limited bandwidth and random package loss restrict interactions in training. Meanwhile, the insufficient message synchronization among distributed clients could also affect FL convergence. In this paper, we analyze the convergence rate of FL training considering the joint impact of communication network and training settings. Further by considering the training costs in terms of time and power, the optimal scheduling problems for communication networks are formulated. The developed theoretical results can be used to assist the system parameter selections and explain the principle of how the wireless communication system could influence the distributed training process and network scheduling.

cs.LG

Federated Multi-Agent Actor-Critic Learning for Age Sensitive Mobile Edge Computing

As an emerging technique, mobile edge computing (MEC) introduces a new processing scheme for various distributed communication-computing systems such as industrial Internet of Things (IoT), vehicular communication, smart city, etc. In this work, we mainly focus on the timeliness of the MEC systems where the freshness of the data and computation tasks is significant. Firstly, we formulate a kind of age-sensitive MEC models and define the average age of information (AoI) minimization problems of interests. Then, a novel policy based multi-agent deep reinforcement learning (RL) framework, called heterogeneous multi-agent actor critic (H-MAAC), is proposed as a paradigm for joint collaboration in the investigated MEC systems, where edge devices and center controller learn the interactive strategies through their own observations. To improves the system performance, we develop the corresponding online algorithm by introducing an edge federated learning mode into the multi-agent cooperation whose advantages on learning convergence can be guaranteed theoretically. To the best of our knowledge, it's the first joint MEC collaboration algorithm that combines the edge federated mode with the multi-agent actor-critic reinforcement learning. Furthermore, we evaluate the proposed approach and compare it with classical RL based methods. As a result, the proposed framework not only outperforms the baseline on average system age, but also promotes the stability of training process. Besides, the simulation results provide some innovative perspectives for the system design under the edge federated collaboration.

cs.MA

An Importance Aware Weighted Coding Theorem Using Message Importance Measure

There are numerous scenarios in source coding where not only the code length but the importance of each value should also be taken into account. Different from the traditional coding theorems, by adding the importance weights for the length of the codes, we define the average cost of the weighted codeword length as an importance-aware measure of the codes. This novel information theoretical measure generalizes the average codeword length by assigning importance weights for each symbol according to users' concerns through focusing on user's selections. With such definitions, coding theorems of the bounds are derived and the outcomes are shown to be extensions of traditional coding theorems.

cs.IT

Intelligent networking with Mobile Edge Computing: Vision and Challenges for Dynamic Network Scheduling

Mobile edge computing (MEC) has been considered as a promising technique for internet of things (IoT). By deploying edge servers at the proximity of devices, it is expected to provide services and process data at a relatively low delay by intelligent networking. However, the vast edge servers may face great challenges in terms of cooperation and resource allocation. Furthermore, intelligent networking requires online implementation in distributed mode. In such kinds of systems, the network scheduling can not follow any previously known rule due to complicated application environment. Then statistical learning rises up as a promising technique for network scheduling, where edges dynamically learn environmental elements with cooperations. It is expected such learning based methods may relieve deficiency of model limitations, which enhance their practical use in dynamic network scheduling. In this paper, we investigate the vision and challenges of the intelligent IoT networking with mobile edge computing. From the systematic viewpoint, some major research opportunities are enumerated with respect to statistical learning.

cs.NI

Importance of Small Probability Events in Big Data: Information Measures, Applications, and Challenges

In many applications (e.g., anomaly detection and security systems) of smart cities, rare events dominate the importance of the total information of big data collected by Internet of Things (IoTs). That is, it is pretty crucial to explore the valuable information associated with the rare events involved in minority subsets of the voluminous amounts of data. To do so, how to effectively measure the information with importance of the small probability events from the perspective of information theory is a fundamental question. This paper first makes a survey of some theories and models with respect to importance measures and investigates the relationship between subjective or semantic importance and rare events in big data. Moreover, some applications for message processing and data analysis are discussed in the viewpoint of information measures. In addition, based on rare events detection, some open challenges related to information measures, such as smart cities, autonomous driving, and anomaly detection in IoTs, are introduced which can be considered as future research directions.

cs.IT

Towards Big data processing in IoT: Path Planning and Resource Management of UAV Base Stations in Mobile-Edge Computing System

Heavy data load and wide cover range have always been crucial problems for online data processing in internet of things (IoT). Recently, mobile-edge computing (MEC) and unmanned aerial vehicle base stations (UAV-BSs) have emerged as promising techniques in IoT. In this paper, we propose a three-layer online data processing network based on MEC technique. On the bottom layer, raw data are generated by widely distributed sensors, which reflects local information. Upon them, unmanned aerial vehicle base stations (UAV-BSs) are deployed as moving MEC servers, which collect data and conduct initial steps of data processing. On top of them, a center cloud receives processed results and conducts further evaluation. As this is an online data processing system, the edge nodes should stabilize delay to ensure data freshness. Furthermore, limited onboard energy poses constraints to edge processing capability. To smartly manage network resources for saving energy and stabilizing delay, we develop an online determination policy based on Lyapunov Optimization. In cases of low data rate, it tends to reduce edge processor frequency for saving energy. In the presence of high data rate, it will smartly allocate bandwidth for edge data offloading. Meanwhile, hovering UAV-BSs bring a large and flexible service coverage, which results in the problem of effective path planning. In this paper, we apply deep reinforcement learning and develop an online path planning algorithm. Taking observations of around environment as input, a CNN network is trained to predict the reward of each action. By simulations, we validate its effectiveness in enhancing service coverage. The result will contribute to big data processing in future IoT.

cs.NI

Towards Big data processing in IoT: network management for online edge data processing

Heavy data load and wide cover range have always been crucial problems for internet of things (IoT). However, in mobile-edge computing (MEC) network, the huge data can be partly processed at the edge. In this paper, a MEC-based big data analysis network is discussed. The raw data generated by distributed network terminals are collected and processed by edge servers. The edge servers split out a large sum of redundant data and transmit extracted information to the center cloud for further analysis. However, for consideration of limited edge computation ability, part of the raw data in huge data sources may be directly transmitted to the cloud. To manage limited resources online, we propose an algorithm based on Lyapunov optimization to jointly optimize the policy of edge processor frequency, transmission power and bandwidth allocation. The algorithm aims at stabilizing data processing delay and saving energy without knowing probability distributions of data sources. The proposed network management algorithm may contribute to big data processing in future IoT.

cs.NI

Matching Users' Preference Under Target Revenue Constraints in Optimal Data Recommendation Systems

This paper focuses on the problem of finding a particular data recommendation strategy based on the user preferences and a system expected revenue. To this end, we formulate this problem as an optimization by designing the recommendation mechanism as close to the user behavior as possible with a certain revenue constraint. In fact, the optimal recommendation distribution is the one that is the closest to the utility distribution in the sense of relative entropy and satisfies expected revenue. We show that the optimal recommendation distribution follows the same form as the message importance measure (MIM) if the target revenue is reasonable, i.e., neither too small nor too large. Therefore, the optimal recommendation distribution can be regarded as the normalized MIM, where the parameter, called importance coefficient, presents the concern of the system and switches the attention of the system over data sets with different occurring probability. By adjusting the importance coefficient, our MIM based framework of data recommendation can then be applied to system with various system requirements and data distributions.Therefore,the obtained results illustrate the physical meaning of MIM from the data recommendation perspective and validate the rationality of MIM in one aspect.

cs.IT

Minor probability events detection in big data: An integrated approach with Bayesian testing and MIM

The minor probability events detection is a crucial problem in Big data. Such events tend to include rarely occurring phenomenons which should be detected and monitored carefully. Given the prior probabilities of separate events and the conditional distributions of observations on the events, the Bayesian detection can be applied to estimate events behind the observations. It has been proved that Bayesian detection has the smallest overall testing error in average sense. However, when detecting an event with very small prior probability, the conditional Bayesian detection would result in high miss testing rate. To overcome such a problem, a modified detection approach is proposed based on Bayesian detection and message importance measure, which can reduce miss testing rate in conditions of detecting events with minor probability. The result can help to dig minor probability events in big data.

eess.SP

A Switch to the Concern of User: Importance Coefficient in Utility Distribution and Message Importance Measure

This paper mainly focuses on the utilization frequency in receiving end of communication systems, which shows the inclination of the user about different symbols. When the average number of use is limited, a specific utility distribution is proposed on the best effort in term of fairness, which is also the closest one to occurring probability in the relative entropy. Similar to a switch, its parameter can be selected to make it satisfy different users' requirements: negative parameter means the user focus on high-probability events and positive parameter means the user is interested in small-probability events. In fact, the utility distribution is a measure of message importance in essence. It illustrates the meaning of message importance measure (MIM), and extend it to the general case by selecting the parameter. Numerical results show that this utility distribution characterizes the message importance like MIM and its parameter determines the concern of users.

cs.IT

Semi-centralized control for multi-robot formation and theoretical lower bound

Multi-robot formation control enables robots to cooperate as a working group in completing complex tasks, which has been widely used in both civilian and military scenarios. Before moving to reach a given formation, each robot should choose a position from the formation so that the whole system cost is minimized. To solve the problem, we formulate an optimization problem in terms of the total moving distance and give a solution by the Hungarian method. To analyze the deviation of the achieved formation from the ideal one, we obtain the lower bound of formation bias with respect to system's parameters based on notions in information theory. As an extension, we discuss methods of transformation between different formations. Some theoretical results are obtained to give a guidance of the system design.

cs.RO

Beyond Empirical Models: Pattern Formation Driven Placement of UAV Base Stations

This work considers the placement of unmanned aerial vehicle base stations (UAV-BSs) with criterion of minimum UAV-recall-frequency (UAV-RF), indicating the energy efficiency of mobile UAVs networks. Several different power consumptions, including signal transmit power, on-board circuit power and the power for UAVs mobility, and the ground user density are taken into account. Instead of conventional empirical stochastic models, this paper utilizes a pattern formation system to track the instable and non-ergodic time-varying nature of user density. We show that for a single time-slot, the optimal placement is achieved when the transmit power of UAV-BSs equals their on-board circuit power. Then, for multiple time-slot duration, we prove that the optimal placement updating problem is a nonlinear dynamic programming coupled with an integer linear programming. Since the original problem is NP-hard and can not be solved with conventional recursive methods, we propose a sequential-Markov-greedy-decision method to achieve near minimal UAV-RF in polynomial time. Further, we prove that the increment of UAV-RF caused by inaccurate predicted user density is proportional to the generalization error of learned patterns. Here, in regions with large area, high-rise buildings or low user density, large sample sets are required for effective pattern formation.

cs.IT

Energy-efficient 3D UAV-BS Placement Versus Mobile Users' Density and Circuit Power

Properly 3D placement of unmanned aerial vehicle mounted base stations (UAV-BSs) can effectively prolong the life-time of the mobile ad hoc network, since UAVs are usually powered by batteries. This paper involves the on-board circuit consumption power and considers the optimal placement that minimizes the UAV-recall-frequency (UAV-RF), which is defined to characterize the life-time of this kind of network. Theoretical results show that the optimal vertical and horizontal dimensions of UAV can be decoupled. That is, the optimal hovering altitude is proportional to the coverage radius of UAVs, and the slope is only determined by environment. Dense scattering environment may greatly enlarge the needed hovering altitude. Also, the optimal coverage radius is achieved when the transmit power equals to on-board circuit power, and hence limiting on-board circuit power can effectively enlarge life-time of system. In addition, our proposed 3D placement method only require the statistics of mobile users' density and environment parameters, and hence it's a typical on-line method and can be easily implemented. Also, it can be utilized in scenarios with varying users' density.

cs.IT