DeepSeq2: Enhanced Sequential Circuit Learning with Disentangled Representations

• URL: http://arxiv.org/abs/2411.00530v1
• Date: Fri, 01 Nov 2024 11:57:42 GMT
• Title: DeepSeq2: Enhanced Sequential Circuit Learning with Disentangled Representations
• Authors: Sadaf Khan, Zhengyuan Shi, Ziyang Zheng, Min Li, Qiang Xu,
• Abstract summary: We introduce DeepSeq2, a novel framework that enhances the learning of sequential circuits. By employing an efficient Directed Acyclic Graph Neural Network (DAG-GNN), DeepSeq2 significantly reduces execution times and improves model scalability. DeepSeq2 sets a new benchmark in sequential circuit representation learning, outperforming prior works in power estimation and reliability analysis.
• Score: 9.79382991471473
• License:
• Abstract: Circuit representation learning is increasingly pivotal in Electronic Design Automation (EDA), serving various downstream tasks with enhanced model efficiency and accuracy. One notable work, DeepSeq, has pioneered sequential circuit learning by encoding temporal correlations. However, it suffers from significant limitations including prolonged execution times and architectural inefficiencies. To address these issues, we introduce DeepSeq2, a novel framework that enhances the learning of sequential circuits, by innovatively mapping it into three distinct embedding spaces-structure, function, and sequential behavior-allowing for a more nuanced representation that captures the inherent complexities of circuit dynamics. By employing an efficient Directed Acyclic Graph Neural Network (DAG-GNN) that circumvents the recursive propagation used in DeepSeq, DeepSeq2 significantly reduces execution times and improves model scalability. Moreover, DeepSeq2 incorporates a unique supervision mechanism that captures transitioning behaviors within circuits more effectively. DeepSeq2 sets a new benchmark in sequential circuit representation learning, outperforming prior works in power estimation and reliability analysis.

Related papers

• Fast Second-Order Online Kernel Learning through Incremental Matrix Sketching and Decomposition [22.39048660630147]
  Online Learning (OKL) has attracted considerable research interest due to its promising predictive performance in streaming environments. Existing second-order OKL approaches suffer from at least quadratic time complexity with respect to the pre-set budget. We propose FORKS, a fast incremental matrix sketching and decomposition approach tailored for second-order OKL.
  arXiv  Detail & Related papers  (2024-10-15T02:07:48Z)
• TCCT-Net: Two-Stream Network Architecture for Fast and Efficient Engagement Estimation via Behavioral Feature Signals [58.865901821451295]
  We present a novel two-stream feature fusion "Tensor-Convolution and Convolution-Transformer Network" (TCCT-Net) architecture. To better learn the meaningful patterns in the temporal-spatial domain, we design a "CT" stream that integrates a hybrid convolutional-transformer. In parallel, to efficiently extract rich patterns from the temporal-frequency domain, we introduce a "TC" stream that uses Continuous Wavelet Transform (CWT) to represent information in a 2D tensor form.
  arXiv  Detail & Related papers  (2024-04-15T06:01:48Z)
• DeepGate2: Functionality-Aware Circuit Representation Learning [10.75166513491573]
  Circuit representation learning aims to obtain neural representations of circuit elements. Existing solutions, such as DeepGate, have the potential to embed both circuit structural information and functional behavior. We introduce DeepGate2, a novel functionality-aware learning framework.
  arXiv  Detail & Related papers  (2023-05-25T13:51:12Z)
• DeepSeq: Deep Sequential Circuit Learning [10.402436619244911]
  Circuit representation learning is a promising research direction in the electronic design automation (EDA) field. Existing solutions only target combinational circuits, significantly limiting their applications. We propose DeepSeq, a novel representation learning framework for sequential netlists.
  arXiv  Detail & Related papers  (2023-02-27T09:17:35Z)
• RDRN: Recursively Defined Residual Network for Image Super-Resolution [58.64907136562178]
  Deep convolutional neural networks (CNNs) have obtained remarkable performance in single image super-resolution. We propose a novel network architecture which utilizes attention blocks efficiently.
  arXiv  Detail & Related papers  (2022-11-17T11:06:29Z)
• The impact of memory on learning sequence-to-sequence tasks [6.603326895384289]
  Recent success of neural networks in natural language processing has drawn renewed attention to learning sequence-to-sequence (seq2seq) tasks. We propose a model for a seq2seq task that has the advantage of providing explicit control over the degree of memory, or non-Markovianity, in the sequences.
  arXiv  Detail & Related papers  (2022-05-29T14:57:33Z)
• Deep Explicit Duration Switching Models for Time Series [84.33678003781908]
  We propose a flexible model that is capable of identifying both state- and time-dependent switching dynamics. State-dependent switching is enabled by a recurrent state-to-switch connection. An explicit duration count variable is used to improve the time-dependent switching behavior.
  arXiv  Detail & Related papers  (2021-10-26T17:35:21Z)
• Faster Convergence in Deep-Predictive-Coding Networks to Learn Deeper Representations [12.716429755564821]
  Deep-predictive-coding networks (DPCNs) are hierarchical, generative models that rely on feed-forward and feed-back connections. A crucial element of DPCNs is a forward-backward inference procedure to uncover sparse states of a dynamic model. We propose an optimization strategy, with better empirical and theoretical convergence, based on accelerated proximal gradients.
  arXiv  Detail & Related papers  (2021-01-18T02:30:13Z)
• Phase Retrieval using Expectation Consistent Signal Recovery Algorithm based on Hypernetwork [73.94896986868146]
  Phase retrieval is an important component in modern computational imaging systems. Recent advances in deep learning have opened up a new possibility for robust and fast PR. We develop a novel framework for deep unfolding to overcome the existing limitations.
  arXiv  Detail & Related papers  (2021-01-12T08:36:23Z)
• DAIS: Automatic Channel Pruning via Differentiable Annealing Indicator Search [55.164053971213576]
  convolutional neural network has achieved great success in fulfilling computer vision tasks despite large computation overhead. Structured (channel) pruning is usually applied to reduce the model redundancy while preserving the network structure. Existing structured pruning methods require hand-crafted rules which may lead to tremendous pruning space.
  arXiv  Detail & Related papers  (2020-11-04T07:43:01Z)
• Learning to Hash with Graph Neural Networks for Recommender Systems [103.82479899868191]
  Graph representation learning has attracted much attention in supporting high quality candidate search at scale. Despite its effectiveness in learning embedding vectors for objects in the user-item interaction network, the computational costs to infer users' preferences in continuous embedding space are tremendous. We propose a simple yet effective discrete representation learning framework to jointly learn continuous and discrete codes.
  arXiv  Detail & Related papers  (2020-03-04T06:59:56Z)

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.