Research
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,742 papers · 148 categories

Trend · papers per month

149299448597 · Jun 202019922001200920172026
48 results for Nonlinear Feature Selection

New approach uses secants to improve sensor placement and feature selection for nonlinear systems.

problem Inadequacy of linear methods for minimal sensor placement and feature selection in nonlinear systems.
method Data-driven approach using secant vectors to develop greedy algorithms for robust, near-minimal reconstruction guarantees.
result Demonstrated on two problems where linear techniques fail, secant-based approach provides robust solutions.

A novel feature selection method for SVM improves model accuracy and interpretability.

problem Feature selection in nonlinear SVM classification problems.
method Embedded min-max optimization problem, leveraging duality theory.
result Improves model accuracy and interpretability on benchmark data sets.

This paper selects features in deep neural networks with theoretical guarantees.

problem Feature selection in deep neural networks with unknown nonlinear functions.
method Reformulate neural networks as index models, estimate feature sets using Stein's formula, and apply screening-and-selection mechanism.
result Consistent feature selection with theoretical guarantees, even in high-dimensional settings.

We propose a new method for input variable selection in nonlinear regression. The method is embedded into a kernel regression machine that can model general nonlinear functions, not being a priori limited to additive models. This is the first kernel-based variable selection method applicable to large datasets. It sides…

2018-04-19abs ↗pdf ↗

High-dimensional data in many areas such as computer vision and machine learning tasks brings in computational and analytical difficulty. Feature selection which selects a subset from observed features is a widely used approach for improving performance and effectiveness of machine learning models with high-dimensional…

2017-10-23abs ↗pdf ↗

GraphLIME explains GNN models by selecting key features locally.

problem Explaining the effectiveness of GNN models is challenging due to complex nonlinear transformations.
method GraphLIME uses HSIC Lasso for nonlinear feature selection in GNN models.
result GraphLIME provides more descriptive explanations than existing methods.

We propose a tree regularization framework, which enables many tree models to perform feature selection efficiently. The key idea of the regularization framework is to penalize selecting a new feature for splitting when its gain (e.g. information gain) is similar to the features used in previous splits. The regularizat…

2012-01-07abs ↗pdf ↗

RAEUFS selects features from data without labels, improving robustness to outliers.

problem Feature selection in high-dimensional data, especially in the presence of outliers.
method RAEUFS uses a deep autoencoder to learn nonlinear feature representations, improving robustness to outliers.
result RAEUFS outperforms state-of-the-art UFS methods in both clean and outlier-contaminated data settings.

Introduces top-kk regularization for better feature selection in machine learning.

problem Limited ability of existing feature selection methods to reconcile feature representativeness and inter-correlations.
method Top-kk regularization, which induces a sub-architecture on the model's architecture to select informative features and model complex relationships.
result Uniform approximation error bound for top-kk regularization approximating high-dimensional sparse functions.

In this paper, a genetic algorithm-based frequency-domain feature search (GAFDS) method is proposed for the electroencephalogram (EEG) analysis of epilepsy. In this method, frequency-domain features are first searched and then combined with nonlinear features. Subsequently, these features are selected and optimized to …

2017-01-22abs ↗pdf ↗

Multilayer bootstrap network builds a gradually narrowed multilayer nonlinear network from bottom up for unsupervised nonlinear dimensionality reduction. Each layer of the network is a nonparametric density estimator. It consists of a group of k-centroids clusterings. Each clustering randomly selects data points with r…

2014-08-05abs ↗pdf ↗

Letter analyzes training dynamics of a nonlinear contrastive learning model in high dimensions.

problem Understanding training dynamics of nonlinear contrastive learning models in high-dimensional settings.
method High-dimensional analysis using McKean-Vlasov PDEs and low-dimensional ODEs.
result The model's performance evolves according to specific ODEs, revealing features like feature learnability and noise effects.

FBMS R package simplifies Bayesian model selection and averaging.

problem Complex regression settings with multi-modal posterior landscapes.
method Efficient MJMCMC and GMJMCMC algorithms for Bayesian model exploration.
result FBMS effectively handles Bayesian generalized linear and nonlinear models.

Nonparametric IPSS selects features with false discovery control.

problem Feature selection in high-dimensional data with theoretical false discovery control.
method Integrated Path Stability Selection (IPSS) applied to nonparametric feature importance scores.
result IPSS accurately controls false discovery rate and detects more true positives than existing methods.

This paper uses MIO to select features for kernel SVM classification.

problem Feature selection for kernel SVM classification.
method Mixed-integer optimization (MIO) for feature subset selection.
result The MIO approach can often outperform linear-SVM-based methods in prediction performance.

The generalized partially linear additive model (GPLAM) is a flexible and interpretable approach to building predictive models. It combines features in an additive manner, allowing each to have either a linear or nonlinear effect on the response. However, the choice of which features to treat as linear or nonlinear is …

2014-07-17abs ↗pdf ↗

New models improve machine learning accuracy and transparency in finance.

problem Black-box machine learning models lack interpretability in regulated industries.
method Introducing generalized groves of neural additive models with clear feature categories and interactions.
result Generalized groves of neural additive models achieve high accuracy with predominantly linear and sparse nonlinear components.

Study predicts electricity prices using LSTM models with feature selection, considering market coupling.

problem Accurate day-ahead electricity price forecasting in coupled markets.
method Hybrid LSTM-based deep learning models with feature selection algorithms.
result Proposed models achieve considerably accurate results in Nordic market.

GRIP2 improves deep learning feature selection robustness in correlated and noisy data.

problem Identifying predictive features in correlated and noisy data.
method Integrates first-layer feature activity over a two-dimensional regularization surface to control sparsity and geometry, using efficient block-stochastic sampling.
result Demonstrates improved robustness and power in high correlation and low signal-to-noise ratio regimes.

Study finds PLI functional connectivity feature superior for depression recognition.

problem Effective detection of depression remains a public health challenge.
method Resting state EEG data collected from MDD and normal controls; various feature types and selection methods evaluated.
result PLI functional connectivity feature superior to linear and nonlinear features; highest classification accuracy 82.31%.

New algorithms tackle data challenges in physics model selection.

problem Lack of labeled data, high dimensionality, and inapplicability of data augmentation techniques to physics data.
method Two algorithms: feature selection and data augmentation combined with classifiers and stacking ensemble.
result Achieved 90% accuracy on nonlinear structural mechanics classification problem.

SISR improves feature attribution in complex payoff schemes.

problem Distorted feature attributions due to non-additive payoff functions and high-dimensional feature spaces.
method Sparse Isotonic Shapley Regression (SISR) learns a monotonic transformation to restore additivity and enforces L0 sparsity.
result SISR achieves strong support recovery and stable attributions across various payoff schemes.

Deep learning has become increasingly popular in both supervised and unsupervised machine learning thanks to its outstanding empirical performance. However, because of their intrinsic complexity, most deep learning methods are largely treated as black box tools with little interpretability. Even though recent attempts …

2018-09-04abs ↗pdf ↗

Study develops a method to select penalty parameters for sparse neural networks without cross-validation.

problem Selecting optimal penalty parameters for sparse neural networks without cross-validation.
method Established theoretical foundation to bound the infinite norm of the gradient of the loss function at zero.
result Proposed method effectively selects penalty parameters for sparse neural networks.

FSRM method improves treatment effect estimation from observational data.

problem Estimating treatment effects from observational data with missing counterfactual outcomes and selection bias.
method FSRM method based on deep representation learning and matching, which maps covariate space into a selective, nonlinear, and balanced representation space.
result FSRM method outperforms state-of-the-art methods in estimating treatment effects.

A new knockoff statistic using conditional prediction function improves variable selection in complex models.

problem Controlling false discovery rate in complex models with nonlinear relationships.
method Introducing a knockoff statistic based on the conditional prediction function for use with machine learning models.
result The CPF statistics provide superior power in detecting prognostic variables over existing knockoff statistics.

Hybrid model for online nonlinear prediction using LSTM and soft GBDT.

problem Online nonlinear prediction with manual feature selection and model selection issues.
method End-to-end architecture with LSTM for feature extraction and soft GBDT for regression, jointly optimized.
result Significant performance improvements over conventional methods on real datasets.

We propose the Sobolev Independence Criterion (SIC), an interpretable dependency measure between a high dimensional random variable X and a response variable Y . SIC decomposes to the sum of feature importance scores and hence can be used for nonlinear feature selection. SIC can be seen as a gradient regularized Integr…

2019-10-31abs ↗pdf ↗

The Minimum Description Length (MDL) principle states that the optimal model for a given data set is that which compresses it best. Due to practial limitations the model can be restricted to a class such as linear regression models, which we address in this study. As in other formulations such as the LASSO and forward …

2009-10-21abs ↗pdf ↗