Hybrid Beamforming for RIS-Aided Communications: Fitness Landscape Analysis and Niching Genetic Algorithm

• URL: http://arxiv.org/abs/2109.09054v1
• Date: Sun, 19 Sep 2021 03:39:37 GMT
• Title: Hybrid Beamforming for RIS-Aided Communications: Fitness Landscape Analysis and Niching Genetic Algorithm
• Abstract summary: Reconfigurable Intelligent Surface (RIS) is a revolutionizing approach to provide cost-effective yet energy-efficient communications. We propose a novel niching genetic algorithm to solve the sum rate problem.
• Score: 31.507466525490123
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Reconfigurable Intelligent Surface (RIS) is a revolutionizing approach to provide cost-effective yet energy-efficient communications. The transmit beamforming of the base station (BS) and discrete phase shifts of the RIS are jointly optimized to provide high quality of service. However, existing works ignore the high dependence between the large number of phase shifts and estimate them separately, consequently, easily getting trapped into local optima. To investigate the number and distribution of local optima, we conduct a fitness landscape analysis on the sum rate maximization problems. Two landscape features, the fitness distribution correlation and autocorrelation, are employed to investigate the ruggedness of landscape. The investigation results indicate that the landscape exhibits a rugged, multi-modal structure, i.e., has many local peaks, particularly in the cases with large-scale RISs. To handle the multi-modal landscape structure, we propose a novel niching genetic algorithm to solve the sum rate maximization problem. Particularly, a niching technique, nearest-better clustering, is incorporated to partition the population into several neighborhood species, thereby locating multiple local optima and enhance the global search ability. We also present a minimum species size to further improve the convergence speed. Simulation results demonstrate that our method achieves significant capacity gains compared to existing algorithms, particularly in the cases with large-scale RISs.

Related papers

• Hybrid Augmented Lagrangian Method for General Constrained Optimization via Evolutionary Algorithms [0.0]
  We propose a Hybrid Augmented Lagrangian (HyAL) method that integrates the AL framework's constraint-handling strengths with the exploratory power of population-based search.<n>Our approach employs evolutionary techniques to solve subproblems within the AL iterations, promoting exploration and aiding in the escape from local optima.<n>Our results show that HyAL consistently produces high-quality solutions across the benchmark suite.
  arXiv  Detail & Related papers  (2026-07-18T16:29:06Z)
• Min-Max Regret Task Allocation and Planning of Heterogeneous Multi-Robot System in Partially Known Environments [5.229463033279081]
  This paper presents a robust planning framework that simultaneously handles high-level logical constraints and environmental uncertainty without sacrificing scalability.<n>We show that the proposed framework achieves near-linear scalability with respect to the number of robots and types, significantly outperforming MILP-based baselines in both solution quality and computational efficiency.
  arXiv  Detail & Related papers  (2026-07-15T02:59:38Z)
• Novelty-Based Generation of Continuous Landscapes with Diverse Local Optima Networks [0.0]
  Local Optima Networks (LONs) represent the global structure of search spaces as graphs.<n>In continuous optimization, this high computational cost prevents systematic investigation of the relationship between LON features and evolutionary algorithm performance.<n>We propose an alternative definition of BoAs for Max-Set of Gaussians (MSG) landscapes with explicitly tunable multimodality.
  arXiv  Detail & Related papers  (2026-04-23T09:28:19Z)
• RIS-Assisted Downlink Pinching-Antenna Systems: GNN-Enabled Optimization Approaches [51.56300276709421]
  This paper investigates a reconfigurable intelligent surface (RIS)-assisted multi-waveguide pinching-antenna (PA) system (PASS) for multi-user downlink information transmission.<n>By leveraging a graph-structured topology of the RIS-assisted PASS, a novel three-stage graph neural network (GNN) is proposed, which learns PA positions based on user locations.
  arXiv  Detail & Related papers  (2025-11-25T13:43:44Z)
• Quantum-Guided Cluster Algorithms for Combinatorial Optimization [0.0]
  We introduce a novel algorithm for finding the ground state of Ising spin glasses.<n>Various classical and quantum algorithms can be employed to generate correlations that embody information about the energy landscape of the problem.
  arXiv  Detail & Related papers  (2025-08-14T13:54:56Z)
• Preference Optimization for Combinatorial Optimization Problems [54.87466279363487]
  Reinforcement Learning (RL) has emerged as a powerful tool for neural optimization, enabling models learns that solve complex problems without requiring expert knowledge.<n>Despite significant progress, existing RL approaches face challenges such as diminishing reward signals and inefficient exploration in vast action spaces.<n>We propose Preference Optimization, a novel method that transforms quantitative reward signals into qualitative preference signals via statistical comparison modeling.
  arXiv  Detail & Related papers  (2025-05-13T16:47:00Z)
• Stability and Generalization for Distributed SGDA [70.97400503482353]
  We propose the stability-based generalization analytical framework for Distributed-SGDA. We conduct a comprehensive analysis of stability error, generalization gap, and population risk across different metrics. Our theoretical results reveal the trade-off between the generalization gap and optimization error.
  arXiv  Detail & Related papers  (2024-11-14T11:16:32Z)
• SPGD: Steepest Perturbed Gradient Descent Optimization [0.0]
  This paper presents the Steepest Perturbed Gradient Descent (SPGD) algorithm. It is designed to generate a set of candidate solutions and select the one exhibiting the steepest loss difference. Preliminary results show a substantial improvement over four established methods.
  arXiv  Detail & Related papers  (2024-11-07T18:23:30Z)
• Federated Multi-Level Optimization over Decentralized Networks [55.776919718214224]
  We study the problem of distributed multi-level optimization over a network, where agents can only communicate with their immediate neighbors. We propose a novel gossip-based distributed multi-level optimization algorithm that enables networked agents to solve optimization problems at different levels in a single timescale. Our algorithm achieves optimal sample complexity, scaling linearly with the network size, and demonstrates state-of-the-art performance on various applications.
  arXiv  Detail & Related papers  (2023-10-10T00:21:10Z)
• Federated Minimax Optimization with Client Heterogeneity [11.558008138030845]
  Minimax computation has seen a surge in interest with the advent modern applications such as GANs. We propose a general federated minimax framework that subsumes settings and existing methods like Local SGDA.
  arXiv  Detail & Related papers  (2023-02-08T18:33:55Z)
• Multi-Resource Allocation for On-Device Distributed Federated Learning Systems [79.02994855744848]
  This work poses a distributed multi-resource allocation scheme for minimizing the weighted sum of latency and energy consumption in the on-device distributed federated learning (FL) system. Each mobile device in the system engages the model training process within the specified area and allocates its computation and communication resources for deriving and uploading parameters, respectively.
  arXiv  Detail & Related papers  (2022-11-01T14:16:05Z)
• VNE Strategy based on Chaotic Hybrid Flower Pollination Algorithm Considering Multi-criteria Decision Making [12.361459296815559]
  Design strategy of hybrid flower pollination algorithm for Virtual Network Embedding (VNE) problem is discussed. Cross operation is used to replace the cross-pollination operation to complete the global search. Life cycle mechanism is introduced as a complement to the traditional fitness-based selection strategy.
  arXiv  Detail & Related papers  (2022-02-07T00:57:00Z)
• Federated Distributionally Robust Optimization for Phase Configuration of RISs [106.4688072667105]
  We study the problem of robust reconfigurable intelligent surface (RIS)-aided downlink communication over heterogeneous RIS types in a supervised learning setting. By modeling downlink communication over heterogeneous RIS designs as different workers that learn how to optimize phase configurations in a distributed manner, we solve this distributed learning problem. Our proposed algorithm requires fewer communication rounds to achieve the same worst-case distribution test accuracy compared to competitive baselines.
  arXiv  Detail & Related papers  (2021-08-20T07:07:45Z)
• Reinforcement Learning for Adaptive Mesh Refinement [63.7867809197671]
  We propose a novel formulation of AMR as a Markov decision process and apply deep reinforcement learning to train refinement policies directly from simulation. The model sizes of these policy architectures are independent of the mesh size and hence scale to arbitrarily large and complex simulations.
  arXiv  Detail & Related papers  (2021-03-01T22:55:48Z)
• A Unified Theory of Decentralized SGD with Changing Topology and Local Updates [70.9701218475002]
  We introduce a unified convergence analysis of decentralized communication methods. We derive universal convergence rates for several applications. Our proofs rely on weak assumptions.
  arXiv  Detail & Related papers  (2020-03-23T17:49:15Z)
• Optimizing Cooperative path-finding: A Scalable Multi-Agent RRT* with Dynamic Potential Fields [11.872579571976903]
  This study introduces the multi-agent RRT* potential field (MA-RRT*PF), an innovative algorithm that addresses computational efficiency and path-finding efficacy in dense scenarios. The empirical evaluations highlight MA-RRT*PF's significant superiority over conventional multi-agent RRT* (MA-RRT*) in dense environments.
  arXiv  Detail & Related papers  (2019-11-16T13:02:59Z)

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.