Yi-Chun Liao
Yi-Chun Liao廖奕鈞

I am a first-year Ph.D. student in the CEI Lab within the Department of Electrical and Computer Engineering at Duke University, advised by Prof. Yiran Chen and Prof. Hai "Helen" Li. I also collaborate extensively with Prof. X. Sharon Hu at the University of Notre Dame. My research centers on a fundamental question: Is in-memory computing the future of computer architecture? I approach this question by exploring potential applications, extending hardware capabilities, improving performance robustness, and enhancing resource efficiency of in-memory computing architectures. Before joining the CEI Lab, I had the privilege of working with Prof. Tei-Wei Kuo and Prof. Yuan-Hao Chang at National Taiwan University.

Recent News

2026-08-24Joined Duke CEI as a Ph.D. student!
2026-04-22RETENTION is accepted by TCAD!

Research Interests

  • In-Memory Computing
  • Algorithm-Hardware Co-Design
  • Content-Addressable Memory

Selected Publications

TCAD '26

RETENTION: Resource-Efficient Tree-Based Ensemble Model Acceleration with Content-Addressable Memory

Yi-Chun Liao, Chieh-Lin Tsai, Yuan-Hao Chang, Camélia Slimani, Jalil Boukhobza, Tei-Wei Kuo

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2026

Abstract

Although deep learning has demonstrated remarkable capability in learning from unstructured data, modern tree-based ensemble models remain superior in extracting relevant information and learning from structured datasets. While several efforts have been made to accelerate tree-based models, the inherent characteristics of the models pose significant challenges for conventional accelerators. Recent research leveraging content-addressable memory (CAM) offers a promising solution for accelerating tree-based models, yet existing designs suffer from excessive memory consumption and low utilization. This work addresses these challenges by introducing RETENTION, an end-to-end framework that significantly reduces CAM capacity requirement for tree-based model inference. We propose an iterative pruning algorithm with a novel pruning criterion tailored for bagging-based models (e.g., Random Forest), which minimizes model complexity while ensuring controlled accuracy degradation. Additionally, we present a tree mapping scheme that incorporates two innovative data placement strategies to alleviate the memory redundancy caused by the widespread use of don’t care states in CAM. Experimental results show that implementing the tree mapping scheme alone reduces CAM capacity requirement by 1.46× to 21.30×, while the full RETENTION framework achieves 4.35× to 207.12× reduction with less than 3% accuracy loss. These results demonstrate that RETENTION is highly effective in minimizing CAM resource demand, providing a resource-efficient direction for tree-based model acceleration.

CODES+ISSS '25 WIP

Practicalizing Tree-Based Model Acceleration with CAM through Model Pruning and Data Placement Optimization

Yi-Chun Liao, Chieh-Lin Tsai, Yuan-Hao Chang, Camélia Slimani, Jalil Boukhobza, Tei-Wei Kuo

ACM/IEEE International Conference on Hardware/Software Codesign and System Synthesis, 2025

Abstract

Tree-based model remains state-of-the-art for many tasks involving tabular data. While these models are favored in resource-constrained environments, the inherent characteristics result in inefficiency during inference, posing significant challenges for conventional accelerators. Recent research has achieved unprecedented acceleration with content-addressable memory (CAM), yet at the cost of overwhelming memory consumption with low utilization, which is impractical for numerous real-world applications. This work addresses these issues by introducing an end-to-end framework RETENTION. RETENTION incorporates (1) a pruning algorithm to minimize model complexity under a user-specified accuracy loss tolerance, and (2) two data placement strategies to enhance memory utilization and further reduce capacity requirement. Experiment results show that space efficiency can be improved from 4.35× to 207.12× with less than 3% accuracy loss.

Visitors