
























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.
| Subjects: | Machine Learning (cs.LG) |
| Cite as: | arXiv:2605.08996 [cs.LG] |
| (or arXiv:2605.08996v1 [cs.LG] for this version) | |
| https://doi.org/10.48550/arXiv.2605.08996 arXiv-issued DOI via DataCite (pending registration) |
From: Rasha Karakchi [view email]
[v1]
Sat, 9 May 2026 15:26:06 UTC (551 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。