无监督深度学习解决认知中继网络中的功率分配问题

Yacine Benatia, Anne Savard, Romain Negrel, E. Belmega
{"title":"无监督深度学习解决认知中继网络中的功率分配问题","authors":"Yacine Benatia, Anne Savard, Romain Negrel, E. Belmega","doi":"10.1109/iccworkshops53468.2022.9814541","DOIUrl":null,"url":null,"abstract":"In this paper, an unsupervised deep learning approach is proposed to solve the constrained and non-convex Shannon rate maximization problem in a relay-aided cognitive radio network. This network consists of a primary and a sec-ondary user-destination pair and a secondary full-duplex relay performing Decode-and-Forward. The primary communication is protected by a Quality of Service (QoS) constraint in terms of tolerated Shannon rate degradation. The relaying operation leads to non-convex objective and primary QoS constraint, which makes deep learning approaches relevant and promising. For this, we propose a fully-connected neural network architecture coupled with a custom and communication-tailored loss function to be minimized during training in an unsupervised manner. A major interest of our approach is that the required training data contains only system parameters without the ground truth, i.e., the corresponding solutions to the non-convex optimization problem, as opposed to supervised approaches. Our numerical experiments show that our proposed approach has a high generalization capability on unseen data without overfitting. Also, the predicted solution performs close to the brute force one, highlighting the high potential of our unsupervised approach.","PeriodicalId":102261,"journal":{"name":"2022 IEEE International Conference on Communications Workshops (ICC Workshops)","volume":"54 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Unsupervised deep learning to solve power allocation problems in cognitive relay networks\",\"authors\":\"Yacine Benatia, Anne Savard, Romain Negrel, E. Belmega\",\"doi\":\"10.1109/iccworkshops53468.2022.9814541\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, an unsupervised deep learning approach is proposed to solve the constrained and non-convex Shannon rate maximization problem in a relay-aided cognitive radio network. This network consists of a primary and a sec-ondary user-destination pair and a secondary full-duplex relay performing Decode-and-Forward. The primary communication is protected by a Quality of Service (QoS) constraint in terms of tolerated Shannon rate degradation. The relaying operation leads to non-convex objective and primary QoS constraint, which makes deep learning approaches relevant and promising. For this, we propose a fully-connected neural network architecture coupled with a custom and communication-tailored loss function to be minimized during training in an unsupervised manner. A major interest of our approach is that the required training data contains only system parameters without the ground truth, i.e., the corresponding solutions to the non-convex optimization problem, as opposed to supervised approaches. Our numerical experiments show that our proposed approach has a high generalization capability on unseen data without overfitting. Also, the predicted solution performs close to the brute force one, highlighting the high potential of our unsupervised approach.\",\"PeriodicalId\":102261,\"journal\":{\"name\":\"2022 IEEE International Conference on Communications Workshops (ICC Workshops)\",\"volume\":\"54 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-05-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 IEEE International Conference on Communications Workshops (ICC Workshops)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/iccworkshops53468.2022.9814541\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 IEEE International Conference on Communications Workshops (ICC Workshops)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/iccworkshops53468.2022.9814541","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

本文提出了一种无监督深度学习方法来解决中继辅助认知无线电网络中的约束非凸香农速率最大化问题。该网络由一个主用户和一个辅助用户目的地对以及一个执行解码和转发的辅助全双工中继组成。根据可容忍的香农速率退化,主通信受到服务质量(QoS)约束的保护。中继操作导致非凸目标和初级QoS约束,这使得深度学习方法具有相关性和前景。为此,我们提出了一个全连接的神经网络架构,加上一个自定义的和通信定制的损失函数,以无监督的方式在训练过程中最小化。我们的方法的一个主要兴趣是所需的训练数据只包含系统参数而不包含基本真理,即非凸优化问题的相应解,与监督方法相反。数值实验表明,该方法对未见过的数据具有较高的泛化能力,不会出现过拟合现象。此外,预测的解决方案与蛮力解决方案接近,突出了我们的无监督方法的巨大潜力。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Unsupervised deep learning to solve power allocation problems in cognitive relay networks
In this paper, an unsupervised deep learning approach is proposed to solve the constrained and non-convex Shannon rate maximization problem in a relay-aided cognitive radio network. This network consists of a primary and a sec-ondary user-destination pair and a secondary full-duplex relay performing Decode-and-Forward. The primary communication is protected by a Quality of Service (QoS) constraint in terms of tolerated Shannon rate degradation. The relaying operation leads to non-convex objective and primary QoS constraint, which makes deep learning approaches relevant and promising. For this, we propose a fully-connected neural network architecture coupled with a custom and communication-tailored loss function to be minimized during training in an unsupervised manner. A major interest of our approach is that the required training data contains only system parameters without the ground truth, i.e., the corresponding solutions to the non-convex optimization problem, as opposed to supervised approaches. Our numerical experiments show that our proposed approach has a high generalization capability on unseen data without overfitting. Also, the predicted solution performs close to the brute force one, highlighting the high potential of our unsupervised approach.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信