New method for interpreting non-linear models using forward marginal effects.
problem Interpreting non-linear models' feature effects is challenging.
method Introducing forward marginal effects and partitioning feature space for better interpretation.
result Improved interpretation of non-linear prediction functions.
Improves sparse recovery with non-linear Fourier features.
problem Sparse recovery challenges with non-linear Fourier features.
method Characterizes sufficient data points for perfect recovery.
result Sufficient data points depend on kernel matrix.
New method distinguishes feature relevance in non-linear contexts.
problem Finding relevant features with preserved redundancies.
method Random forest models and statistical methods.
result Distinguishes strong from weak feature relevance in non-linear problems.
Gradient descent with growing learning rate enables learning non-linear features in neural networks.
problem Learning non-linear features in two-layer neural networks.
method Using gradient descent with a learning rate that grows with the sample size.
result Multiple rank-one components emerge, each corresponding to a specific polynomial feature.
In this paper we consider a problem of searching a space of predictive models for a given training data set. We propose an iterative procedure for deriving a sequence of improving models and a corresponding sequence of sets of non-linear features on the original input space. After a finite number of iterations N, the n…
Complex problems may require sophisticated, non-linear learning methods such as kernel machines or deep neural networks to achieve state of the art prediction accuracies. However, high prediction accuracies are not the only objective to consider when solving problems using machine learning. Instead, particular scientif…
DiffKnock improves feature selection in neural networks with complex dependencies and non-linear associations.
problem Selecting important features in neural networks with complex dependencies and non-linear associations.
method DiffKnock uses diffusion models to generate knockoffs and neural network statistics to measure feature importance.
result DiffKnock outperforms existing methods in detecting non-linear associations and preserving feature dependencies.
Study on dynamics of non-linear autoencoders learning principal components.
problem Technical difficulty in studying non-linear autoencoders due to non-trivial correlations.
method Derive asymptotically exact equations for SGD training of shallow, non-linear autoencoders.
result Autoencoders learn principal components sequentially and tie weights are ineffective.
Regularizes GAMs to improve interpretability by reducing concurvity.
problem Susceptibility of GAMs to concurvity reduces interpretability.
method Proposes a regularizer to penalize pairwise correlations of non-linearly transformed features.
result Improves interpretability and reduces concurvity without sacrificing prediction quality.
SAFLe solves federated learning's trade-off between non-linearity and scalability.
problem Federated Learning's high communication overhead and performance collapse on non-IID data.
method SAFLe introduces a structured head of bucketed features and sparse, grouped embeddings, mathematically equivalent to a high-dimensional linear regression.
result SAFLe achieves a new state-of-the-art in analytic FL, outperforming linear AFL and multi-round DeepAFL.
Feature selection problems have been extensively studied for linear estimation, for instance, Lasso, but less emphasis has been placed on feature selection for non-linear functions. In this study, we propose a method for feature selection in high-dimensional non-linear function estimation problems. The new procedure is…
This paper describes the autofeat Python library, which provides scikit-learn style linear regression and classification models with automated feature engineering and selection capabilities. Complex non-linear machine learning models, such as neural networks, are in practice often difficult to train and even harder to …
MinShap improves feature selection accuracy and stability in complex models.
problem Challenging feature selection in unknown non-linear relationships.
method Combines Shapley values with a modified approach to feature selection.
result MinShap outperforms state-of-the-art algorithms in accuracy and stability.
NGP selects N features from P using neural networks in a greedy, iterative process.
problem Feature selection for non-linear prediction problems.
method Neural Greedy Pursuit (NGP) algorithm, selecting features sequentially in an iterative loss minimization procedure.
result NGP provides better performance than DeepLIFT and Drop-one-out loss methods.
New Shapley values reveal non-linear feature dependencies.
problem Understanding non-linear dependencies in machine learning models.
method Model-independent Shapley values using non-parametric measures of dependence.
result Model-independent Shapley values can uncover non-linear dependencies.
A framework to compare atomistic descriptors and their transformations.
problem Comparing and understanding different atomistic descriptors and their transformations.
method Introducing a framework to compare different sets of descriptors and their transformations by metrics and kernels.
result Diagnostic tools to determine equivalent information and distorted common information between feature spaces.
Selecting important features in non-linear or kernel spaces is a difficult challenge in both classification and regression problems. When many of the features are irrelevant, kernel methods such as the support vector machine and kernel ridge regression can sometimes perform poorly. We propose weighting the features wit…
Two new algorithms reduce feature space while preserving non-linear relationships.
problem High-dimensional data and overfitting issues.
method Bias-variance analysis for non-linear transformations and generalized linear models.
result Competitive performance on regression and classification tasks.
The goal of a recommendation system is to predict the interest of a user in a given item by exploiting the existing set of ratings as well as certain user/item features. A standard approach to modeling this problem is Inductive Matrix Completion where the predicted rating is modeled as an inner product of the user and …
Simplifies deep learning scaling analysis without sacrificing accuracy.
problem Interpreting feature learning mechanisms and determining network implicit bias in high-dimensional settings.
method Developed a heuristic approach for predicting data and width scales of feature learning patterns.
result Predictions align with known results and extend to complex architectures.
Deep networks prioritize easier examples over harder ones, leading to faster training.
problem Understanding how deep networks prioritize examples of varying difficulty.
method Investigated the effect of linear vs non-linear learning modes on example difficulty.
result Non-linear dynamics tend to sequentialize the learning of examples of increasing difficulty.
KPCA improves OoD detection by separating InD and OoD data.
problem Insufficiency of PCA in detecting OoD data from InD data.
method Kernel PCA (KPCA) with task-specific kernels.
result KPCA achieves superior OoD detection performance.
FFCP improves FCP's speed without sacrificing accuracy.
problem Inefficient feature transformation in FCP.
method Introduces FFCP using Taylor expansion for faster computation.
result FFCP achieves a 50x speedup with comparable accuracy.
Traditional convolutional layers extract features from patches of data by applying a non-linearity on an affine function of the input. We propose a model that enhances this feature extraction process for the case of sequential data, by feeding patches of the data into a recurrent neural network and using the outputs or…
Proposes HSIC-Lasso for selective inference in non-linear data.
problem Detecting influential features in non-linear and high-dimensional data.
method Model-free HSIC-Lasso based on truncated Gaussians and polyhedral lemma.
result Tight control of type-I error even for small sample sizes.
Reliable measures of statistical dependence could be useful tools for learning independent features and performing tasks like source separation using Independent Component Analysis (ICA). Unfortunately, many of such measures, like the mutual information, are hard to estimate and optimize directly. We propose to learn i…
This study evaluates handwriting features to diagnose Parkinson's disease.
problem Diagnosing Parkinson's disease through handwriting analysis.
method Kinematic, geometrical, and non-linear features were evaluated using K-nearest neighbors, support vector machines, and random forest classifiers.
result Up to 93.1% accuracy in classifying Parkinson's disease and healthy subjects.
Estimates signals from a continuous dictionary with sparse mixtures using optimization.
problem Estimating signals from a continuous dictionary with unknown mixtures and noise.
method Formulates a regularized optimization problem with data fidelity and (ℓ1,Lp)-penalty. result High probability bounds on prediction error for the Group-Nonlinear-Lasso solution.
Method estimates mixture components without discretizing parameters.
problem Learning from mixtures of continuous features with noise.
method Off-the-grid optimization method for continuous parameter space.
result Prediction error bound similar to Lasso predictor.
A new method detects interactions in machine learning models.
problem Interpreting non-linear and interaction effects in machine learning models.
method Regional effect plots with implicit interaction detection.
result The method quantifies and interprets feature effects reliably, less confounded by interactions.
Reconstructing signature features from randomized vector fields in differential equations.
problem Reconstructing signature features from controlled differential equations with random vector fields.
method Using controlled ordinary differential equations driven by continuous bounded variation curves, the study explores the extent to which signature features can be reconstructed from the non-linear flow of these equations.
result The number of signature features that can be reconstructed from the non-linear flow of controlled ordinary differential equations with random vector fields is exponential in the hidden dimension, under certain conditions.
This work interprets SFA through variational inference, relaxing linearity constraints.
problem Recover non-linear SFA from variational inference.
method Probabilistic interpretation of SFA through variational inference, relaxing linearity constraints.
result Reinterprets SFA as a variational framework, allowing slowness as a regularizer to reconstruction loss.
The paper generalizes equivariant neural networks on homogeneous spaces to the non-linear setting.
problem Equivariant neural networks on homogeneous spaces.
method Deriving generalized steerability constraints for non-linear equivariant layers.
result The universality of the derived construction for non-linear equivariant layers.
Improved CAEs reduce training time and enhance generalization.
problem Stability issues in Concrete Autoencoders (CAEs) for feature selection.
method Indirectly Parameterized Concrete Autoencoders (IP-CAEs) learn parameters of Gumbel-Softmax distributions.
result IP-CAEs achieve significant improvements in generalization and training time.
fmeffects package interprets non-linear models in plain language.
problem Interpreting complex non-linear models.
method Forward marginal effects for model-agnostic explanations.
result First software implementation of forward marginal effects.
Feature selection is a technique to screen out less important features. Many existing supervised feature selection algorithms use redundancy and relevancy as the main criteria to select features. However, feature interaction, potentially a key characteristic in real-world problems, has not received much attention. As a…
We provide a pointwise confidence bound for non-linear least-squares with fixed design.
problem Confidence estimation in non-linear ℓ2-regularized least squares. method Pointwise confidence bound for local minimizers, using weighted norm involving inverse-Hessian.
result The proposed confidence bound scales with the test input's similarity to the training data.
A simple framework Probabilistic Multi-view Graph Embedding (PMvGE) is proposed for multi-view feature learning with many-to-many associations so that it generalizes various existing multi-view methods. PMvGE is a probabilistic model for predicting new associations via graph embedding of the nodes of data vectors with …
PatternLocal improves XAI for non-linear models by suppressing suppressor variables.
problem Suppressor variables cause false-positive feature attributions in non-linear models.
method PatternLocal uses locally linear surrogate models and transforms weights into a generative representation.
result PatternLocal reduces false-positive attributions and provides more reliable explanations.
Study of local optima in neural networks for feature interactions.
problem NNs struggle with local optima in feature interactions for small datasets.
method Proposed a node pruning and feature selection algorithm to improve NN performance.
result NNs have many non-equivalent local optima in XOR-like data with irrelevant variables.
Currently, approximately 30% of epileptic patients treated with antiepileptic drugs (AEDs) remain resistant to treatment (known as refractory patients). This project seeks to understand the underlying similarities in refractory patients vs. other epileptic patients, identify features contributing to drug resistance acr…
Study reward-free RL in non-linear settings, improving efficiency and removing assumptions.
problem Improving sample efficiency in reward-free reinforcement learning for non-linear function approximation.
method Proposed RFOLIVE algorithm for minimal structural assumptions, analyzed hardness results for reward-free and reward-aware exploration.
result Statistical efficiency and hardness results under various structural assumptions, no need for reachability or explorability assumptions.
Machine learning identifies ESG patterns for better stock selection.
problem Linking ESG behavior to financial performance.
method Machine learning algorithm mapping ESG features to financial outcomes.
result Machine learning strategy outperforms traditional ESG screening.
We propose a novel kernel based post selection inference (PSI) algorithm, which can not only handle non-linearity in data but also structured output such as multi-dimensional and multi-label outputs. Specifically, we develop a PSI algorithm for independence measures, and propose the Hilbert-Schmidt Independence Criteri…
A feature selection algorithm should ideally satisfy four conditions: reliably extract relevant features; be able to identify non-linear feature interactions; scale linearly with the number of features and dimensions; allow the incorporation of known sparsity structure. In this work we propose a novel feature selection…
Unified model learns joint and individual features from brain imaging data.
problem Integrating structural and functional connectivity data for behavioral phenotypes.
method Cross-Modal Joint-Individual Variational Network (CM-JIVNet) with multi-head attention fusion.
result CM-JIVNet outperforms in cross-modal reconstruction and behavioral trait prediction.
ParamBoost uses gradient boosting to create interpretable non-linear models with constraints.
problem Creating interpretable non-linear models with expert knowledge constraints.
method Gradient Boosting of cubic polynomials with specified constraints.
result ParamBoost outperforms state-of-the-art GAMs in real-world datasets.
Network embedding is the process of learning low-dimensional representations for nodes in a network, while preserving node features. Existing studies only leverage network structure information and focus on preserving structural features. However, nodes in real-world networks often have a rich set of attributes providi…