Classifiers that can be implemented on chip with minimal computational and memory resources are essential for edge computing in emerging applications such as medical and IoT devices. This paper introduces a machine learning model based on oblique decision trees to enable resource-efficient classification on a neural implant. By integrating model compression with probabilistic routing and implementing cost-aware learning, our proposed model could significantly reduce the memory and hardware cost compared to state-of-the-art models, while maintaining the classification accuracy. We trained the resource-efficient oblique tree with power-efficient regularization (ResOT-PE) on three neural classification tasks to evaluate the performance, memory, and hardware requirements. On seizure detection task, we were able to reduce the model size by 3.4X and the feature extraction cost by 14.6X compared to the ensemble of boosted trees, using the intracranial EEG from 10 epilepsy patients. In a second experiment, we tested the ResOT-PE model on tremor detection for Parkinson's disease, using the local field potentials from 12 patients implanted with a deep-brain stimulation (DBS) device. We achieved a comparable classification performance as the state-of-the-art boosted tree ensemble, while reducing the model size and feature extraction cost by 10.6X and 6.8X, respectively. We also tested on a 6-class finger movement detection task using ECoG recordings from 9 subjects, reducing the model size by 17.6X and feature computation cost by 5.1X. The proposed model can enable a low-power and memory-efficient implementation of classifiers for real-time neurological disease detection and motor decoding.
Hinge Regression Tree: A Newton Method for Oblique Regression Tree Splitting
School of Intelligence Science and Engineering(智能科学与工程学院);Harbin Institute of Technology(哈尔滨工业大学);Shenzhen Key Lab for Advanced Motion Control and Modern Automation Equipments(深圳先进运动控制系统与现代自动化设备重点实验室)
Enhance Learning Efficiency of Oblique Decision Tree via Feature Concatenation
College of Computer Science and Software Engineering, Hohai University(河海大学计算机与软件学院);State Key Laboratory for Novel Software Technology, Nanjing University(南京大学计算机软件新技术国家重点实验室);School of Artificial Intelligence and Information Technology, Nanjing University of Chinese Medicine(南京中医药大学人工智能与信息技术学院)
Uncertainty-Aware Extrapolation in Bayesian Oblique Trees
Jožef Stefan Institute(乔泽夫·斯蒂芬研究所);Jožef Stefan International Postgraduate School(乔泽夫·斯蒂芬国际研究生学校);Faculty of Information Studies in Novo mesto(诺沃梅托信息研究学院)
University of Michigan(密歇根大学);Indian Institute of Technology Indore(印度理工学院印多尔分校);University of Manitoba(曼尼托巴大学);National Taipei University of Technology(台北科技大学);Qatar University(卡塔尔大学)
Indian Institute of Technology Indore(印度理工学院印多尔分校);Nanyang Technological University(南洋理工大学);Qatar University(卡塔尔大学);VŠB - Technical University of Ostrava(俄斯特拉发技术大学)
LHT: Statistically-Driven Oblique Decision Trees for Interpretable Classification
Department of Automation(自动化系);Harbin Institute of Technology, Shenzhen(哈尔滨工业大学(深圳));Department of Computing Science(计算机科学系);University of Alberta(阿尔伯塔大学)
Hinge Regression Trees and HRT-Boost: Newton-Optimized Oblique Learning for Compact Tabular Models
School of Intelligence Science and Engineering, Harbin Institute of Technology, Shenzhen(哈尔滨工业大学深圳校区智能科学与工程学院);Shenzhen Key Lab for Advanced Motion Control and Modern Automation Equipments, Shenzhen(深圳先进运动控制及现代自动化装备重点实验室);Department of Electrical Engineering, City University of Hong Kong, Kowloon(香港城市大学电子工程系)
RO-FIGS: Efficient and Expressive Tree-Based Ensembles for Tabular Data
Department of Computer Science and Technology, University of Cambridge(计算机科学与技术系,剑桥大学);U.S. Army Medical Research and Development Command(美国陆军医疗研究与开发指挥部)