Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Liu, Liangqi, Pu, Wenqiang, Li, Yingru, Luo, Zhi-Quan
Format: Preprint
Veröffentlicht: 2026
Schlagworte:
Online-Zugang:https://arxiv.org/abs/2604.11016
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
_version_ 1866910123338760192
author Liu, Liangqi
Pu, Wenqiang
Li, Yingru
Luo, Zhi-Quan
author_facet Liu, Liangqi
Pu, Wenqiang
Li, Yingru
Luo, Zhi-Quan
contents The dynamic competition against intelligent jammer systems presents a significant challenge to modern radar. Traditional active anti-jamming strategy learning methods often suffer from low sample efficiency and fail to fully exploit the structures of the adversary jammer. To reveal the inherent structure, this paper adopts an Online Convex Optimization (OCO) framework to capture the competition between a frequency agile radar and a digital radio frequency memory (DRFM)-based intelligent jammer. Recognizing that conventional OCO algorithms also suffer from suboptimal sample efficiency, two refined algorithms are developed that incorporate unbiased gradient estimators specifically tailored to the unique characteristics of DRFM-based jammers. Our theoretical analysis of the regret bound indicates significant improvements in long-term performance compared to standard OCO. The simulation results consistently show that our algorithms outperform traditional OCO and reinforcement learning baselines, achieving faster convergence and better anti-jamming performance.
format Preprint
id arxiv_https___arxiv_org_abs_2604_11016
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle Learning an Opponent-aware Anti-jamming Strategy via Online Convex Optimization
Liu, Liangqi
Pu, Wenqiang
Li, Yingru
Luo, Zhi-Quan
Signal Processing
The dynamic competition against intelligent jammer systems presents a significant challenge to modern radar. Traditional active anti-jamming strategy learning methods often suffer from low sample efficiency and fail to fully exploit the structures of the adversary jammer. To reveal the inherent structure, this paper adopts an Online Convex Optimization (OCO) framework to capture the competition between a frequency agile radar and a digital radio frequency memory (DRFM)-based intelligent jammer. Recognizing that conventional OCO algorithms also suffer from suboptimal sample efficiency, two refined algorithms are developed that incorporate unbiased gradient estimators specifically tailored to the unique characteristics of DRFM-based jammers. Our theoretical analysis of the regret bound indicates significant improvements in long-term performance compared to standard OCO. The simulation results consistently show that our algorithms outperform traditional OCO and reinforcement learning baselines, achieving faster convergence and better anti-jamming performance.
title Learning an Opponent-aware Anti-jamming Strategy via Online Convex Optimization
topic Signal Processing
url https://arxiv.org/abs/2604.11016