This repository provides code for machine learning algorithms for edge devices developed at Microsoft Research India.
Machine learning models for edge devices need to have a small footprint in terms of storage, prediction latency, and energy. One example of a ubiquitous real-world application where such models are desirable is resource-scarce devices and sensors in the Internet of Things (IoT) setting. Making real-time predictions locally on IoT devices without connecting to the cloud requires models that fit in a few kilobytes.
This repository contains algorithms that shine in this setting in terms of both model size and compute, namely:
- Bonsai: Strong and shallow non-linear tree based classifier.
- ProtoNN: Prototype based k-nearest neighbors (kNN) classifier.
- EMI-RNN: Training routine to recover the critical signature from time series data for faster and accurate RNN predictions.
- FastRNN & FastGRNN - FastCells: Fast, Accurate, Stable and Tiny (Gated) RNN cells.
These algorithms can train models for classical supervised learning problems with memory requirements that are orders of magnitude lower than other modern ML algorithms. The trained models can be loaded onto edge devices such as IoT devices/sensors, and used to make fast and accurate predictions completely offline.
The tf directrory contains code, examples and scripts for all these algorithms
in TensorFlow. The cpp directory has training and inference code for Bonsai and
ProtoNN algorithms in C++. Please see install/run instruction in the Readme
pages within these directories. The applications directory has code/demonstrations
of applications of the EdgeML algorithms.
For details, please see our wiki page and our ICML'17 publications on Bonsai and ProtoNN algorithms, NIPS'18 publications on EMI-RNN and FastGRNN.
Core Contributors:
We welcome contributions, comments, and criticism. For questions, please email Harsha.
People who have contributed to this project.
Microsoft Open Source Code of Conduct. For more information see the Code of Conduct FAQ or contact [email protected] with any additional questions or comments.