Machine Learning-Based Graph Simplification for Symbolic Accelerators

• URL: http://arxiv.org/abs/2605.08996v1
• Date: Sat, 09 May 2026 15:26:06 GMT
• Title: Machine Learning-Based Graph Simplification for Symbolic Accelerators
• Abstract summary: AutoSlim is a machine learning-based framework that prunes automata graphs for hardware accelerators.<n>It reduces FPGA resource usage by up to 40%, with corresponding improvements in throughput and power efficiency.
• Score: 0.6299766708197883
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Graph-based accelerators have been widely adopted in symbolic data processing applications such as genomics, cybersecurity, and artificial intelligence. However, these systems often suffer from excessive memory usage and inefficiencies stemming from redundant graph structures. We present AutoSlim, a machine learning-based framework that leverages data-driven methods to prune automata graphs for hardware accelerators. Using features extracted from prior graph executions and a Random Forest classifier, AutoSlim identifies and removes low-impact nodes and edges. When applied to a Non-deterministic Finite Automata overlay architecture (NAPOLY+), AutoSlim reduces FPGA resource usage by up to 40%, with corresponding improvements in throughput and power efficiency. The framework includes a verification step to ensure functional equivalence after pruning and suggests promising directions for both hardware optimization and security.

Related papers

• AutoGraph-R1: End-to-End Reinforcement Learning for Knowledge Graph Construction [60.51319139563509]
  We introduce AutoGraph-R1, the first framework to directly optimize KG construction for task performance using Reinforcement Learning (RL)<n>We design two novel, task-aware reward functions, one for graphs as knowledge carriers and another as knowledge indices.<n>Our work shows it is possible to close the loop between construction and application, shifting the paradigm from building intrinsically good'' graphs to building demonstrably useful'' ones.
  arXiv  Detail & Related papers  (2025-10-17T06:03:36Z)
• ML-Based Automata Simplification for Symbolic Accelerators [0.0]
  Symbolic accelerators are increasingly used for data processing in domains such as genomics, NLP, and cybersecurity.<n>We present AutoSlim, a machine learning-based graph simplification framework deployed on FPGA-based overlays such as NAPOLY+.<n>AutoSlim achieves up to 40 percent reduction in FPGA LUTs and over 30 percent pruning in transitions, while scaling to graphs an order of magnitude larger than existing benchmarks.
  arXiv  Detail & Related papers  (2025-07-11T17:02:33Z)
• Automated Generation of Precedence Graphs in Digital Value Chains for Automotive Production [1.6574413179773764]
  This study examines the digital value chain in automotive manufacturing.<n>It focuses on the identification, software flashing, customization, and commissioning of electronic control units in vehicle networks.<n>A novel precedence graph design is proposed to optimize this process chain using an automated scheduling algorithm.
  arXiv  Detail & Related papers  (2025-04-28T14:37:06Z)
• RGL: A Graph-Centric, Modular Framework for Efficient Retrieval-Augmented Generation on Graphs [58.10503898336799]
  We introduce the RAG-on-Graphs Library (RGL), a modular framework that seamlessly integrates the complete RAG pipeline.<n>RGL addresses key challenges by supporting a variety of graph formats and integrating optimized implementations for essential components.<n>Our evaluations demonstrate that RGL not only accelerates the prototyping process but also enhances the performance and applicability of graph-based RAG systems.
  arXiv  Detail & Related papers  (2025-03-25T03:21:48Z)
• AutoSculpt: A Pattern-based Model Auto-pruning Framework Using Reinforcement Learning and Graph Learning [32.10443611442628]
  AutoSculpt is a pattern-based automated pruning framework for deep neural networks (DNNs)<n>It automatically identifies and prunes regular patterns within DNN architectures that can be recognized by existing inference engines.<n>It achieves pruning rates of up to 90% and nearly 18% improvement in FLOPs reduction, outperforming all baselines.
  arXiv  Detail & Related papers  (2024-12-24T02:05:51Z)
• FedGraph: A Research Library and Benchmark for Federated Graph Learning [57.769105634569314]
  Federated graph learning is an emerging field with significant practical challenges.<n>We introduce FedGraph, a research library designed for practical distributed training.<n>FedGraph supports a range of state-of-the-art graph learning methods and includes a monitoring class that evaluates system performance.
  arXiv  Detail & Related papers  (2024-10-08T20:18:18Z)
• Distributed Graph Embedding with Information-Oriented Random Walks [16.290803469068145]
  Graph embedding maps graph nodes to low-dimensional vectors, and is widely adopted in machine learning tasks. We present a general-purpose, distributed, information-centric random walk-based graph embedding framework, DistGER, which can scale to embed billion-edge graphs. D DistGER exhibits 2.33x-129x acceleration, 45% reduction in cross-machines communication, and > 10% effectiveness improvement in downstream tasks.
  arXiv  Detail & Related papers  (2023-03-28T03:11:21Z)
• Performance Embeddings: A Similarity-based Approach to Automatic Performance Optimization [71.69092462147292]
  Performance embeddings enable knowledge transfer of performance tuning between applications. We demonstrate this transfer tuning approach on case studies in deep neural networks, dense and sparse linear algebra compositions, and numerical weather prediction stencils.
  arXiv  Detail & Related papers  (2023-03-14T15:51:35Z)
• An Enhanced Graph Representation for Machine Learning Based Automatic Intersection Management [0.5161531917413708]
  We build upon a previously presented graph-based scene representation and graph neural network to approach the problem using reinforcement learning. The paper provides an in-depth evaluation of the proposed method against baselines that are commonly used in automatic intersection management.
  arXiv  Detail & Related papers  (2022-07-18T14:53:50Z)
• Automated Graph Machine Learning: Approaches, Libraries, Benchmarks and Directions [58.220137936626315]
  This paper extensively discusses automated graph machine learning approaches. We introduce AutoGL, our dedicated and the world's first open-source library for automated graph machine learning. Also, we describe a tailored benchmark that supports unified, reproducible, and efficient evaluations.
  arXiv  Detail & Related papers  (2022-01-04T18:31:31Z)
• AutoGL: A Library for Automated Graph Learning [67.63587865669372]
  We present Automated Graph Learning (AutoGL), the first dedicated library for automated machine learning on graphs. AutoGL is open-source, easy to use, and flexible to be extended. We also present AutoGL-light, a lightweight version of AutoGL to facilitate customizing pipelines and enriching applications.
  arXiv  Detail & Related papers  (2021-04-11T10:49:23Z)

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.