Deep Learning Beam Optimization in Millimeter-Wave Communication Systems

• URL: http://arxiv.org/abs/2107.07846v1
• Date: Fri, 16 Jul 2021 12:16:37 GMT
• Title: Deep Learning Beam Optimization in Millimeter-Wave Communication Systems
• Abstract summary: We propose a method that combines fixed point algorithms with a neural network to optimize jointly discrete and continuous variables in millimeter-wave communication systems. The proposed method predicts the beam configuration in a "one-shot" manner, which significantly reduces the complexity of the beam search procedure.
• Score: 34.03893373401685
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We propose a method that combines fixed point algorithms with a neural network to optimize jointly discrete and continuous variables in millimeter-wave communication systems, so that the users' rates are allocated fairly in a well-defined sense. In more detail, the discrete variables include user-access point assignments and the beam configurations, while the continuous variables refer to the power allocation. The beam configuration is predicted from user-related information using a neural network. Given the predicted beam configuration, a fixed point algorithm allocates power and assigns users to access points so that the users achieve the maximum fraction of their interference-free rates. The proposed method predicts the beam configuration in a "one-shot" manner, which significantly reduces the complexity of the beam search procedure. Moreover, even if the predicted beam configurations are not optimal, the fixed point algorithm still provides the optimal power allocation and user-access point assignments for the given beam configuration.

Related papers

• Automating Variational Quantum Sensing through Reinforcement-Learned Circuit Structures [8.108113752089812]
  textscAutoQSense is a reinforcement-learning framework that searches circuit architectures using Fisher-information-based objectives.<n>Results show that the learned architectures recover known benchmark strategies, adapt to dephasing noise, and outperform fixed hardware-efficient anstze.
  arXiv  Detail & Related papers  (2026-08-18T09:47:37Z)
• Data-driven configuration tuning of glmnet to balance accuracy and computation time [0.0]
  glmnet is a widely adopted R package for lasso estimation due to its computational efficiency.<n>Despite its popularity, glmnet sometimes yields solutions that are substantially different from the true ones because of the inappropriate default configuration.<n>We propose a unified data-driven framework specifically designed to optimize the configuration by balancing the trade-off between accuracy and computational efficiency.
  arXiv  Detail & Related papers  (2026-02-20T00:58:59Z)
• SPOT: Single-Shot Positioning via Trainable Near-Field Rainbow Beamforming [30.17676225756566]
  This paper proposes an end-to-end deep learning-based scheme that simultaneously designs the rainbow beams and estimates user positions.<n>The proposed method reduces overhead by an order of magnitude and delivers consistently lower two-dimensional positioning error.
  arXiv  Detail & Related papers  (2025-11-14T15:21:35Z)
• Physics-Informed Parametric Bandits for Beam Alignment in mmWave Communications [19.693175084764]
  In millimeter wave (mmWave) communications, beam alignment and tracking are crucial to combat the significant path loss.<n>We propose two physics-informed bandit algorithms textitpretc and textitprgreedy that exploit the sparse multipath property of mmWave channels.<n>Our algorithms treat the parameters of each path as black boxes and maintain optimal estimates of them based on sampled historical rewards.
  arXiv  Detail & Related papers  (2025-10-21T05:07:07Z)
• SACA: Selective Attention-Based Clustering Algorithm [2.8412470965721113]
  This paper presents a novel density-based clustering method inspired by the concept of selective attention.<n>The method minimizes the need for user-defined parameters under standard conditions.<n> Experimental evaluations on diverse data sets highlight the accessibility and robust performance of the method.
  arXiv  Detail & Related papers  (2025-08-23T22:07:01Z)
• Adaptive Online Bayesian Estimation of Frequency Distributions with Local Differential Privacy [0.4604003661048266]
  We propose a novel approach for the adaptive and online estimation of the frequency distribution of a finite number of categories under the local differential privacy (LDP) framework. The proposed algorithm performs Bayesian parameter estimation via posterior sampling and adapts the randomization mechanism for LDP based on the obtained posterior samples. We provide a theoretical analysis showing that (i) the posterior distribution targeted by the algorithm converges to the true parameter even for approximate posterior sampling, and (ii) the algorithm selects the optimal subset with high probability if posterior sampling is performed exactly.
  arXiv  Detail & Related papers  (2024-05-11T13:59:52Z)
• Quantization Avoids Saddle Points in Distributed Optimization [1.579622195923387]
  Distributed non optimization underpins key functionalities of numerous distributed systems. The aim of this paper is to prove that it can effectively escape saddle points convergence to a second-order stationary point convergence. With an easily adjustable quantization, the approach allows a user control to aggressively reduce communication overhead.
  arXiv  Detail & Related papers  (2024-03-15T15:58:20Z)
• Random Aggregate Beamforming for Over-the-Air Federated Learning in Large-Scale Networks [66.18765335695414]
  We consider a joint device selection and aggregate beamforming design with the objectives of minimizing the aggregate error and maximizing the number of selected devices. To tackle the problems in a cost-effective manner, we propose a random aggregate beamforming-based scheme. We additionally use analysis to study the obtained aggregate error and the number of the selected devices when the number of devices becomes large.
  arXiv  Detail & Related papers  (2024-02-20T23:59:45Z)
• Learning-Based Adaptive User Selection in Millimeter Wave Hybrid Beamforming Systems [5.657669046936923]
  We consider a multi-user hybrid beamforming system, where the multiplexing gain is limited by the small number of chains employed at the base station (BS) To allow greater freedom for maximizing the multiplexing gain, it is better if the BS selects and serves some of the users at each scheduling instant, rather than serving all the users all the time. We propose a machine learning (ML)-based user selection algorithm to provide an efficient trade-off between the PF performance and the time.
  arXiv  Detail & Related papers  (2023-02-16T11:46:36Z)
• Fast Beam Alignment via Pure Exploration in Multi-armed Bandits [91.11360914335384]
  We develop a bandit-based fast BA algorithm to reduce BA latency for millimeter-wave (mmWave) communications. Our algorithm is named Two-Phase Heteroscedastic Track-and-Stop (2PHT&S)
  arXiv  Detail & Related papers  (2022-10-23T05:57:39Z)
• Green, Quantized Federated Learning over Wireless Networks: An Energy-Efficient Design [68.86220939532373]
  The finite precision level is captured through the use of quantized neural networks (QNNs) that quantize weights and activations in fixed-precision format. The proposed FL framework can reduce energy consumption until convergence by up to 70% compared to a baseline FL algorithm.
  arXiv  Detail & Related papers  (2022-07-19T16:37:24Z)
• Large-Scale Sequential Learning for Recommender and Engineering Systems [91.3755431537592]
  In this thesis, we focus on the design of an automatic algorithms that provide personalized ranking by adapting to the current conditions. For the former, we propose novel algorithm called SAROS that take into account both kinds of feedback for learning over the sequence of interactions. The proposed idea of taking into account the neighbour lines shows statistically significant results in comparison with the initial approach for faults detection in power grid.
  arXiv  Detail & Related papers  (2022-05-13T21:09:41Z)
• Communication-Efficient Stochastic Zeroth-Order Optimization for Federated Learning [28.65635956111857]
  Federated learning (FL) enables edge devices to collaboratively train a global model without sharing their private data. To enhance the training efficiency of FL, various algorithms have been proposed, ranging from first-order computation to first-order methods.
  arXiv  Detail & Related papers  (2022-01-24T08:56:06Z)
• Deep Learning Assisted Calibrated Beam Training for Millimeter-Wave Communication Systems [15.297530726877786]
  Huge overhead of beam training imposes a significant challenge in millimeter-wave (mmWave) wireless communications. We propose a wide beam based training approach to calibrate the narrow beam direction according to the channel power leakage. To handle the complex nonlinear properties of the channel power leakage, deep learning is utilized to predict the optimal narrow beam directly.
  arXiv  Detail & Related papers  (2021-01-08T04:02:34Z)
• Joint Deep Reinforcement Learning and Unfolding: Beam Selection and Precoding for mmWave Multiuser MIMO with Lens Arrays [54.43962058166702]
  millimeter wave (mmWave) multiuser multiple-input multiple-output (MU-MIMO) systems with discrete lens arrays have received great attention. In this work, we investigate the joint design of a beam precoding matrix for mmWave MU-MIMO systems with DLA.
  arXiv  Detail & Related papers  (2021-01-05T03:55:04Z)
• Device Heterogeneity in Federated Learning: A Superquantile Approach [0.0]
  We propose a framework to handle heterogeneous client devices which do not conform to the population data distribution. We present an optimization algorithm and establish its convergence to a stationary point. We conclude with numerical experiments on neural networks as well as linear models on tasks from computer vision and natural language processing.
  arXiv  Detail & Related papers  (2020-02-25T23:37:35Z)

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.