Transferable and Distributed User Association Policies for 5G and Beyond Networks

• URL: http://arxiv.org/abs/2106.02540v1
• Date: Fri, 4 Jun 2021 15:08:39 GMT
• Title: Transferable and Distributed User Association Policies for 5G and Beyond Networks
• Authors: Mohamed Sana, Nicola di Pietro, Emilio Calvanese Strinati
• Abstract summary: We study the problem of user association, namely finding the optimal assignment of user equipment to base stations. We propose a novel distributed policy network architecture, which is transferable among users with zero-shot generalization capability.
• Score: 9.727134312677842
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We study the problem of user association, namely finding the optimal assignment of user equipment to base stations to achieve a targeted network performance. In this paper, we focus on the knowledge transferability of association policies. Indeed, traditional non-trivial user association schemes are often scenario-specific or deployment-specific and require a policy re-design or re-learning when the number or the position of the users change. In contrast, transferability allows to apply a single user association policy, devised for a specific scenario, to other distinct user deployments, without needing a substantial re-learning or re-design phase and considerably reducing its computational and management complexity. To achieve transferability, we first cast user association as a multi-agent reinforcement learning problem. Then, based on a neural attention mechanism that we specifically conceived for this context, we propose a novel distributed policy network architecture, which is transferable among users with zero-shot generalization capability i.e., without requiring additional training.Numerical results show the effectiveness of our solution in terms of overall network communication rate, outperforming centralized benchmarks even when the number of users doubles with respect to the initial training point.

Related papers

• Hypergame Theory for Decentralized Resource Allocation in Multi-user Semantic Communications [60.63472821600567]
  A novel framework for decentralized computing and communication resource allocation in multiuser SC systems is proposed. The challenge of efficiently allocating communication and computing resources is addressed through the application of Stackelberg hyper game theory. Simulation results show that the proposed Stackelberg hyper game results in efficient usage of communication and computing resources.
  arXiv  Detail & Related papers  (2024-09-26T15:55:59Z)
• Decentralized Learning Strategies for Estimation Error Minimization with Graph Neural Networks [94.2860766709971]
  We address the challenge of sampling and remote estimation for autoregressive Markovian processes in a wireless network with statistically-identical agents. Our goal is to minimize time-average estimation error and/or age of information with decentralized scalable sampling and transmission policies.
  arXiv  Detail & Related papers  (2024-04-04T06:24:11Z)
• A Deep Learning Based Resource Allocator for Communication Systems with Dynamic User Utility Demands [14.694515879973169]
  We introduce a DL-based resource allocator (ALCOR) that allows users to adjust their utility demands freely. ALCOR employs deep neural networks (DNNs) as the policy in a time-sharing problem.
  arXiv  Detail & Related papers  (2023-11-08T11:02:51Z)
• Mobility-Aware Joint User Scheduling and Resource Allocation for Low Latency Federated Learning [14.343345846105255]
  We propose a practical model for user mobility in Federated learning systems. We develop a user scheduling and resource allocation method to minimize the training delay with constrained communication resources. Specifically, we first formulate an optimization problem with user mobility that jointly considers user selection, BS assignment to users, and bandwidth allocation.
  arXiv  Detail & Related papers  (2023-07-18T13:48:05Z)
• Big-data-driven and AI-based framework to enable personalization in wireless networks [20.26379197206863]
  We propose a big-data-driven and AI-based personalization framework to integrate personalization into wireless networks. Based on each user's actual requirements and context, a multi-objective formulation enables the network to micromanage and optimize the provided user satisfaction levels simultaneously.
  arXiv  Detail & Related papers  (2023-06-08T02:30:55Z)
• Rethinking Value Function Learning for Generalization in Reinforcement Learning [11.516147824168732]
  We focus on the problem of training RL agents on multiple training environments to improve observational generalization performance. We identify that the value network in the multiple-environment setting is more challenging to optimize and prone to overfitting training data than in the conventional single-environment setting. We propose Delayed-Critic Policy Gradient (DCPG), which implicitly penalizes the value estimates by optimizing the value network less frequently with more training data than the policy network.
  arXiv  Detail & Related papers  (2022-10-18T16:17:47Z)
• Learning Resilient Radio Resource Management Policies with Graph Neural Networks [124.89036526192268]
  We formulate a resilient radio resource management problem with per-user minimum-capacity constraints. We show that we can parameterize the user selection and power control policies using a finite set of parameters. Thanks to such adaptation, our proposed method achieves a superior tradeoff between the average rate and the 5th percentile rate.
  arXiv  Detail & Related papers  (2022-03-07T19:40:39Z)
• User-Centric Federated Learning [20.830970477768485]
  We propose a broadcast protocol that limits the number of personalized streams while retaining the essential advantages of our learning scheme. Our approach is shown to enjoy higher personalization capabilities, faster convergence, and better communication efficiency compared to other competing baseline solutions.
  arXiv  Detail & Related papers  (2021-10-19T11:49:06Z)
• Competing Adaptive Networks [56.56653763124104]
  We develop an algorithm for decentralized competition among teams of adaptive agents. We present an application in the decentralized training of generative adversarial neural networks.
  arXiv  Detail & Related papers  (2021-03-29T14:42:15Z)
• All at Once Network Quantization via Collaborative Knowledge Transfer [56.95849086170461]
  We develop a novel collaborative knowledge transfer approach for efficiently training the all-at-once quantization network. Specifically, we propose an adaptive selection strategy to choose a high-precision enquoteteacher for transferring knowledge to the low-precision student. To effectively transfer knowledge, we develop a dynamic block swapping method by randomly replacing the blocks in the lower-precision student network with the corresponding blocks in the higher-precision teacher network.
  arXiv  Detail & Related papers  (2021-03-02T03:09:03Z)
• Unsupervised Model Personalization while Preserving Privacy and Scalability: An Open Problem [55.21502268698577]
  This work investigates the task of unsupervised model personalization, adapted to continually evolving, unlabeled local user images. We provide a novel Dual User-Adaptation framework (DUA) to explore the problem. This framework flexibly disentangles user-adaptation into model personalization on the server and local data regularization on the user device.
  arXiv  Detail & Related papers  (2020-03-30T09:35:12Z)

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.