Goto

Collaborating Authors

 efficient sequential data classification


Multiple Instance Learning for Efficient Sequential Data Classification on Resource-constrained Devices

Neural Information Processing Systems

We study the problem of fast and efficient classification of sequential data (such as time-series) on tiny devices, which is critical for various IoT related applications like audio keyword detection or gesture detection. Such tasks are cast as a standard classification task by sliding windows over the data stream to construct data points. Deploying such classification modules on tiny devices is challenging as predictions over sliding windows of data need to be invoked continuously at a high frequency. Each such predictor instance in itself is expensive as it evaluates large models over long windows of data. In this paper, we address this challenge by exploiting the following two observations about classification tasks arising in typical IoT related applications: (a) the signature of a particular class (e.g. an audio keyword) typically occupies a small fraction of the overall data, and (b) class signatures tend to be discernible early on in the data. We propose a method, EMI-RNN, that exploits these observations by using a multiple instance learning formulation along with an early prediction technique to learn a model that achieves better accuracy compared to baseline models, while simultaneously reducing computation by a large fraction. For instance, on a gesture detection benchmark [ 25 ], EMI-RNN improves standard LSTM model's accuracy by up to 1% while requiring 72x less computation. This enables us to deploy such models for continuous real-time prediction on a small device such as Raspberry Pi0 and Arduino variants, a task that the baseline LSTM could not achieve. Finally, we also provide an analysis of our multiple instance learning algorithm in a simple setting and show that the proposed algorithm converges to the global optima at a linear rate, one of the first such result in this domain.


Reviews: Multiple Instance Learning for Efficient Sequential Data Classification on Resource-constrained Devices

Neural Information Processing Systems

The main driving observations include (a) presence of a signature in a small fraction of the data, and (b) that the signatures are predictable using a prefix of the data. The algorithm, EMI-RNN, Early Multi-Instance RNN, shows significant reduction in computation (about 80%) while maintaining/improving the accuracy of the models marginally. Discussion on gains achieved (accuracy, resources used, and time taken) with respect to percentage of noise in the data should help establish the importance of the approach taken by EMI-RNN. This makes reader uncomfortable and causes doubts. Please consider restructuring this part.


Multiple Instance Learning for Efficient Sequential Data Classification on Resource-constrained Devices

Dennis, Don, Pabbaraju, Chirag, Simhadri, Harsha Vardhan, Jain, Prateek

Neural Information Processing Systems

We study the problem of fast and efficient classification of sequential data (such as time-series) on tiny devices, which is critical for various IoT related applications like audio keyword detection or gesture detection. Such tasks are cast as a standard classification task by sliding windows over the data stream to construct data points. Deploying such classification modules on tiny devices is challenging as predictions over sliding windows of data need to be invoked continuously at a high frequency. Each such predictor instance in itself is expensive as it evaluates large models over long windows of data. In this paper, we address this challenge by exploiting the following two observations about classification tasks arising in typical IoT related applications: (a) the "signature" of a particular class (e.g. an audio keyword) typically occupies a small fraction of the overall data, and (b) class signatures tend to be discernible early on in the data.