Network Topology Optimization via Deep Reinforcement Learning

• URL: http://arxiv.org/abs/2204.14133v1
• Date: Tue, 19 Apr 2022 07:45:07 GMT
• Title: Network Topology Optimization via Deep Reinforcement Learning
• Authors: Zhuoran Li, Xing Wang, Ling Pan, Lin Zhu, Zhendong Wang, Junlan Feng, Chao Deng, Longbo Huang
• Abstract summary: We propose a novel deep reinforcement learning algorithm, called Advantage Actor Critic-Graph Searching (A2C-GS) for network topology optimization. A2C-GS consists of three novel components, including a verifier to validate the correctness of a generated network topology, a graph neural network (GNN) to efficiently approximate topology rating, and a DRL actor layer to conduct a topology search. We conduct a case study based on a real network scenario, and our experimental results demonstrate the superior performance of A2C-GS in terms of both efficiency and performance.
• Score: 37.31672024989399
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Topology impacts important network performance metrics, including link utilization, throughput and latency, and is of central importance to network operators. However, due to the combinatorial nature of network topology, it is extremely difficult to obtain an optimal solution, especially since topology planning in networks also often comes with management-specific constraints. As a result, local optimization with hand-tuned heuristic methods from human experts are often adopted in practice. Yet, heuristic methods cannot cover the global topology design space while taking into account constraints, and cannot guarantee to find good solutions. In this paper, we propose a novel deep reinforcement learning (DRL) algorithm, called Advantage Actor Critic-Graph Searching (A2C-GS), for network topology optimization. A2C-GS consists of three novel components, including a verifier to validate the correctness of a generated network topology, a graph neural network (GNN) to efficiently approximate topology rating, and a DRL actor layer to conduct a topology search. A2C-GS can efficiently search over large topology space and output topology with satisfying performance. We conduct a case study based on a real network scenario, and our experimental results demonstrate the superior performance of A2C-GS in terms of both efficiency and performance.

Related papers

• OTOv3: Automatic Architecture-Agnostic Neural Network Training and Compression from Structured Pruning to Erasing Operators [57.145175475579315]
  This topic spans various techniques, from structured pruning to neural architecture search, encompassing both pruning and erasing operators perspectives. We introduce the third-generation Only-Train-Once (OTOv3), which first automatically trains and compresses a general DNN through pruning and erasing operations. Our empirical results demonstrate the efficacy of OTOv3 across various benchmarks in structured pruning and neural architecture search.
  arXiv  Detail & Related papers  (2023-12-15T00:22:55Z)
• Unsupervised Graph Attention Autoencoder for Attributed Networks using K-means Loss [0.0]
  We introduce a simple, efficient, and clustering-oriented model based on unsupervised textbfGraph Attention textbfAutotextbfEncoder for community detection in attributed networks. The proposed model adeptly learns representations from both the network's topology and attribute information, simultaneously addressing dual objectives: reconstruction and community discovery.
  arXiv  Detail & Related papers  (2023-11-21T20:45:55Z)
• Designing the Topology of Graph Neural Networks: A Novel Feature Fusion Perspective [12.363386808994079]
  We learn to design the topology of GNNs in a novel feature fusion perspective which is dubbed F$2$GNN. We develop a neural architecture search method on top of the unified framework which contains a set of selection and fusion operations. The performance gains on eight real-world datasets demonstrate the effectiveness of F$2$GNN.
  arXiv  Detail & Related papers  (2021-12-29T13:06:12Z)
• TA-Net: Topology-Aware Network for Gland Segmentation [71.52681611057271]
  We propose a novel topology-aware network (TA-Net) to accurately separate densely clustered and severely deformed glands. TA-Net has a multitask learning architecture and enhances the generalization of gland segmentation. It achieves state-of-the-art performance on the two datasets.
  arXiv  Detail & Related papers  (2021-10-27T17:10:58Z)
• CONetV2: Efficient Auto-Channel Size Optimization for CNNs [35.951376988552695]
  This work introduces a method that is efficient in computationally constrained environments by examining the micro-search space of channel size. In tackling channel-size optimization, we design an automated algorithm to extract the dependencies within different connected layers of the network. We also introduce a novel metric that highly correlates with test accuracy and enables analysis of individual network layers.
  arXiv  Detail & Related papers  (2021-10-13T16:17:19Z)
• Unsupervised Domain-adaptive Hash for Networks [81.49184987430333]
  Domain-adaptive hash learning has enjoyed considerable success in the computer vision community. We develop an unsupervised domain-adaptive hash learning method for networks, dubbed UDAH.
  arXiv  Detail & Related papers  (2021-08-20T12:09:38Z)
• Probeable DARTS with Application to Computational Pathology [44.20005949950844]
  We use differentiable architecture search (DARTS) for its efficiency. We then apply our searching framework on CPath applications by searching for the optimum network architecture. Results show that the searched network outperforms state-of-the-art networks in terms of prediction accuracy and complexity.
  arXiv  Detail & Related papers  (2021-08-16T02:16:06Z)
• Learning Connectivity of Neural Networks from a Topological Perspective [80.35103711638548]
  We propose a topological perspective to represent a network into a complete graph for analysis. By assigning learnable parameters to the edges which reflect the magnitude of connections, the learning process can be performed in a differentiable manner. This learning process is compatible with existing networks and owns adaptability to larger search spaces and different tasks.
  arXiv  Detail & Related papers  (2020-08-19T04:53:31Z)
• Discretization-Aware Architecture Search [81.35557425784026]
  This paper presents discretization-aware architecture search (DAtextsuperscript2S) The core idea is to push the super-network towards the configuration of desired topology, so that the accuracy loss brought by discretization is largely alleviated. Experiments on standard image classification benchmarks demonstrate the superiority of our approach.
  arXiv  Detail & Related papers  (2020-07-07T01:18:58Z)
• TopologyGAN: Topology Optimization Using Generative Adversarial Networks Based on Physical Fields Over the Initial Domain [2.0263791972068628]
  We propose a new data-driven topology optimization model called TopologyGAN. TopologyGAN takes advantage of various physical fields computed on the original, unoptimized material domain, as inputs to the generator of a conditional generative adversarial network (cGAN) Compared to a baseline cGAN, TopologyGAN achieves a nearly $3times$ reduction in the mean squared error and a $2.5times$ reduction in the mean absolute error on test problems involving previously unseen boundary conditions.
  arXiv  Detail & Related papers  (2020-03-05T14:40:11Z)

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.