Supervised linear feature extraction can be achieved by fitting a reduced rank multivariate model. This paper studies rank penalized and rank constrained vector generalized linear models. From the perspective of thresholding rules, we build a framework for fitting singular value penalized models and use it for feature …
On-device research index
arXiv research
A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
168,932 papers · 148 categories
Trend · papers per month
48 results for “fast feature extraction”
RCRC model extracts features quickly and efficiently for reinforcement learning tasks.
problem High computational costs in training reinforcement learning models.
method Convolutional Reservoir Computing (RCRC) model using random fixed-weight CNN and reservoir computing.
result RCRC model achieves state-of-the-art scores in reinforcement learning tasks.
In recent years, many publications showed that convolutional neural network based features can have a superior performance to engineered features. However, not much effort was taken so far to extract local features efficiently for a whole image. In this paper, we present an approach to compute patch-based local feature…
A problem of paramount importance in both pure (Restricted Invertibility problem) and applied mathematics (Feature extraction) is the one of selecting a submatrix of a given matrix, such that this submatrix has its smallest singular value above a specified level. Such problems can be addressed using perturbation analys…
Paper uses surprisal to dynamically allocate computation between fast and slow models.
problem Dynamic allocation of computation in neural networks.
method Surprisal-based dynamic model selection.
result Model can match baseline performance with 15% fewer FLOPs.
Induction of Non-Monotonic Rules From Statistical Learning Models Using High-Utility Itemset Miningcs.LG
Algorithm extracts non-monotonic rules from statistical models using HUIM.
problem Extracting non-monotonic rules from statistical learning models.
method Reduces problem to HUIM, uses TreeExplainer for feature importance.
result Significant improvement in classification metrics and training time.
In this paper we propose a scalable version of a state-of-the-art deterministic time-invariant feature extraction approach based on consecutive changes of basis and nonlinearities, namely, the scattering network. The first focus of the paper is to extend the scattering network to allow the use of higher order nonlinear…
Paper proposes a method to detect glare in document images.
problem Glare obscures text in document images, hindering recognition.
method Divides document into blocks, collects luminance and histogram features, uses CNN to detect glare.
result High recall and f-score in detecting glare.
We present a deep-learning network that detects multiple small objects (hundreds to thousands) in a scene while simultaneously estimating their x,y pixel locations together with a characteristic feature-set (for instance, target orientation and color). All estimations are performed in a single, forward pass which makes…
Neural network-based vocoders have recently demonstrated the powerful ability to synthesize high-quality speech. These models usually generate samples by conditioning on spectral features, such as Mel-spectrogram and fundamental frequency, which is crucial to speech synthesis. However, the feature extraction procession…
Robust ASR model removes fast-changing features to resist attacks.
problem Vulnerability of ASR systems to adversarial attacks.
method Removing fast-changing features using slow feature analysis or low-pass filtering.
result Hybrid ASR models are more than four times more robust against targeted attacks.
GeoStat simplifies time series classification with fast, intuitive features.
problem Efficiently classify time series data without high computational costs.
method GeoStat representations based on differential geometric statistics.
result Simple KNN and SVM classifiers achieve state-of-the-art performance.
Proposes Moment Exchange to use moments in image recognition models, improving generalization.
problem Discarding moments in image recognition models reduces stability and training time.
method Moment Exchange: replaces moments of learned features with another image's moments and interpolates labels.
result Improves generalization of recognition models across multiple datasets.
Exponentially fast SMF algorithm for multi-class classification.
problem Learning interpretable features from high-dimensional data.
method Novel framework that 'lifts' SMF as a low-rank matrix estimation problem.
result Provable exponential convergence to global minimizer under mild assumptions.
Paper proposes a method to extract style features from unlabeled data.
problem Extracting fine-grained features like styles from unlabeled data.
method Contrastive conditioned variational autoencoders with mutual information constraints.
result The method efficiently extracts style features from real-world natural image datasets.
We consider the task of learning to extract motion from videos. To this end, we show that the detection of spatial transformations can be viewed as the detection of synchrony between the image sequence and a sequence of features undergoing the motion we wish to detect. We show that learning about synchrony is possible …
Thanks to the rise of wearable and connected devices, sensor-generated time series comprise a large and growing fraction of the world's data. Unfortunately, extracting value from this data can be challenging, since sensors report low-level signals (e.g., acceleration), not the high-level events that are typically of in…
Malicious web content is a serious problem on the Internet today. In this paper we propose a deep learning approach to detecting malevolent web pages. While past work on web content detection has relied on syntactic parsing or on emulation of HTML and Javascript to extract features, our approach operates directly on a …
Pattern analysis often requires a pre-processing stage for extracting or selecting features in order to help the classification, prediction, or clustering stage discriminate or represent the data in a better way. The reason for this requirement is that the raw data are complex and difficult to process without extractin…
Deep neural networks are a powerful tool for feature learning and extraction given their ability to model high-level abstractions in highly complex data. One area worth exploring in feature learning and extraction using deep neural networks is efficient neural connectivity formation for faster feature learning and extr…
The features used in many image analysis-based applications are frequently of very high dimension. Feature extraction offers several advantages in high-dimensional cases, and many recent studies have used multi-task feature extraction approaches, which often outperform single-task feature extraction approaches. However…
A new method for fast graph embedding using diffusion graphs.
problem Efficiently generating graph embeddings for large networks.
method Diffusion graphs for rapid vertex sequence generation.
result Improved accuracy and performance with higher edge density.
Bayesian inference plays an important role in advancing machine learning, but faces computational challenges when applied to complex models such as deep neural networks. Variational inference circumvents these challenges by formulating Bayesian inference as an optimization problem and solving it using gradient-based op…
The paper proposes a method to analyze categorical feature interactions in large datasets using graph covariance and LLMs.
problem Analyzing complex datasets with numerous categorical features and timestamps.
method Binarization of categorical features using one-hot encoding, computation of graph covariance, identifying significant feature pairs, and using LLMs to generate explanations.
result The method identifies meaningful feature pairs and potential data stories underlying categorical feature interactions.
A new tree-based estimator, FastPD, efficiently estimates PD functions for machine learning models.
problem Efficiently estimating Partial Dependence functions for machine learning models.
method Proposes a new tree-based estimator, FastPD, to estimate PD functions.
result FastPD consistently estimates the desired population quantity and improves complexity from quadratic to linear.
FIRE extracts interpretable rules from tree ensembles.
problem Building sparse and interpretable rule sets from tree ensembles.
method Optimization-based framework with fusion regularization and sparsity-inducing penalties.
result FIRE outperforms state-of-the-art rule ensemble algorithms.
Rk-means clusters relational data without full matrix, speeding up clustering.
problem Clustering relational data without full matrix computation.
method Constructs a grid coreset for clustering, avoiding expensive feature extraction queries.
result Orders-of-magnitude speedup in clustering relational data.
Transmeter quickly measures transferability between different datasets.
problem Measuring transferability between heterogeneous multivariate datasets.
method Pre-trained source model, adversarial network, and encoder-decoder architecture.
result Transmeter provides the most accurate transferability measurement up to 10.3 times faster.
End-to-end model extracts nested terms without extra features.
problem Automatic term extraction for nested terms.
method Deep learning model that predicts conceptual terms within fixed sentence lengths.
result High recall and comparable precision on term extraction task.
FSL-Net detects and localizes feature shifts in large, high-dimensional datasets.
problem Feature shifts between data sources lead to erroneous features in various applications.
method FSL-Net is a neural network trained on multiple datasets to localize feature shifts.
result FSL-Net accurately localizes feature shifts from unseen datasets without re-training.
Extends feature selection to GNNs, improving accuracy and feature ranking.
problem Improving feature selection in Graph Neural Networks (GNNs).
method Implemented a feature selection algorithm using Gumbel Softmax for ranking and selecting features in GNNs.
result Selected 225 features out of 1433 for the Cora dataset, improving classification accuracy.
A fast method estimates stability of ensemble feature selectors.
problem Improving stability of ensemble feature selectors for better prediction.
method Simulator of a feature selector to estimate stability.
result Reduces computation time for estimating stability.
Neural networks in many varieties are touted as very powerful machine learning tools because of their ability to distill large amounts of information from different forms of data, extracting complex features and enabling powerful classification abilities. In this study, we use neural networks to extract features from b…
Feature extraction is a very crucial task in image and pixel (voxel) classification and regression in biomedical image modeling. In this work we present a machine learning based feature extraction scheme based on inception models for pixel classification tasks. We extract features under multi-scale and multi-layer sche…
FAST optimizes additive segmentation for faster, more interpretable models.
problem Efficiently segmenting and interpreting complex datasets.
method Optimization framework for fast piecewise constant shape functions.
result 2 orders of magnitude faster than state-of-the-art methods.
A new method extracts features from time series data using iterated sums and improves classification accuracy.
problem Time series classification challenges.
method Feature extraction using iterated-sums signature (ISS) followed by a linear classifier.
result Competitive with state-of-the-art methods on UCR archive.
Adaptive template systems: Data-driven feature selection for learning with persistence diagramscs.LG
Adaptive template systems improve feature extraction from persistence diagrams for machine learning.
problem Feature extraction from persistence diagrams for machine learning.
method Adaptive template systems using CDER, GMM, and HDBSCAN algorithms.
result Adaptive template systems yield competitive and often superior results in classification tasks.
Feature-based time series representations have attracted substantial attention in a wide range of time series analysis methods. Recently, the use of time series features for forecast model averaging has been an emerging research focus in the forecasting community. Nonetheless, most of the existing approaches depend on …
RTFN extracts robust temporal features for time series analysis.
problem Challenges in extracting sufficient shapelets from time series data.
method Combines temporal feature networks and attentional LSTM networks.
result RTFN outperforms in supervised and unsupervised time series analysis.
Multivariate time series classification is a high value and well-known problem in machine learning community. Feature extraction is a main step in classification tasks. Traditional approaches employ hand-crafted features for classification while convolutional neural networks (CNN) are able to extract features automatic…
Proposes a method to extract robust features that improve classifier robustness.
problem Improving classifier robustness to small perturbations in input space.
method Introduces an additional penalty term in the information bottleneck framework to minimize Fisher information, optimizing a variational bound using stochastic gradient descent.
result Optimally robust features are jointly Gaussian, and the method produces classifiers with increased robustness to perturbations.
New algorithms select and rank features from MTS without feature extraction.
problem Feature extraction step for MTS classification.
method Directly computes similarity between time series and assesses cluster structure matching labels.
result Techniques match labels well without feature extraction.
A method for MRI brain tumor segmentation using feature vectors and kernel dictionary learning.
problem Segmenting brain tumor regions in MRI images.
method Extracting feature vectors, training kernel dictionaries, and selecting informative feature vectors.
result The method outperforms other methods in segmentation accuracy and reduces training time.
Feature engineering workflow for activity recognition from synchronized inertial measurement unitscs.LG
Automates feature extraction for IMU-based activity recognition.
problem Manual feature engineering is time-consuming and limits IMU-based applications.
method FRESH algorithm for automated feature extraction.
result Workflow automates feature extraction from synchronized IMU sensors.
Proposes a new matrix factorization model for interval-valued matrices.
problem Matrix factorization for matrices with entries in a given interval.
method Bounded simplex-structured matrix factorization (BSSMF) with fast algorithm for missing data.
result BSSMF provides a unique decomposition under certain conditions.
Redundancy in deep neural network (DNN) models has always been one of their most intriguing and important properties. DNNs have been shown to overparameterize, or extract a lot of redundant features. In this work, we explore the impact of size (both width and depth), activation function, and weight initialization on th…
Fast feature selection for SHM using canonical correlation.
problem Feature selection for structural health monitoring.
method Greedy search of sum of squared canonical correlation coefficients.
result Extremely fast feature selection with good performance.
Method generates natural ECGs with 25 interpretable features.
problem Lack of labeled ECGs for supervised learning and automatic diagnostics.
method Variational autoencoder for ECG generation and feature extraction.
result Low Maximum Mean Discrepancy (0.00383) indicates good ECG generation quality.