arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2008.10149cs.ITcs.LGmath.IT
收藏

基于上下文Thompson采样的认知雷达-蜂窝共存高效在线学习

Efficient Online Learning for Cognitive Radar-Cellular Coexistence via Contextual Thompson Sampling

Virginia Tech(弗吉尼亚理工大学);U.S Army Research Laboratory(美国陆军研究实验室)

Charles E. Thornton, R. Michael Buehrer, Anthony F. Martone

摘要:

本文介绍了一种顺序的,或在线的,自适应雷达传输,促进频谱共享与非合作蜂窝网络的学习计划。首先,雷达和空间上遥远的蜂窝网络之间的干扰信道进行建模。然后,应用线性上下文Bandit(CB)学习框架来驱动雷达的行为。探索和开发之间的基本权衡是平衡的汤普森采样(TS)算法,一个伪贝叶斯方法,选择波形参数的后验概率的基础上,一个特定的波形是最佳的,折扣信道信息作为上下文。结果表明,上下文TS方法收敛更快的行为,最大限度地减少相互干扰,最大限度地提高频谱利用率比可比的上下文强盗算法。此外,我们表明,TS学习计划的结果在一个有利的SINR分布相比,其他在线学习算法。最后,将所提出的TS算法与深度强化学习模型进行了比较。我们证明了TS算法在更复杂的深度Q网络(DQN)中保持了有竞争力的性能。

英文摘要:

This paper describes a sequential, or online, learning scheme for adaptive radar transmissions that facilitate spectrum sharing with a non-cooperative cellular network. First, the interference channel between the radar and a spatially distant cellular network is modeled. Then, a linear Contextual Bandit (CB) learning framework is applied to drive the radar's behavior. The fundamental trade-off between exploration and exploitation is balanced by a proposed Thompson Sampling (TS) algorithm, a pseudo-Bayesian approach which selects waveform parameters based on the posterior probability that a specific waveform is optimal, given discounted channel information as context. It is shown that the contextual TS approach converges more rapidly to behavior that minimizes mutual interference and maximizes spectrum utilization than comparable contextual bandit algorithms. Additionally, we show that the TS learning scheme results in a favorable SINR distribution compared to other online learning algorithms. Finally, the proposed TS algorithm is compared to a deep reinforcement learning model. We show that the TS algorithm maintains competitive performance with a more complex Deep Q-Network (DQN).

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑