SearcharxivSearch

arXiv subjects

Yinglei Teng

Publications and source records attributed to Yinglei Teng.

15 recordsLinked to original sources

CA-HFP: Curvature-Aware Heterogeneous Federated Pruning with Model Reconstruction

Federated learning on heterogeneous edge devices requires personalized compression while preserving aggregation compatibility and stable convergence. We present Curvature-Aware Heterogeneous Federated Pruning (CA-HFP), a practical framework that enables each client perform structured, device-specific pruning guided by a curvature-informed significance score, and subsequently maps its compact submodel back into a common global parameter space via a lightweight reconstruction. We derive a convergence bound for federated optimization with multiple local SGD steps that explicitly accounts for local computation, data heterogeneity, and pruning-induced perturbations; from which a principled loss-based pruning criterion is derived. Extensive experiments on FMNIST, CIFAR-10, and CIFAR-100 using VGG and ResNet architectures under varying degrees of data heterogeneity demonstrate that CA-HFP preserves model accuracy while significantly reducing per-client computation and communication costs, outperforming standard federated training and existing pruning-based baselines.

cs.LG

An Attention-Enhanced Φ-OTDR Event Recognition Framework for Edge-Based Distributed Acoustic Sensing

Phase-sensitive optical time-domain reflectometry Φ-OTDR has emerged as a promising sensing technology in Internet of Things (IoT) infrastructures, enabling large-scale distributed acoustic sensing (DAS) for real-time monitoring at the edge in smart cities, industrial pipelines, and critical infrastructures. However, accurately recognizing events from massive Φ-OTDR data streams remains challenging, as existing deep learning methods either disrupt the inherent spatiotemporal structure of signals or incur prohibitive computational costs, limiting their applicability in resource-constrained edge computing scenarios. To overcome these challenges, we propose a novel STFT-based Attention-Enhanced Convolutional Neural Network (STFT-AECNN), which represents multi-channel time-series data as stacked spectrograms to fully exploit their spatiotemporal characteristics while enabling efficient 2D CNN processing. A Spatial Efficient Attention Module (SEAM) is further introduced to adaptively emphasize the most informative channels, and a joint Cross-Entropy and Triplet loss is adopted to enhance the discriminability of the learned feature space. Extensive experiments on the public BJTU Φ-OTDR dataset demonstrate that STFT-AECNN achieves a peak accuracy of 99.94% while maintaining high computational efficiency. These results highlight its potential for real-time, scalable, and robust event recognition in edge-based DAS systems, paving the way for reliable and intelligent IoT sensing applications.

eess.SP

FFT-MoE: Efficient Federated Fine-Tuning for Foundation Models via Large-scale Sparse MoE under Heterogeneous Edge

As FMs drive progress toward Artificial General Intelligence (AGI), fine-tuning them under privacy and resource constraints has become increasingly critical particularly when highquality training data resides on distributed edge devices. Federated Learning (FL) offers a compelling solution through Federated Fine-Tuning (FFT), which enables collaborative model adaptation without sharing raw data. Recent approaches incorporate Parameter-Efficient Fine-Tuning (PEFT) techniques such as Low Rank Adaptation (LoRA) to reduce computational overhead. However, LoRA-based FFT faces two major limitations in heterogeneous FL environments: structural incompatibility across clients with varying LoRA configurations and limited adaptability to non-IID data distributions, which hinders convergence and generalization. To address these challenges, we propose FFT MoE, a novel FFT framework that replaces LoRA with sparse Mixture of Experts (MoE) adapters. Each client trains a lightweight gating network to selectively activate a personalized subset of experts, enabling fine-grained adaptation to local resource budgets while preserving aggregation compatibility. To further combat the expert load imbalance caused by device and data heterogeneity, we introduce a heterogeneity-aware auxiliary loss that dynamically regularizes the routing distribution to ensure expert diversity and balanced utilization. Extensive experiments spanning both IID and non-IID conditions demonstrate that FFT MoE consistently outperforms state of the art FFT baselines in generalization performance and training efficiency.

cs.LG

Faster Convergence on Heterogeneous Federated Edge Learning: An Adaptive Clustered Data Sharing Approach

Federated Edge Learning (FEEL) emerges as a pioneering distributed machine learning paradigm for the 6G Hyper-Connectivity, harnessing data from the Internet of Things (IoT) devices while upholding data privacy. However, current FEEL algorithms struggle with non-independent and non-identically distributed (non-IID) data, leading to elevated communication costs and compromised model accuracy. To address these statistical imbalances within FEEL, we introduce a clustered data sharing framework, mitigating data heterogeneity by selectively sharing partial data from cluster heads to trusted associates through sidelink-aided multicasting. The collective communication pattern is integral to FEEL training, where both cluster formation and the efficiency of communication and computation impact training latency and accuracy simultaneously. To tackle the strictly coupled data sharing and resource optimization, we decompose the overall optimization problem into the clients clustering and effective data sharing subproblems. Specifically, a distribution-based adaptive clustering algorithm (DACA) is devised basing on three deductive cluster forming conditions, which ensures the maximum sharing yield. Meanwhile, we design a stochastic optimization based joint computed frequency and shared data volume optimization (JFVO) algorithm, determining the optimal resource allocation with an uncertain objective function. The experiments show that the proposed framework facilitates FEEL on non-IID datasets with faster convergence rate and higher model accuracy in a limited communication environment.

cs.LG

Split Federated Learning Over Heterogeneous Edge Devices: Algorithm and Optimization

Split Learning (SL) is a promising collaborative machine learning approach, enabling resource-constrained devices to train models without sharing raw data, while reducing computational load and preserving privacy simultaneously. However, current SL algorithms face limitations in training efficiency and suffer from prolonged latency, particularly in sequential settings, where the slowest device can bottleneck the entire process due to heterogeneous resources and frequent data exchanges between clients and servers. To address these challenges, we propose the Heterogeneous Split Federated Learning (HSFL) framework, which allows resource-constrained clients to train their personalized client-side models in parallel, utilizing different cut layers. Aiming to mitigate the impact of heterogeneous environments and accelerate the training process, we formulate a latency minimization problem that optimizes computational and transmission resources jointly. Additionally, we design a resource allocation algorithm that combines the Sample Average Approximation (SAA), Genetic Algorithm (GA), Lagrangian relaxation and Branch and Bound (B\&B) methods to efficiently solve this problem. Simulation results demonstrate that HSFL outperforms other frameworks in terms of both convergence rate and model accuracy on heterogeneous devices with non-iid data, while the optimization algorithm is better than other baseline methods in reducing latency.

cs.LG

The SkatingVerse Workshop & Challenge: Methods and Results

The SkatingVerse Workshop & Challenge aims to encourage research in developing novel and accurate methods for human action understanding. The SkatingVerse dataset used for the SkatingVerse Challenge has been publicly released. There are two subsets in the dataset, i.e., the training subset and testing subset. The training subsets consists of 19,993 RGB video sequences, and the testing subsets consists of 8,586 RGB video sequences. Around 10 participating teams from the globe competed in the SkatingVerse Challenge. In this paper, we provide a brief summary of the SkatingVerse Workshop & Challenge including brief introductions to the top three methods. The submission leaderboard will be reopened for researchers that are interested in the human action understanding challenge. The benchmark dataset and other information can be found at: https://skatingverse.github.io/.

cs.CV

A Microservices Identification Method Based on Spectral Clustering for Industrial Legacy Systems

The advent of Industrial Internet of Things (IIoT) has imposed more stringent requirements on industrial software in terms of communication delay, scalability, and maintainability. Microservice architecture (MSA), a novel software architecture that has emerged from cloud computing and DevOps, presents itself as the most promising solution due to its independently deployable and loosely coupled nature. Currently, practitioners are inclined to migrate industrial legacy systems to MSA, despite numerous challenges it presents. In this paper, we propose an automated microservice decomposition method for extracting microservice candidates based on spectral graph theory to address the problems associated with manual extraction, which is time-consuming, labor intensive, and highly subjective. The method is divided into three steps. Firstly, static and dynamic analysis tools are employed to extract dependency information of the legacy system. Subsequently, information is transformed into a graph structure that captures inter-class structure and performance relationships in legacy systems. Finally, graph-based clustering algorithm is utilized to identify potential microservice candidates that conform to the principles of high cohesion and low coupling. Comparative experiments with state of-the-art methods demonstrate the significant advantages of our proposed method in terms of performance metrics. Moreover, Practice show that our method can yield favorable results even without the involvement of domain experts.

cs.SE

Clustered Data Sharing for Non-IID Federated Learning over Wireless Networks

Federated Learning (FL) is a novel distributed machine learning approach to leverage data from Internet of Things (IoT) devices while maintaining data privacy. However, the current FL algorithms face the challenges of non-independent and identically distributed (non-IID) data, which causes high communication costs and model accuracy declines. To address the statistical imbalances in FL, we propose a clustered data sharing framework which spares the partial data from cluster heads to credible associates through device-to-device (D2D) communication. Moreover, aiming at diluting the data skew on nodes, we formulate the joint clustering and data sharing problem based on the privacy-preserving constrained graph. To tackle the serious coupling of decisions on the graph, we devise a distribution-based adaptive clustering algorithm (DACA) basing on three deductive cluster-forming conditions, which ensures the maximum yield of data sharing. The experiments show that the proposed framework facilitates FL on non-IID datasets with better convergence and model accuracy under a limited communication environment.

cs.LG

Asymptotic Soft Cluster Pruning for Deep Neural Networks

Filter pruning method introduces structural sparsity by removing selected filters and is thus particularly effective for reducing complexity. Previous works empirically prune networks from the point of view that filter with smaller norm contributes less to the final results. However, such criteria has been proven sensitive to the distribution of filters, and the accuracy may hard to recover since the capacity gap is fixed once pruned. In this paper, we propose a novel filter pruning method called Asymptotic Soft Cluster Pruning (ASCP), to identify the redundancy of network based on the similarity of filters. Each filter from over-parameterized network is first distinguished by clustering, and then reconstructed to manually introduce redundancy into it. Several guidelines of clustering are proposed to better preserve feature extraction ability. After reconstruction, filters are allowed to be updated to eliminate the effect caused by mistakenly selected. Besides, various decaying strategies of the pruning rate are adopted to stabilize the pruning process and improve the final performance as well. By gradually generating more identical filters within each cluster, ASCP can remove them through channel addition operation with almost no accuracy drop. Extensive experiments on CIFAR-10 and ImageNet datasets show that our method can achieve competitive results compared with many state-of-the-art algorithms.

cs.CV

Multi scale Feature Extraction and Fusion for Online Knowledge Distillation

Online knowledge distillation conducts knowledge transfer among all student models to alleviate the reliance on pre-trained models. However, existing online methods rely heavily on the prediction distributions and neglect the further exploration of the representational knowledge. In this paper, we propose a novel Multi-scale Feature Extraction and Fusion method (MFEF) for online knowledge distillation, which comprises three key components: Multi-scale Feature Extraction, Dual-attention and Feature Fusion, towards generating more informative feature maps for distillation. The multiscale feature extraction exploiting divide-and-concatenate in channel dimension is proposed to improve the multi-scale representation ability of feature maps. To obtain more accurate information, we design a dual-attention to strengthen the important channel and spatial regions adaptively. Moreover, we aggregate and fuse the former processed feature maps via feature fusion to assist the training of student models. Extensive experiments on CIF AR-10, CIF AR-100, and CINIC-10 show that MFEF transfers more beneficial representational knowledge for distillation and outperforms alternative methods among various network architectures

cs.CV

Age-driven Joint Sampling and Non-slot Based Scheduling for Industrial Internet of Things

Effective control of time-sensitive industrial applications depends on the real-time transmission of data from underlying sensors. Quantifying the data freshness through age of information (AoI), in this paper, we jointly design sampling and non-slot based scheduling policies to minimize the maximum time-average age of information (MAoI) among sensors with the constraints of average energy cost and finite queue stability. To overcome the intractability involving high couplings of such a complex stochastic process, we first focus on the single-sensor time-average AoI optimization problem and convert the constrained Markov decision process (CMDP) into an unconstrained Markov decision process (MDP) by the Lagrangian method. With the infinite-time average energy and AoI expression expended as the Bellman equation, the single-sensor time-average AoI optimization problem can be approached through the steady-state distribution probability. Further, we propose a low-complexity sub-optimal sampling and semi-distributed scheduling scheme for the multi-sensor scenario. The simulation results show that the proposed scheme reduces the MAoI significantly while achieving a balance between the sampling rate and service rate for multiple sensors.

cs.IT

An Adaptive Device-Edge Co-Inference Framework Based on Soft Actor-Critic

Recently, the applications of deep neural network (DNN) have been very prominent in many fields such as computer vision (CV) and natural language processing (NLP) due to its superior feature extraction performance. However, the high-dimension parameter model and large-scale mathematical calculation restrict the execution efficiency, especially for Internet of Things (IoT) devices. Different from the previous cloud/edge-only pattern that brings huge pressure for uplink communication and device-only fashion that undertakes unaffordable calculation strength, we highlight the collaborative computation between the device and edge for DNN models, which can achieve a good balance between the communication load and execution accuracy. Specifically, a systematic on-demand co-inference framework is proposed to exploit the multi-branch structure, in which the pre-trained Alexnet is right-sized through \emph{early-exit} and partitioned at an intermediate DNN layer. The integer quantization is enforced to further compress transmission bits. As a result, we establish a new Deep Reinforcement Learning (DRL) optimizer-Soft Actor Critic for discrete (SAC-d), which generates the \emph{exit point}, \emph{partition point}, and \emph{compressing bits} by soft policy iterations. Based on the latency and accuracy aware reward design, such an optimizer can well adapt to the complex environment like dynamic wireless channel and arbitrary CPU processing, and is capable of supporting the 5G URLLC. Real-world experiment on Raspberry Pi 4 and PC shows the outperformance of the proposed solution.

cs.LG

Robust Beamforming for SWIPT System with Chance Constraints

The robust beamforming problem in multiple-input single-output (MISO) downlink networks of simultaneous wireless information and power transfer (SWIPT) is studied in this paper. Adopting the time switching fashion to perform energy harvesting and information decoding respectively, we aim at maximizing the sum rate under imperfect channel state information (CSI) and the chance constraints of users' harvested energy. In view of the fact that the constraints for minimal harvested energy is not necessary to meet from time to time, this paper adopts chance constraint to model it and uses the Bernstein inequality to transform it into deterministic constraints equivalently. Recognizing the maximum sum rate problem of imperfect CSI as nonconvex problem, we transform it into finding the expectation of minimum mean square error (MMSE) equivalently in this paper, and an alternative optimization (AO) algorithm is proposed to decompose the optimization problem into two sub-problems: the transmit beamformer design and the division of switching time. The simulation results show the performance gains compared to non-robust state of the art schemes.

eess.SP

Mixed-timescale Per-group Hybrid Precoding for Multiuser Massive MIMO Systems

Considering the expensive radio frequency (RF) chain, huge training overhead and feedback burden issues in massive MIMO, in this letter, we propose a mixed-timescale per-group hybrid precoding (MPHP) scheme under an adaptive partially-connected RF precoding structure (PRPS), where the RF precoder is implemented using an adaptive connection network (ACN) and M analog phase shifters (APSs), where M is the number of antennas at the base station (BS). Exploiting the mixed-time stage channel state information (CSI) structure, the joint-design of ACN and APSs is formulated as a statistical signal-to-leakage-and-noise ratio (SSLNR) maximization problem, and a heuristic group RF precoding (GRFP) algorithm is proposed to provide a near-optimal solution. Simulation results show that the proposed design advances at better energy efficiency (EE) and lower hardware cost, CSI signaling overhead and computational complexity than the conventional hybrid precoding (HP) schemes.

eess.SP

Energy-Efficient Joint Offloading and Wireless Resource Allocation Strategy in Multi-MEC Server Systems

Mobile edge computing (MEC) is an emerging paradigm that mobile devices can offload the computation-intensive or latency-critical tasks to the nearby MEC servers, so as to save energy and extend battery life. Unlike the cloud server, MEC server is a small-scale data center deployed at a wireless access point, thus it is highly sensitive to both radio and computing resource. In this paper, we consider an Orthogonal Frequency-Division Multiplexing Access (OFDMA) based multi-user and multi-MEC-server system, where the task offloading strategies and wireless resources allocation are jointly investigated. Aiming at minimizing the total energy consumption, we propose the joint offloading and resource allocation strategy for latency-critical applications. Through the bi-level optimization approach, the original NP-hard problem is decoupled into the lower-level problem seeking for the allocation of power and subcarrier and the upper-level task offloading problem. Simulation results show that the proposed algorithm achieves excellent performance in energy saving and successful offloading probability (SOP) in comparison with conventional schemes.

cs.IT