SearcharxivSearch

arXiv subjects

Huijun Xing

Publications and source records attributed to Huijun Xing.

14 recordsLinked to original sources

TEMPER: Tensorized Efficient Manifold-constrained Parameterization for Expressive Residual Routing

Residual connections rely on a static residual pathway, and are essential for training deep neural networks. Hyper-connections (HC) increase the expressivity of residual routing by incorporating multiple residual streams and learning dynamic information flow, while manifold-constrained (mHC) variants stabilize training through doubly stochastic residual mixing. However, a generator-level bottleneck remains in existing methods: they use dense, unstructured generators for pre-branch aggregation, residual mixing, and post-branch redistribution, which results in parameter count growing rapidly with the number of streams. To address this issue, we propose \underline{\textbf{T}}ensorized \underline{\textbf{E}}fficient \underline{\textbf{M}}anifold-constrained \underline{\textbf{P}}arameterization for \underline{\textbf{E}}xpressive Residual \underline{\textbf{R}}outing (\textbf{TEMPER}), which represents these generators as multi-way tensors over the input-stream, feature, and output-stream modes, and parameterizes them using tensor networks. Such a structured low-rank formulation is shown to preserve token-dependent manifold-constrained routing interface while substantially reducing parameter growth. It also promotes interpretability and intuition, as: i) tensor ranks control the dimensionality of the learned routing subspace, with full ranks recovering dense routing; while ii) the generator approximation errors bound differences in routing logits and, consequently, in the routed-block outputs. Comprehensive experiments show that TEMPER matches or outperforms existing methods across language modeling and commonsense reasoning tasks, while requiring substantially fewer additional parameters. At eight residual streams, TEMPER achieves the best CORE score while using about $84\%$ fewer additional parameters than mHC, thus showing a stronger performance-parameter efficiency trade-off.

cs.LG

Movable-Antenna Enabled Robust Vehicular Consumer Networks Under Imperfect CSI

The accelerating advancement of intelligent transportation systems has established consumer-oriented vehicular networks (CVNs) as a critical infrastructure for next-generation connected mobility. However, the high mobility of vehicular users (VUs) introduces significant channel state information (CSI) uncertainty, which severely undermines the performance of conventional fixed-position antenna systems. To address this, this paper explores the deployment of movable-antennas (MAs) to enhance communication robustness in CVNs under imperfect CSI conditions. We develop a joint optimization framework that dynamically coordinates the spatial positioning of MAs and transmit beamforming at the base station, with the objective of maximizing the worst-case sum rate across all VUs. The problem is formulated as a non-convex max-min optimization problem, subject to bounded CSI estimation errors, transmit power limits, and physical constraints on antenna displacement. By adopting an alternating optimization strategy, the original problem is decomposed into tractable subproblems, solved via techniques including the S-Procedure, Schur complement, and successive convex approximation. Numerical evaluations confirm that the proposed approach achieves substantial gains over existing benchmarks in terms of worst-case throughput.

eess.SP

Short Ticketing Detection Framework Analysis Report

This report presents a comprehensive analysis of an unsupervised multi-expert machine learning framework for detecting short ticketing fraud in railway systems. The study introduces an A/B/C/D station classification system that successfully identifies suspicious patterns across 30 high-risk stations. The framework employs four complementary algorithms: Isolation Forest, Local Outlier Factor, One-Class SVM, and Mahalanobis Distance. Key findings include the identification of five distinct short ticketing patterns and potential for short ticketing recovery in transportation systems.

cs.CR

UAV-Enabled Fluid Antenna Systems for Multi-Target Wireless Sensing over LAWCNs

Fluid antenna system (FAS) is emerging as a key technology for enhancing spatial flexibility and sensing accuracy in future wireless systems. This paper investigates an unmanned aerial vehicle (UAV)-enabled FAS for multi-target wireless sensing in low-altitude wireless consumer networks (LAWCNs) for achieving the low-altitude economy (LAE) missions. We formulate an optimization problem aimed at minimizing the average Cram\'er-Rao bound (CRB) for multiple target estimations. To tackle this non-convex problem, an efficient alternating optimization (AO) algorithm is proposed, which jointly optimizes the UAV trajectory, the antenna position of the transmit fluid antennas (FAs) and the receive FAs, and the transmit beamforming at the UAV. Simulation results demonstrate significant performance improvements in estimation accuracy and sensing reliability compared to conventional schemes, e.g., the fixed position antenna scheme. The proposed system achieves enhanced sensing performance through adaptive trajectory design and beamforming, alongside effective interference suppression via the flexible FAS antenna repositioning, underscoring its practical potential for precision sensing in the UAV-enabled LAWCNs.

cs.IT

Movable-Antenna Empowered AAV-Enabled Data Collection over Low-Altitude Wireless Networks

Movable-antennas (MAs) are revolutionizing spatial signal processing by providing flexible beamforming in next-generation wireless systems. This paper investigates an MA-empowered autonomous aerial vehicle (AAV) system in low-altitude wireless networks (LAWNs) for uplink data collection from ground users. We aim to maximize the sum achievable rate by jointly optimizing the AAV trajectory, receive beamforming, and MA positions. An efficient alternating optimization (AO) algorithm that incorporates successive convex approximation, weighted minimum mean square error, and particle swarm optimization is developed. The analysis of the computational complexity and convergence features is provided. Extensive simulations demonstrate superior performance in terms of the sum achievable rate and the service reliability comparing to several benchmark schemes. These results demonstrate the distinctive advantages of the proposed scheme: enhanced spectral efficiency via adaptive beam-user alignment and improved collection reliability through spatial interference management, highlighting the implementation potential of the MA-empowered LAWNs.

eess.SP

Coordinated Beamforming for RIS-Empowered ISAC Systems over Secure Low-Altitude Networks

Emerging as a cornerstone for next-generation wireless networks, integrated sensing and communication (ISAC) systems demand innovative solutions to balance spectral efficiency and sensing accuracy. In this paper, we propose a coordinated beamforming framework for a reconfigurable intelligent surface (RIS)-empowered ISAC system, where the active precoding at the dual-functional base station (DFBS) and the passive beamforming at the RIS are jointly optimized to provide communication services for legitimate unmanned aerial vehicles (UAVs) while sensing the unauthorized UAVs. The sum-rate of all legitimate UAVs are maximized, while satisfying the radar sensing signal-to-noise ratio requirements, the transmit power constraints, and the reflection coefficients of the RIS. To address the inherent non-convexity from coupled variables, we propose a low-complexity algorithm integrating fractional programming with alternating optimization, featuring convergence guarantees. Numerical results demonstrate that the proposed algorithm achieves higher data rate compared to disjoint optimization benchmarks. This underscores RIS's pivotal role in harmonizing communication and target sensing functionalities for low-altitude networks.

eess.SP

Full-Duplex Integrated Sensing, Communication, and Computation over Low-Altitude Wireless Networks

With low-altitude economies emerging as a pivotal sector, this study explores an integrated sensing, communication, and computation system over low-altitude wireless networks. A full-duplex autonomous aerial vehicle (AAV) operates as an AAV-enabled low-altitude platform (ALAP), concurrently executing data transmission, target sensing, and mobile edge computing services. To minimize systemic energy consumption under sensing beampattern constraints and computational demands, we formulate an optimization problem coordinating task allocation, computation resource allocation, and transmit/receive beamforming. Given the non-convexity and highly variable coupling, an efficient iterative convex approximation framework based on alternating optimization decomposes the problem into tractable subproblems. Moreover, the convergence and computational complexity of the proposed algorithm are rigorously analyzed. Simulations verify up to 54.12\% energy savings versus benchmarks.

eess.SP

Wireless Control over Edge Networks: Joint User Association and Communication-Computation Co-Design

This paper studies a wireless networked control system with multiple base stations (BSs) cooperatively coordinating the wireless control of a number of subsystems each consisting of a plant, a sensor, and an actuator. In this system, each sensor first offloads the sensing data to its associated BS, which then employs mobile edge computing (MEC) to process the data and sends the command signals back to the actuator for remote control. We consider the time-division-multiple-access (TDMA) service protocol among different BSs to facilitate the cascaded communication and computation process, in which different BSs implement the uplink data collection and downlink command broadcasting over orthogonal time slots. We also employ the massive multiple-input multiple-output (MIMO) at BSs, based on which each BS serves its associated sensors or actuators over the same time-frequency resources via spatial multiplexing. Under this setup, we jointly design the association between BSs and sensors/actuators as well as the joint communication and computation resource allocation, with the objective of minimizing the closed-loop control latency of the multiple subsystems while ensuring their control stability. The optimization takes into account the transmission uncertainty caused by both the hyper reliable and low-latency communications (HRLLC) and the inter-user interference , as well as the communication and computation resource constraints at distributed nodes. To solve the challenging non-convex joint optimization problem, we develop an efficient algorithm by employing the techniques of alternating optimization and successive convex approximation (SCA). Numerical results show that the proposed joint BS-sensor/actuator association and resource allocation design significantly outperforms other heuristic schemes and frequency-division-multiple-access (FDMA) counterpart.

cs.IT

Latency Minimization for UAV-Enabled Federated Learning: Trajectory Design and Resource Allocation

Federated learning (FL) has become a transformative paradigm for distributed machine learning across wireless networks. However, the performance of FL is often hindered by the unreliable communication links between resource-constrained Internet of Things (IoT) devices and the central server. To overcome this challenge, we propose a novel framework that employs an unmanned aerial vehicle (UAV) as a mobile server to enhance the FL training process. By capitalizing on the UAV's mobility, we establish strong line-of-sight connections with IoT devices, thereby enhancing communication reliability and capacity. To maximize training efficiency, we formulate a latency minimization problem that jointly optimizes bandwidth allocation, computing frequencies, transmit power for both the UAV and IoT devices, and the UAV's flight trajectory. Subsequently, we analyze the required rounds of the IoT devices training and the UAV aggregation for FL convergence. Based on the convergence constraint, we transform the problem into three subproblems and develop an efficient alternating optimization algorithm to solve this problem effectively. Additionally, we provide a thorough analysis of the algorithm's convergence and computational complexity. Extensive numerical results demonstrate that our proposed scheme not only surpasses existing benchmark schemes in reducing latency up to 15.29%, but also achieves training efficiency that nearly matches the ideal scenario.

eess.SP

Latency-Aware Resource Allocation for Mobile Edge Generation and Computing via Deep Reinforcement Learning

Recently, the integration of mobile edge computing (MEC) and generative artificial intelligence (GAI) technology has given rise to a new area called mobile edge generation and computing (MEGC), which offers mobile users heterogeneous services such as task computing and content generation. In this letter, we investigate the joint communication, computation, and the AIGC resource allocation problem in an MEGC system. A latency minimization problem is first formulated to enhance the quality of service for mobile users. Due to the strong coupling of the optimization variables, we propose a new deep reinforcement learning-based algorithm to solve it efficiently. Numerical results demonstrate that the proposed algorithm can achieve lower latency than two baseline algorithms.

eess.SY

Joint Association, Beamforming, and Resource Allocation for Multi-IRS Enabled MU-MISO Systems With RSMA

Intelligent reflecting surface (IRS) and rate-splitting multiple access (RSMA) technologies are at the forefront of enhancing spectrum and energy efficiency in the next generation multi-antenna communication systems. This paper explores a RSMA system with multiple IRSs, and proposes two purpose-driven scheduling schemes, i.e., the exhaustive IRS-aided (EIA) and opportunistic IRS-aided (OIA) schemes. The aim is to optimize the system weighted energy efficiency (EE) under the above two schemes, respectively. Specifically, the Dinkelbach, branch and bound, successive convex approximation, and the semidefinite relaxation methods are exploited within the alternating optimization framework to obtain effective solutions to the considered problems. The numerical findings indicate that the EIA scheme exhibits better performance compared to the OIA scheme in diverse scenarios when considering the weighted EE, and the proposed algorithm demonstrates superior performance in comparison to the baseline algorithms.

eess.SP

UAV-Enabled Wireless Networks with Movable-Antenna Array: Flexible Beamforming and Trajectory Design

Recently, movable antenna (MA) array becomes a promising technology for improving the communication quality in wireless communication systems. In this letter, an unmanned aerial vehicle (UAV) enabled multi-user multi-input-single-output system enhanced by the MA array is investigated. To enhance the throughput capacity, we aim to maximize the achievable data rate by jointly optimizing the transmit beamforming, the UAV trajectory, and the positions of the MA array antennas. The formulated data rate maximization problem is a highly coupled non-convex problem, for which an alternating optimization based algorithm is proposed to get a sub-optimal solution. Numerical results have demonstrated the performance gain of the proposed method compared with conventional method with fixed-position antenna array.

eess.SP

Joint Signal Detection and Automatic Modulation Classification via Deep Learning

Signal detection and modulation classification are two crucial tasks in various wireless communication systems. Different from prior works that investigate them independently, this paper studies the joint signal detection and automatic modulation classification (AMC) by considering a realistic and complex scenario, in which multiple signals with different modulation schemes coexist at different carrier frequencies. We first generate a coexisting RADIOML dataset (CRML23) to facilitate the joint design. Different from the publicly available AMC dataset ignoring the signal detection step and containing only one signal, our synthetic dataset covers the more realistic multiple-signal coexisting scenario. Then, we present a joint framework for detection and classification (JDM) for such a multiple-signal coexisting environment, which consists of two modules for signal detection and AMC, respectively. In particular, these two modules are interconnected using a designated data structure called "proposal". Finally, we conduct extensive simulations over the newly developed dataset, which demonstrate the effectiveness of our designs. Our code and dataset are now available as open-source (https://github.com/Singingkettle/ChangShuoRadioData).

eess.SP

Over-the-Air Computation in OFDM Systems with Imperfect Channel State Information

This paper studies the over-the-air computation (AirComp) in an orthogonal frequency division multiplexing (OFDM) system with imperfect channel state information (CSI), in which multiple single-antenna wireless devices (WDs) simultaneously send uncoded signals to a multi-antenna access point (AP) for distributed functional computation over multiple subcarriers. In particular, we consider two scenarios with best-effort and error-constrained computation tasks, with the objectives of minimizing the average computation mean squared error (MSE) and the computation outage probability over the multiple subcarriers, respectively. Towards this end, we jointly optimize the transmit coefficients at the WDs and the receive beamforming vectors at the AP over subcarriers, subject to the maximum transmit power constraints at individual WDs. First, for the special case with a single receive antenna at the AP, we propose the semi-closed-form globally optimal solutions to the two problems using the Lagrange-duality method. It is shown that at each subcarrier, the WDs' optimized power control policy for average MSE minimization follows a regularized channel inversion structure, while that for computation outage probability minimization follows an on-off regularized channel inversion, with the regularization dependent on the transmit power budget and channel estimation error. Next, for the general case with multiple receive antennas at the AP, we present efficient algorithms based on alternating optimization and convex optimization to find converged solutions to both problems.

eess.SP