MINIROCKET: A Very Fast (Almost) Deterministic Transform for Time Series Classification

• URL: http://arxiv.org/abs/2012.08791v1
• Date: Wed, 16 Dec 2020 08:24:09 GMT
• Title: MINIROCKET: A Very Fast (Almost) Deterministic Transform for Time Series Classification
• Authors: Angus Dempster, Daniel F. Schmidt, Geoffrey I. Webb
• Abstract summary: ROCKET achieves state-of-the-art accuracy with a fraction of the computational expense of most existing methods. We reformulate ROCKET into a new method, MINIROCKET, making it up to 75 times faster on larger datasets. It is possible to train and test a classifier on all of 109 datasets from the UCR archive to state-of-the-art accuracy in less than 10 minutes.
• Score: 5.519586522442065
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Until recently, the most accurate methods for time series classification were limited by high computational complexity. ROCKET achieves state-of-the-art accuracy with a fraction of the computational expense of most existing methods by transforming input time series using random convolutional kernels, and using the transformed features to train a linear classifier. We reformulate ROCKET into a new method, MINIROCKET, making it up to 75 times faster on larger datasets, and making it almost deterministic (and optionally, with additional computational expense, fully deterministic), while maintaining essentially the same accuracy. Using this method, it is possible to train and test a classifier on all of 109 datasets from the UCR archive to state-of-the-art accuracy in less than 10 minutes. MINIROCKET is significantly faster than any other method of comparable accuracy (including ROCKET), and significantly more accurate than any other method of even roughly-similar computational expense. As such, we suggest that MINIROCKET should now be considered and used as the default variant of ROCKET.

Related papers

• Computation-Aware Gaussian Processes: Model Selection And Linear-Time Inference [55.150117654242706]
  We show that model selection for computation-aware GPs trained on 1.8 million data points can be done within a few hours on a single GPU. As a result of this work, Gaussian processes can be trained on large-scale datasets without significantly compromising their ability to quantify uncertainty.
  arXiv  Detail & Related papers  (2024-11-01T21:11:48Z)
• Detach-ROCKET: Sequential feature selection for time series classification with random convolutional kernels [0.7499722271664144]
  We introduce Sequential Feature Detachment (SFD) to identify and prune non-essential features in ROCKET-based models. SFD can produce models with better test accuracy using only 10% of the original features. We also present an end-to-end procedure for determining an optimal balance between the number of features and model accuracy.
  arXiv  Detail & Related papers  (2023-09-25T20:24:36Z)
• Back to Basics: A Sanity Check on Modern Time Series Classification Algorithms [5.225544155289783]
  In the current fast-paced development of new classifiers, taking a step back and performing simple baseline checks is essential. These checks are often overlooked, as researchers are focused on establishing new state-of-the-art results, developing scalable algorithms, and making models explainable.
  arXiv  Detail & Related papers  (2023-08-15T17:23:18Z)
• Rapid Person Re-Identification via Sub-space Consistency Regularization [51.76876061721556]
  Person Re-Identification (ReID) matches pedestrians across disjoint cameras. Existing ReID methods adopting real-value feature descriptors have achieved high accuracy, but they are low in efficiency due to the slow Euclidean distance computation. We propose a novel Sub-space Consistency Regularization (SCR) algorithm that can speed up the ReID procedure by 0.25$ times.
  arXiv  Detail & Related papers  (2022-07-13T02:44:05Z)
• Matching Pursuit Based Scheduling for Over-the-Air Federated Learning [67.59503935237676]
  This paper develops a class of low-complexity device scheduling algorithms for over-the-air learning via the method of federated learning. Compared to the state-of-the-art proposed scheme, the proposed scheme poses a drastically lower efficiency system. The efficiency of the proposed scheme is confirmed via experiments on the CIFAR dataset.
  arXiv  Detail & Related papers  (2022-06-14T08:14:14Z)
• Stress-Testing LiDAR Registration [52.24383388306149]
  We propose a method for selecting balanced registration sets, which are challenging sets of frame-pairs from LiDAR datasets. Perhaps unexpectedly, we find that the fastest and simultaneously most accurate approach is a version of advanced RANSAC.
  arXiv  Detail & Related papers  (2022-04-16T05:10:55Z)
• HDC-MiniROCKET: Explicit Time Encoding in Time Series Classification with Hyperdimensional Computing [14.82489178857542]
  MiniROCKET is one of the best existing methods for time series classification. We extend this approach to provide better global temporal encodings using hyperdimensional computing (HDC) mechanisms. The extension with HDC can achieve considerably better results on datasets with high temporal dependence without increasing the computational effort for inference.
  arXiv  Detail & Related papers  (2022-02-16T13:33:13Z)
• Nesterov Accelerated ADMM for Fast Diffeomorphic Image Registration [63.15453821022452]
  Recent developments in approaches based on deep learning have achieved sub-second runtimes for DiffIR. We propose a simple iterative scheme that functionally composes intermediate non-stationary velocity fields. We then propose a convex optimisation model that uses a regularisation term of arbitrary order to impose smoothness on these velocity fields.
  arXiv  Detail & Related papers  (2021-09-26T19:56:45Z)
• Random Convolution Kernels with Multi-Scale Decomposition for Preterm EEG Inter-burst Detection [0.0]
  Linear classifiers with random convolution kernels are computationally efficient methods that need no design or domain knowledge. A recently proposed method, RandOm Convolutional KErnel Transforms, has shown high accuracy across a range of time-series data sets. We propose a multi-scale version of this method, using both high- and low-frequency components.
  arXiv  Detail & Related papers  (2021-08-04T13:07:41Z)
• MultiRocket: Effective summary statistics for convolutional outputs in time series classification [5.857382887020592]
  We show that it is possible to significantly improve the accuracy of MiniRocket (and Rocket) By expanding the set of features produced by the transform, we make MultiRocket (for MiniRocket with Multiple Features) the single most accurate method on the datasets in the UCR archive.
  arXiv  Detail & Related papers  (2021-01-31T14:04:10Z)
• AutoSimulate: (Quickly) Learning Synthetic Data Generation [70.82315853981838]
  We propose an efficient alternative for optimal synthetic data generation based on a novel differentiable approximation of the objective. We demonstrate that the proposed method finds the optimal data distribution faster (up to $50times$), with significantly reduced training data generation (up to $30times$) and better accuracy ($+8.7%$) on real-world test datasets than previous methods.
  arXiv  Detail & Related papers  (2020-08-16T11:36:11Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.