Designing in-Memory Random Forest Memristor Crossbar Circuits

Ensemble decision tree models, such as random forests, have proven to be highly effective and often outperform other machine learning algorithms, including neural networks, on non-specialized tasks. This paper presents a novel approach to creating energy-efficient random forest circuits by utilizing in-memory computing with memristor crossbars. The inmemory PATH-based memristor crossbar provides state-of-theart (SOTA) energy efficiency for decision trees and is expected to deliver SOTA performance for random forests as well. However, no existing method combines and constructs ensembles for random forest implementations. We propose a new method for ensemble construction by converting the one-hot encoded predictions of decision trees into binary values, followed by a majority voting circuit to aggregate the results. The resulting random forest circuit achieves more than 3x improvement in energy efficiency compared to the current SOTA.

Authors

Institutions

Publication Details

Published
2025-07-13
DOI
https://doi.org/10.1109/nano63165.2025.11113828
Primary Topic
Advanced Memory and Neural Computing
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Designing in-Memory Random Forest Memristor Crossbar Circuits

Sunny Raj, Pranav Sinha
Advanced Memory and Neural Computing
article

Designing in-Memory Random Forest Memristor Crossbar Circuits

Sunny Raj, Pranav Sinha
article en

Abstract

Ensemble decision tree models, such as random forests, have proven to be highly effective and often outperform other machine learning algorithms, including neural networks, on non-specialized tasks. This paper presents a novel approach to creating energy-efficient random forest circuits by utilizing in-memory computing with memristor crossbars. The inmemory PATH-based memristor crossbar provides state-of-theart (SOTA) energy efficiency for decision trees and is expected to deliver SOTA performance for random forests as well. However, no existing method combines and constructs ensembles for random forest implementations. We propose a new method for ensemble construction by converting the one-hot encoded predictions of decision trees into binary values, followed by a majority voting circuit to aggregate the results. The resulting random forest circuit achieves more than 3x improvement in energy efficiency compared to the current SOTA.

Oakland University (US)
National Science Foundation
Openalex Percentile: Top 81%
Advanced Memory and Neural Computing
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.