Semi-Supervised RF Fingerprinting with Consistency-Based Regularization

• URL: http://arxiv.org/abs/2304.14795v1
• Date: Fri, 28 Apr 2023 12:08:07 GMT
• Title: Semi-Supervised RF Fingerprinting with Consistency-Based Regularization
• Authors: Weidong Wang, Cheng Luo, Jiancheng An, Lu Gan, Hongshu Liao, and Chau Yuen
• Abstract summary: Radio frequency (RF) fingerprinting can greatly improve wireless security. Recent work has shown that RF fingerprinting based on deep learning can significantly outperform conventional approaches. We leverage deep semi-supervised learning for RF fingerprinting, which relies on a composite data augmentation scheme designed for radio signals.
• Score: 18.860503392365644
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: As a promising non-password authentication technology, radio frequency (RF) fingerprinting can greatly improve wireless security. Recent work has shown that RF fingerprinting based on deep learning can significantly outperform conventional approaches. The superiority, however, is mainly attributed to supervised learning using a large amount of labeled data, and it significantly degrades if only limited labeled data is available, making many existing algorithms lack practicability. Considering that it is often easier to obtain enough unlabeled data in practice with minimal resources, we leverage deep semi-supervised learning for RF fingerprinting, which largely relies on a composite data augmentation scheme designed for radio signals, combined with two popular techniques: consistency-based regularization and pseudo-labeling. Experimental results on both simulated and real-world datasets demonstrate that our proposed method for semi-supervised RF fingerprinting is far superior to other competing ones, and it can achieve remarkable performance almost close to that of fully supervised learning with a very limited number of examples.

Related papers

• Open-Set RF Fingerprinting via Improved Prototype Learning [7.956132769841986]
  We exploit prototype learning for open-set RF fingerprinting. We propose two improvements, including consistency-based regularization and online label smoothing. Experimental results on a real-world RF dataset demonstrate that our proposed measures can significantly improve prototype learning.
  arXiv  Detail & Related papers  (2023-06-24T08:04:06Z)
• Federated Radio Frequency Fingerprinting with Model Transfer and Adaptation [26.646820912136416]
  We propose a federated RF fingerprinting algorithm with a novel strategy called model transfer and adaptation. The proposed algorithm introduces dense connectivity among convolutional layers into RF fingerprinting to enhance learning accuracy and reduce model complexity. Compared with state-of-the-art RF fingerprinting algorithms, our algorithm can improve prediction performance considerably with a performance gain of up to 15%.
  arXiv  Detail & Related papers  (2023-02-22T14:55:30Z)
• Higher-order accurate two-sample network inference and network hashing [13.984114642035692]
  Two-sample hypothesis testing for network comparison presents many significant challenges. We develop a comprehensive toolbox featuring a novel main method and its variants. Our method outperforms existing tools in speed and accuracy, and it is proved power-optimal.
  arXiv  Detail & Related papers  (2022-08-16T07:31:11Z)
• Disentangled Representation Learning for RF Fingerprint Extraction under Unknown Channel Statistics [77.13542705329328]
  We propose a framework of disentangled representation learning(DRL) that first learns to factor the input signals into a device-relevant component and a device-irrelevant component via adversarial learning. The implicit data augmentation in the proposed framework imposes a regularization on the RFF extractor to avoid the possible overfitting of device-irrelevant channel statistics. Experiments validate that the proposed approach, referred to as DR-RFF, outperforms conventional methods in terms of generalizability to unknown complicated propagation environments.
  arXiv  Detail & Related papers  (2022-08-04T15:46:48Z)
• Unsupervised Domain Adaptation for RF-based Gesture Recognition [14.523667781155666]
  We propose an unsupervised domain adaptation framework for RF-based gesture recognition. We first propose pseudo-labeling and consistency regularization to utilize unlabeled data for model training. We then design two corresponding data augmentation methods based on the characteristic of the RF signals to strengthen the performance of the consistency regularization.
  arXiv  Detail & Related papers  (2021-11-20T14:25:35Z)
• On Deep Learning with Label Differential Privacy [54.45348348861426]
  We study the multi-class classification setting where the labels are considered sensitive and ought to be protected. We propose a new algorithm for training deep neural networks with label differential privacy, and run evaluations on several datasets.
  arXiv  Detail & Related papers  (2021-02-11T15:09:06Z)
• Coresets for Robust Training of Neural Networks against Noisy Labels [78.03027938765746]
  We propose a novel approach with strong theoretical guarantees for robust training of deep networks trained with noisy labels. We select weighted subsets (coresets) of clean data points that provide an approximately low-rank Jacobian matrix. Our experiments corroborate our theory and demonstrate that deep networks trained on our subsets achieve a significantly superior performance compared to state-of-the art.
  arXiv  Detail & Related papers  (2020-11-15T04:58:11Z)
• FedRec: Federated Learning of Universal Receivers over Fading Channels [92.15358738530037]
  We propose a neural network-based symbol detection technique for downlink fading channels. Multiple users collaborate to jointly learn a universal data-driven detector, hence the name FedRec. The performance of the resulting receiver is shown to approach the MAP performance in diverse channel conditions without requiring knowledge of the fading statistics.
  arXiv  Detail & Related papers  (2020-11-14T11:29:55Z)
• Learning to Count in the Crowd from Limited Labeled Data [109.2954525909007]
  We focus on reducing the annotation efforts by learning to count in the crowd from limited number of labeled samples. Specifically, we propose a Gaussian Process-based iterative learning mechanism that involves estimation of pseudo-ground truth for the unlabeled data.
  arXiv  Detail & Related papers  (2020-07-07T04:17:01Z)
• Reinforcement Learning with Augmented Data [97.42819506719191]
  We present Reinforcement Learning with Augmented Data (RAD), a simple plug-and-play module that can enhance most RL algorithms. We show that augmentations such as random translate, crop, color jitter, patch cutout, random convolutions, and amplitude scale can enable simple RL algorithms to outperform complex state-of-the-art methods.
  arXiv  Detail & Related papers  (2020-04-30T17:35:32Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.