VLSI Hypergraph Partitioning with Deep Learning

• URL: http://arxiv.org/abs/2409.01387v1
• Date: Mon, 2 Sep 2024 17:32:01 GMT
• Title: VLSI Hypergraph Partitioning with Deep Learning
• Authors: Muhammad Hadir Khan, Bugra Onal, Eren Dogan, Matthew R. Guthaus,
• Abstract summary: Graph Neural Networks (GNNs) have demonstrated strong performance in various node, edge, and graph prediction tasks. We introduce a new set of synthetic partitioning benchmarks that emulate real-world netlist characteristics. We evaluate existing state-of-the-art partitioning algorithms alongside GNN-based approaches, highlighting their respective advantages and disadvantages.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Partitioning is a known problem in computer science and is critical in chip design workflows, as advancements in this area can significantly influence design quality and efficiency. Deep Learning (DL) techniques, particularly those involving Graph Neural Networks (GNNs), have demonstrated strong performance in various node, edge, and graph prediction tasks using both inductive and transductive learning methods. A notable area of recent interest within GNNs are pooling layers and their application to graph partitioning. While these methods have yielded promising results across social, computational, and other random graphs, their effectiveness has not yet been explored in the context of VLSI hypergraph netlists. In this study, we introduce a new set of synthetic partitioning benchmarks that emulate real-world netlist characteristics and possess a known upper bound for solution cut quality. We distinguish these benchmarks with the prior work and evaluate existing state-of-the-art partitioning algorithms alongside GNN-based approaches, highlighting their respective advantages and disadvantages.

Related papers

• Enhancing Graph Neural Networks with Limited Labeled Data by Actively Distilling Knowledge from Large Language Models [30.867447814409623]
  Graph neural networks (GNNs) have great ability in node classification, a fundamental task on graphs. We propose a novel approach that integrates Large Language Models (LLMs) and GNNs. Our model in improving node classification accuracy with considerably limited labeled data, surpassing state-of-the-art baselines by significant margins.
  arXiv  Detail & Related papers  (2024-07-19T02:34:10Z)
• Graph Reasoning Networks [9.18586425686959]
  Graph Reasoning Networks (GRNs) is a novel approach to combine the strengths of fixed and learned graph representations and a reasoning module based on a differentiable satisfiability solver. Results on real-world datasets show comparable performance to GNNs. Experiments on synthetic datasets demonstrate the potential of the newly proposed method.
  arXiv  Detail & Related papers  (2024-07-08T10:53:49Z)
• Similarity-based Neighbor Selection for Graph LLMs [43.176381523196426]
  We introduce Similarity-based Neighbor Selection (SNS) SNS improves the quality of selected neighbors, thereby improving graph representation and alleviating issues like over-squashing and heterophily. As an inductive and training-free approach, SNS demonstrates superior generalization and scalability over traditional GNN methods.
  arXiv  Detail & Related papers  (2024-02-06T05:29:05Z)
• Mitigating Semantic Confusion from Hostile Neighborhood for Graph Active Learning [38.5372139056485]
  Graph Active Learning (GAL) aims to find the most informative nodes in graphs for annotation to maximize the Graph Neural Networks (GNNs) performance. Gal strategies may introduce semantic confusion to the selected training set, particularly when graphs are noisy. We present Semantic-aware Active learning framework for Graphs (SAG) to mitigate the semantic confusion problem.
  arXiv  Detail & Related papers  (2023-08-17T07:06:54Z)
• SimTeG: A Frustratingly Simple Approach Improves Textual Graph Learning [131.04781590452308]
  We present SimTeG, a frustratingly Simple approach for Textual Graph learning. We first perform supervised parameter-efficient fine-tuning (PEFT) on a pre-trained LM on the downstream task. We then generate node embeddings using the last hidden states of finetuned LM.
  arXiv  Detail & Related papers  (2023-08-03T07:00:04Z)
• DEGREE: Decomposition Based Explanation For Graph Neural Networks [55.38873296761104]
  We propose DEGREE to provide a faithful explanation for GNN predictions. By decomposing the information generation and aggregation mechanism of GNNs, DEGREE allows tracking the contributions of specific components of the input graph to the final prediction. We also design a subgraph level interpretation algorithm to reveal complex interactions between graph nodes that are overlooked by previous methods.
  arXiv  Detail & Related papers  (2023-05-22T10:29:52Z)
• A Comprehensive Study on Large-Scale Graph Training: Benchmarking and Rethinking [124.21408098724551]
  Large-scale graph training is a notoriously challenging problem for graph neural networks (GNNs) We present a new ensembling training manner, named EnGCN, to address the existing issues. Our proposed method has achieved new state-of-the-art (SOTA) performance on large-scale datasets.
  arXiv  Detail & Related papers  (2022-10-14T03:43:05Z)
• Benchmarking Node Outlier Detection on Graphs [90.29966986023403]
  Graph outlier detection is an emerging but crucial machine learning task with numerous applications. We present the first comprehensive unsupervised node outlier detection benchmark for graphs called UNOD.
  arXiv  Detail & Related papers  (2022-06-21T01:46:38Z)
• Inducing Gaussian Process Networks [80.40892394020797]
  We propose inducing Gaussian process networks (IGN), a simple framework for simultaneously learning the feature space as well as the inducing points. The inducing points, in particular, are learned directly in the feature space, enabling a seamless representation of complex structured domains. We report on experimental results for real-world data sets showing that IGNs provide significant advances over state-of-the-art methods.
  arXiv  Detail & Related papers  (2022-04-21T05:27:09Z)
• Analyzing the Performance of Graph Neural Networks with Pipe Parallelism [2.269587850533721]
  We focus on Graph Neural Networks (GNNs) that have found great success in tasks such as node or edge classification and link prediction. New approaches for processing larger networks are needed to advance graph techniques. We study how GNNs could be parallelized using existing tools and frameworks that are known to be successful in the deep learning community.
  arXiv  Detail & Related papers  (2020-12-20T04:20:38Z)
• Binarized Graph Neural Network [65.20589262811677]
  We develop a binarized graph neural network to learn the binary representations of the nodes with binary network parameters. Our proposed method can be seamlessly integrated into the existing GNN-based embedding approaches. Experiments indicate that the proposed binarized graph neural network, namely BGN, is orders of magnitude more efficient in terms of both time and space.
  arXiv  Detail & Related papers  (2020-04-19T09:43:14Z)

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.