Papers › Reducing the Computational Complexity of Learning with Random Convolutional Features
Reducing the Computational Complexity of Learning with Random Convolutional Features
M. A. Omidi, B. Seyfe, S. Valaee
In the last decade, there has been a surge of research interest in feature extraction using random sampling. These techniques are fast and scalable and, at the same time, have practical favorability in low-sample size and high-dimensional training data. Convolutional Kitchen Sinks-based methods are promising random feature extractors for time series data. Since these methods are data-independent, many of the extracted features are redundant. To address this problem, we propose a simple and efficient feature selection method based on knee/elbow detection in the curve of ordered coefficients in linear regression. Our empirical studies show that without significant loss in accuracy, the proposed feature selector, on average, prunes more than 84 percent of randomly generated features.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Tasks
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections