Learning-Based Adaptive User Selection in Millimeter Wave Hybrid Beamforming Systems

• URL: http://arxiv.org/abs/2302.08240v1
• Date: Thu, 16 Feb 2023 11:46:36 GMT
• Title: Learning-Based Adaptive User Selection in Millimeter Wave Hybrid Beamforming Systems
• Authors: Junghoon Kim and Matthew Andrews
• Abstract summary: 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.
• Score: 5.657669046936923
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We consider a multi-user hybrid beamforming system, where the multiplexing gain is limited by the small number of RF 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 adopt a two-timescale protocol that takes into account the mmWave characteristics, where at the long timescale an analog beam is chosen for each user, and at the short timescale users are selected for transmission based on the chosen analog beams. The goal of the user selection is to maximize the traditional Proportional Fair (PF) metric. However, this maximization is non-trivial due to interference between the analog beams for selected users. We first define a greedy algorithm and a "top-k" algorithm, and then propose a machine learning (ML)-based user selection algorithm to provide an efficient trade-off between the PF performance and the computation time. Throughout simulations, we analyze the performance of the ML-based algorithms under various metrics, and show that it gives an efficient trade-off in performance as compared to counterparts.

Related papers

• Learning-Based Multiuser Scheduling in MIMO-OFDM Systems with Hybrid Beamforming [1.4272256806865102]
  We investigate the multiuser scheduling problem in multiple-input multiple-output (MIMO) systems using frequency division multiplexing (OFDM) and hybrid beamforming.<n>To conduct scheduling, we propose solutions, such as greedy and sorting algorithms, followed by a machine learning (ML) approach.
  arXiv  Detail & Related papers  (2025-06-09T21:59:05Z)
• Learning to Interfere in Non-Orthogonal Multiple-Access Joint Source-Channel Coding [0.25602836891933073]
  We introduce a machine learning-aided wireless image transmission method that merges compression and channel coding using a multi-view autoencoder. Our method scales up to 16 users and beyond, with only a 0.6% increase in the number of trainable parameters compared to a single-user model.
  arXiv  Detail & Related papers  (2025-03-23T12:27:20Z)
• Training-Free Graph Filtering via Multimodal Feature Refinement for Extremely Fast Multimodal Recommendation [8.462186629861046]
  We propose MultiModal-Graph Filtering (MM-GF) for efficient and accurate multimodal recommendations. MM-GF is a training-free method based on the notion of graph filtering (GF) for efficient and accurate multimodal recommendations. Experiments on real-world benchmark datasets demonstrate that MM-GF not only improves recommendation accuracy by up to 13.35% compared to the best competitor but also dramatically reduces computational costs by achieving the runtime of less than 10 seconds.
  arXiv  Detail & Related papers  (2025-03-06T13:00:53Z)
• Twin Sorting Dynamic Programming Assisted User Association and Wireless Bandwidth Allocation for Hierarchical Federated Learning [7.274131715810928]
  We study user association and wireless bandwidth allocation for a hierarchical federated learning system. We design the twin sorting dynamic programming (TSDP) algorithm that obtains a globally optimal solution in time when there are two edge servers. In addition, we put forward the TSDP-assisted algorithm for user association when there are three or more edge servers.
  arXiv  Detail & Related papers  (2024-08-17T02:29:32Z)
• Learning Optimal Linear Precoding for Cell-Free Massive MIMO with GNN [15.271970287767164]
  We develop a graph neural network (GNN) to compute, within a time budget of 1 to 2 milliseconds required by practical systems. We show that it achieves near optimal spectral efficiency in a range of scenarios with different number of APs and UEs.
  arXiv  Detail & Related papers  (2024-06-06T19:29:33Z)
• Communication Efficient ConFederated Learning: An Event-Triggered SAGA Approach [67.27031215756121]
  Federated learning (FL) is a machine learning paradigm that targets model training without gathering the local data over various data sources. Standard FL, which employs a single server, can only support a limited number of users, leading to degraded learning capability. In this work, we consider a multi-server FL framework, referred to as emphConfederated Learning (CFL) in order to accommodate a larger number of users.
  arXiv  Detail & Related papers  (2024-02-28T03:27:10Z)
• 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)
• Towards A Flexible Accuracy-Oriented Deep Learning Module Inference Latency Prediction Framework for Adaptive Optimization Algorithms [0.49157446832511503]
  This paper presents a framework for a deep learning module inference latency prediction framework. It hosts a set of customizable input parameters to train multiple different RMs per DNN module. It automatically selects a set of trained RMs leading to the highest possible overall prediction accuracy.
  arXiv  Detail & Related papers  (2023-12-11T15:15:48Z)
• Federated Learning over a Wireless Network: Distributed User Selection through Random Access [23.544290667425532]
  This study proposes a network intrinsic approach of distributed user selection. We manipulate the contention window (CW) size to prioritize certain users for obtaining radio resources in each round of training. Prioritization is based on the distance between the newly trained local model and the global model of the previous round.
  arXiv  Detail & Related papers  (2023-07-07T02:14:46Z)
• One-Dimensional Deep Image Prior for Curve Fitting of S-Parameters from Electromagnetic Solvers [57.441926088870325]
  Deep Image Prior (DIP) is a technique that optimized the weights of a randomly-d convolutional neural network to fit a signal from noisy or under-determined measurements. Relative to publicly available implementations of Vector Fitting (VF), our method shows superior performance on nearly all test examples.
  arXiv  Detail & Related papers  (2023-06-06T20:28:37Z)
• On Differential Privacy for Federated Learning in Wireless Systems with Multiple Base Stations [90.53293906751747]
  We consider a federated learning model in a wireless system with multiple base stations and inter-cell interference. We show the convergence behavior of the learning process by deriving an upper bound on its optimality gap. Our proposed scheduler improves the average accuracy of the predictions compared with a random scheduler.
  arXiv  Detail & Related papers  (2022-08-25T03:37:11Z)
• Fast Variational AutoEncoder with Inverted Multi-Index for Collaborative Filtering [59.349057602266]
  Variational AutoEncoder (VAE) has been extended as a representative nonlinear method for collaborative filtering. We propose to decompose the inner-product-based softmax probability based on the inverted multi-index. FastVAE can outperform the state-of-the-art baselines in terms of both sampling quality and efficiency.
  arXiv  Detail & Related papers  (2021-09-13T08:31:59Z)
• Evolutionary Ensemble Learning for Multivariate Time Series Prediction [6.736731623634526]
  A typical pipeline of building an MTS prediction model (PM) consists of selecting a subset of channels among all available ones. We propose a novel evolutionary ensemble learning framework to optimize the entire pipeline in a holistic manner. We implement the proposed framework and evaluate our implementation on two real-world applications, i.e., electricity consumption prediction and air quality prediction.
  arXiv  Detail & Related papers  (2021-08-22T07:36:25Z)
• Stepwise Model Selection for Sequence Prediction via Deep Kernel Learning [100.83444258562263]
  We propose a novel Bayesian optimization (BO) algorithm to tackle the challenge of model selection in this setting. In order to solve the resulting multiple black-box function optimization problem jointly and efficiently, we exploit potential correlations among black-box functions. We are the first to formulate the problem of stepwise model selection (SMS) for sequence prediction, and to design and demonstrate an efficient joint-learning algorithm for this purpose.
  arXiv  Detail & Related papers  (2020-01-12T09:42:19Z)

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.