用元学习联合优化天线位置与波束成形,显著提升通信速率。
A Gradient Meta-Learning Joint Optimization for Beamforming and Antenna Position in Pinching-Antenna Systems
- 通过梯度元学习将问题拆解为波束成形与天线位置两个子任务并行求解。
- 100次迭代内达5.6 bits/s/Hz加权和速率,比传统方法提升32.7%。
- 对初始值不敏感,适合复杂动态场景下的实时优化应用。
本文针对多波导夹持天线系统,提出一种联合优化波束成形系数与天线位置的新方法,以最大化加权和速率(WSR)。针对非凸优化难题,设计了一种基于梯度的元学习联合优化(GML-JO)算法。首先通过等价代换将原问题分解为波束成形与天线位置两个子问题;再采用凸近似处理子问题中的非凸约束,并构建两个子神经网络分别求解。与交替优化(AO)不同,GML-JO将固定信道系数下的子网络视为局部子任务,利用多个子任务的平均损失函数更新参数,获得对初始值不敏感的鲁棒解。仿真表明,该算法在100次迭代内达到5.6 bits/s/Hz的加权和速率,相比传统AO提升32.7%,且计算复杂度大幅降低。同时,该方法对初始化选择不敏感,性能优于现有优化方法。
原文摘要 · Abstract (English)
In this paper, we consider a novel optimization design for multi-waveguide pinching-antenna systems, aiming to maximize the weighted sum rate (WSR) by jointly optimizing beamforming coefficients and antenna position. To handle the formulated non-convex problem, a gradient-based meta-learning joint optimization (GML-JO) algorithm is proposed. Specifically, the original problem is initially decomposed into two sub-problems of beamforming optimization and antenna position optimization through equivalent substitution. Then, the convex approximation methods are used to deal with the nonconvex constraints of sub-problems, and two sub-neural networks are constructed to calculate the sub-problems separately. Different from alternating optimization (AO), where two sub-problems are solved alternately and the solutions are influenced by the initial values, two sub-neural networks of proposed GML-JO with fixed channel coefficients are considered as local sub-tasks and the computation results are used to calculate the loss function of joint optimization. Finally, the parameters of sub-networks are updated using the average loss function over different sub-tasks and the solution that is robust to the initial value is obtained. Simulation results demonstrate that the proposed GML-JO algorithm achieves 5.6 bits/s/Hz WSR within 100 iterations, yielding a 32.7\% performance enhancement over conventional AO with substantially reduced computational complexity. Moreover, the proposed GML-JO algorithm is robust to different choices of initialization and yields better performance compared with the existing optimization methods.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。