Xiang Chen

Xiang Chen

Auto-generated profile, based on publicly available information

Xiang Chen

Peking University

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
26 April 2024 in IEEE Transactions on Wireless Communications
Verified
Journal Article
Closed access
WZWeishan Zhang
Weishan Zhang
YWYue Wang
Yue Wang
XCXiang Chen
Xiang Chen
ZCZhipeng Cai
Zhipeng Cai
ZTZhi Tian
Zhi Tian
Data-driven machine learning techniques have been advocated for signal detection in complex wireless environments. However, when applied to wideband spectrum sensing scenarios, they face practical challenges including very large data dimensionality, insufficient training data, and implicit inter-band dependencies. Current literature focuses on deep convolutional models, whose inherent model structure is not well suited for representing the diverse spectrum occupancy patterns of practical wideband networks, causing inefficient performance-complexity tradeoff and excessive sensing time. To address these issues, this paper develops a novel Spectrum Transformer with multi-task learning for wideband spectrum sensing at high sample efficiency. Empowered by the multi-head self-attention mechanism, the transformer architecture is designed to effectively learn both the inner-band spectral features and the inter-band spectrum occupancy correlations in the wideband regime. Simulations show that the proposed Spectrum Transformer outperforms the existing methods based on convolutional neural networks especially in the small-data case, by achieving higher sensing accuracy with an 89% reduction in model complexity.

23 October 2020 in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Verified
Journal Article
Closed access
FYFuxun Yu
Fuxun Yu
ZQZhuwei Qin
Zhuwei Qin
CLChenchen Liu
Chenchen Liu
Di WangDi Wang
Di Wang
XCXiang Chen
Xiang Chen
In recent years, the neural network (NN) has shown its great potential in image recognition tasks of autonomous driving systems, such as traffic sign recognition, pedestrian detection, etc. However, theoretically well-trained NNs usually fail their performance when facing real-world scenarios. For example, adverse real-world conditions, e.g., bad weather and lighting conditions, can introduce different physical variations and cause considerable accuracy degradation. As for now, the generalization capability of NNs is still one of the most critical challenges for the autonomous driving system. To facilitate the robust image recognition tasks, in this work, we build the RobuTS dataset: a comprehensive Robust Traffic Sign Recognition dataset, which includes images with different environmental variations, e.g., rain, fog, darkening, and blurring. Then to enhance the NN’s generalization capability, we propose two generalization-enhanced training schemes: 1) REIN for robust training without data in adverse scenarios and 2) Self-Teaching (ST) for robust training with unlabeled adverse data. The great advantages of such two training schemes are they are data-free ( REIN ) and label-free ( ST ), thus effectively reducing the huge human efforts/cost of on-road driving data collection, as well as the expensive manual data annotation. We conduct extensive experiments to validate our methods’ performance on both classification and detection tasks. For classification tasks, our proposed training algorithms could consistently improve model performance by +15%–25% ( REIN ) and +16%–30% ( ST ) in all adverse scenarios of our RobuTS datasets. For detection tasks, our ST could also improve the detector’s performance by +10.1 mean average precision (mAP) on Foggy-Cityscapes, outperforming previous state-of-the-art works by +2.2 mAP.

19 April 2024 in IEEE Transactions on Cognitive Communications and Networking
Verified
Journal Article
Closed access
WZWeishan Zhang
Weishan Zhang
YWYue Wang
Yue Wang
XCXiang Chen
Xiang Chen
LLLingjia Liu
Lingjia Liu
ZTZhi Tian
Zhi Tian
To deal with the complex wireless cognitive radios, data-driven learning technologies have been advocated for spectrum sensing. While the existing learning-based methods are designed for basic single-band circumstances, they may not work well in practical wideband regimes. Due to the limited sensing capability and hardware constraints of practical secondary users (SUs) devices, individual SUs can only collect limited training data to observe a narrowband part of the entire wideband spectrum pool. It is known as the issue of partial observations, which leads to a heterogeneous multi-task learning problem. To overcome these challenges, this work proposes a novel framework of cooperative spectrum sensing via collaborative learning among distributed SUs. Capitalizing on the hierarchical nature of neurons of deep neural networks (DNN) in heterogeneous feature extraction, we propose a novel multi-task DNN architecture to detect wideband spectrum occupancy accurately and efficiently. By decoupling the large multi-band DNN into smaller band-specific sub-networks, these sub-networks can be jointly trained among distributed SUs even with heterogeneous local data. Simulation results indicate that our proposed method outperforms existing benchmarks in small-data regimes by achieving higher learning accuracy with less model complexity and computational cost.

20 May 2020 in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Verified
Journal Article
Closed access
ZXZirui Xu
Zirui Xu
FYFuxun Yu
Fuxun Yu
ZQZhuwei Qin
Zhuwei Qin
CLChenchen Liu
Chenchen Liu
XCXiang Chen
Xiang Chen
Although convolutional neural networks (CNNs) have been widely applied in various cognitive applications, they are still very computationally intensive for resource-constrained mobile systems. To reduce the resource consumption of CNN computation, many optimization works have been proposed for mobile CNN deployment. However, most works are merely targeting CNN model compression from the perspective of parameter size or model structure, ignoring different resource constraints in mobile systems with respect to memory, energy, and real-time requirement. Moreover, previous works take accuracy as their primary consideration, requiring a time-costing retraining process to compensate the inference accuracy loss after compression. To address these issues, we propose DiReCtX —a dynamic resource-aware CNN model reconfiguration framework. DiReCtX is based on a set of accurate CNN profiling models for different resource consumption and inference accuracy estimation. With manageable consumption/accuracy tradeoffs, DiReCtX can reconfigure a CNN model to meet distinct resource constraint types and levels with expected inference performance maintained. To further achieve fast model reconfiguration in real-time, improved CNN model pruning and its corresponding accuracy tuning strategies are also proposed in DiReCtX . The experiments show that the proposed CNN profiling models can achieve 94.6% and 97.1% accuracy for CNN model resource consumption and inference accuracy estimation. Meanwhile, the proposed reconfiguration scheme of DiReCtX can achieve at most 44.44% computation acceleration, 31.69% memory reduction, and 32.39% energy saving, respectively. On field-tests with state-of-the-art smartphones, DiReCtX can adapt CNN models to various resource constraints in mobile application scenarios with optimal real-time performance.

13 September 2023 in IEEE Transactions on Neural Networks and Learning Systems
Verified
Journal Article
Closed access
PXPing Xu
Ping Xu
YWYue Wang
Yue Wang
XCXiang Chen
Xiang Chen
ZTZhi Tian
Zhi Tian
This article focuses on online kernel learning over a decentralized network. Each agent in the network receives online streaming data and collaboratively learns a globally optimal nonlinear prediction function in the reproducing kernel Hilbert space (RKHS). To overcome the curse of dimensionality issue in traditional online kernel learning, we utilize random feature (RF) mapping to convert the nonparametric kernel learning problem into a fixed-length parametric one in the RF space. We then propose a novel learning framework, named online decentralized kernel learning via linearized ADMM (ODKLA), to efficiently solve the online decentralized kernel learning problem. To enhance communication efficiency, we introduce quantization and censoring strategies in the communication stage, resulting in the quantized and communication-censored ODKLA (QC-ODKLA) algorithm. We theoretically prove that both ODKLA and QC-ODKLA can achieve the optimal sublinear regret $\mathcal{O}(\sqrt{T})$ over $T$ time slots. Through numerical experiments, we evaluate the learning effectiveness, communication efficiency, and computation efficiency of the proposed methods.