mlsanityData to 14 Oct 2026

Tiny Classifier Circuits: Evolving Accelerators for Tabular Data

arXiv 2303.00031 ↗First posted 28 Feb 2023cs.AR cs.LGcited by 1

Not on the map. Why?

Abstract (arXiv)

A typical machine learning (ML) development cycle for edge computing is to maximise the performance during model training and then minimise the memory/area footprint of the trained model for deployment on edge devices targeting CPUs, GPUs, microcontrollers, or custom hardware accelerators. This paper proposes a methodology for automatically generating predictor circuits for classification of tabular data with comparable prediction performance to conventional ML techniques while using substantially fewer hardware resources and power. The proposed methodology uses an evolutionary algorithm to search over the space of logic gates and automatically generates a classifier circuit with maximised training prediction accuracy. Classifier circuits are so tiny (i.e., consisting of no more than 300 logic gates) that they are called "Tiny Classifier" circuits, and can efficiently be implemented in ASIC or on an FPGA. We empirically evaluate the automatic Tiny Classifier circuit generation methodology or "Auto Tiny Classifiers" on a wide range of tabular datasets, and compare it against conventional ML techniques such as Amazon's AutoGluon, Google's TabNet and a neural search over Multi-Layer Perceptrons. Despite Tiny Classifiers being constrained to a few hundred logic gates, we observe no statistically significant difference in prediction performance in comparison to the best-performing ML baseline. When synthesised as a Silicon chip, Tiny Classifiers use 8-18x less area and 4-8x less power. When implemented as an ultra-low cost chip on a flexible substrate (i.e., FlexIC), they occupy 10-75x less area and consume 13-75x less power compared to the most hardware-efficient ML baseline. On an FPGA, Tiny Classifiers consume 3-11x fewer resources.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 17 of its 73 references that are in the map. First posted on arXiv 28 Feb 2023.

Builds on

17 of 73 references.

References · 17

  1. 2016XGBoost: A Scalable Tree Boosting Systemcited by 5,166
  2. 2019TabNet: Attentive Interpretable Tabular Learningcited by 648
  3. 2021Tabular Data: Deep Learning is Not All You Needcited by 535
  4. 2014OpenML: networked science in machine learningcited by 526
  5. 2020AutoGluon-Tabular: Robust and Accurate AutoML for Structured Datacited by 383
  6. 2019Neural Oblivious Decision Ensembles for Deep Learning on Tabular Datacited by 203
  7. 2022Why do tree-based models still outperform deep learning on tabular data?cited by 199
  8. 2019OpenML-Python: an extensible Python API for OpenMLcited by 63
  9. 2018FINN-R: An End-to-End Deep-Learning Framework for Fast Exploration of Quantized Neural Networkscited by 56
  10. 2019Hardware/Software Co-Exploration of Neural Architecturescited by 50
  11. 2019FPGA/DNN Co-Design: An Efficient Design Methodology for IoT Intelligence on the Edgecited by 48
  12. 2020Best of Both Worlds: AutoML Codesign of a CNN and its Hardware Acceleratorcited by 30
5 more
  1. 2020Fast, Accurate, and Simple Models for Tabular Data via Augmented Distillationcited by 27
  2. 2017OpenML: An R Package to Connect to the Machine Learning Platform OpenMLcited by 12
  3. 2020Effective Algorithm-Accelerator Co-design for AI Solutions on Edge Devicescited by 4
  4. 2018Evolving Graphs with Semantic Neutral Driftcited by 1
  5. 2020Semantically-Oriented Mutation Operator in Cartesian Genetic Programming for Evolutionary Circuit Designcited by 1

Built on by

Cited by year

Citing papers per year: 2023: 1.

1 paper.