Detach-ROCKET: Sequential feature selection for time series classification with random convolutional kernels
Not on the map. Why?
Abstract (arXiv)
Time Series Classification (TSC) is essential in fields like medicine, environmental science, and finance, enabling tasks such as disease diagnosis, anomaly detection, and stock price analysis. While machine learning models like Recurrent Neural Networks and InceptionTime are successful in numerous applications, they can face scalability issues due to computational requirements. Recently, ROCKET has emerged as an efficient alternative, achieving state-of-the-art performance and simplifying training by utilizing a large number of randomly generated features from the time series data. However, many of these features are redundant or non-informative, increasing computational load and compromising generalization. Here we introduce Sequential Feature Detachment (SFD) to identify and prune non-essential features in ROCKET-based models, such as ROCKET, MiniRocket, and MultiRocket. SFD estimates feature importance using model coefficients and can handle large feature sets without complex hyperparameter tuning. Testing on the UCR archive shows that SFD can produce models with better test accuracy using only 10% of the original features. We named these pruned models Detach-ROCKET. We also present an end-to-end procedure for determining an optimal balance between the number of features and model accuracy. On the largest binary UCR dataset, Detach-ROCKET improves test accuracy by 0.6% while reducing features by 98.9%. By enabling a significant reduction in model size without sacrificing accuracy, our methodology improves computational efficiency and contributes to model interpretability. We believe that Detach-ROCKET will be a valuable tool for researchers and practitioners working with time series data, who can find a user-friendly implementation of the model at urlhttps://github.com/gon-uri/detachrocket.
Key facts. Cited by 7 papers in the map (data through 7 Oct 2026). Builds on 23 of its 56 references that are in the map. First posted on arXiv 25 Sep 2023.
Builds on
23 of 56 references.
References · 23
- 2017Attention Is All You Needcited by 59,932
- 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,250
- 2018Deep learning for time series classification: a reviewcited by 575
- 2021Sparsity in Deep Learning: Pruning and growth for efficient inference and training in neural networkscited by 521
- 2018The UCR Time Series Archivecited by 421
- 2019InceptionTime: Finding AlexNet for Time Series Classificationcited by 386
- 2019ROCKET: Exceptionally fast and accurate time series classification using random convolutional kernelscited by 336
- 2019Deconstructing Lottery Tickets: Zeros, Signs, and the Supermaskcited by 206
- 2020MINIROCKET: A Very Fast (Almost) Deterministic Transform for Time Series Classificationcited by 186
- 2020Benchmarking Multivariate Time Series Classification Algorithmscited by 145
- 2021HIVE-COTE 2.0: a new meta ensemble for time series classificationcited by 118
- 2023Bake off redux: a review and experimental evaluation of recent time series classification algorithmscited by 99
11 more
- 2019sktime: A Unified Interface for Machine Learning with Time Seriescited by 98
- 2021MultiRocket: Multiple pooling operators and transformations for fast and effective time series classificationcited by 89
- 2021PySINDy: A comprehensive Python package for robust sparse system identificationcited by 88
- 2017Sparse learning of stochastic dynamic equationscited by 76
- 2019TS-CHIEF: A Scalable and Accurate Forest Algorithm for Time Series Classificationcited by 67
- 2022HYDRA: Competing convolutional kernels for fast and accurate time series classificationcited by 53
- 2023Benchmarking sparse system identification with low-dimensional chaoscited by 19
- 2022HDC-MiniROCKET: Explicit Time Encoding in Time Series Classification with Hyperdimensional Computingcited by 13
- 2022S-Rocket: Selective Random Convolution Kernels for Time Series Classificationcited by 6
- 2022Quantifying Relevance in Learning and Inferencecited by 5
- 2023POCKET: Pruning Random Convolution Kernels for Time Series Classification from a Feature Selection Perspectivecited by 4
Built on by
Citing papers per year: 2023: 1; 2024: 2; 2025: 0; 2026: 4.
7 papers.
- 2023Deep Learning for Time Series Classification of Parkinson's Disease Eye Tracking Datacited by 3
- 2024Classification of Raw MEG/EEG Data with Detach-Rocket Ensemble: An Improved ROCKET Algorithm for Multivariate Time Series Analysiscited by 2
- 2024Time series classification with random convolution kernels: pooling operators and input representations mattercited by 2
- 2026Detecting Autism Spectrum Disorder with Deep Eye Movement Featurescited by 0
- 2026ROMAN: A Multiscale Routing Operator for Convolutional Time Series Modelscited by 0
- 2026Pruning Extensions and Efficiency Trade-Offs for Sustainable Time Series Classificationcited by 0
- 2026AOI-Net: Structural Face AOI-Guided Eye-Gaze Track Representation Learning for Autism Spectrum Disorder Detectioncited by 0
- 2026AOI-Net: Structural Face AOI-Guided Eye-Gaze Track Representation Learning for Autism Spectrum Disorder Detection29 Aug 2026
- 2026Pruning Extensions and Efficiency Trade-Offs for Sustainable Time Series Classification9 Apr 2026
- 2026ROMAN: A Multiscale Routing Operator for Convolutional Time Series Models2 Apr 2026
- 2026Detecting Autism Spectrum Disorder with Deep Eye Movement Features9 Jan 2026
- 2024Time series classification with random convolution kernels: pooling operators and input representations matter2 Sep 2024
- 2024Classification of Raw MEG/EEG Data with Detach-Rocket Ensemble: An Improved ROCKET Algorithm for Multivariate Time Series Analysis5 Aug 2024
- 2023Deep Learning for Time Series Classification of Parkinson's Disease Eye Tracking Data28 Nov 2023