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

Trend · papers per month

116232347463 · Jun 202019922001200920172026
48 results for feature contribution

New method disentangles feature importance scores in machine learning.

problem Misinterpretation of feature importance scores due to interactions and dependencies.
method Derive DIP (Disentangled Importance) decomposition of feature importance scores.
result DIP decomposition uniquely separates standalone contributions from interactions and dependencies.

Q-SHAP efficiently calculates feature contributions in boosting trees.

problem Global evaluation of feature contributions in tree models.
method Q-SHAP, an efficient algorithm that reduces Shapley values calculation to polynomial time.
result Q-SHAP improves computational efficiency and enhances accuracy of feature-specific R2R^2 estimates.

New method to quantify feature contributions to disparity without access to decision-making model.

problem Quantifying feature contributions to disparity when decision-making model is not accessible.
method Use information theory to measure redundant statistical dependency between protected attribute and feature.
result Quantify feature contributions to disparity using information theory.

Efficiently estimates SAGE values using causal structure learning.

problem Computational infeasibility of exact SAGE calculations.
method Uses causal structure learning to identify conditional independencies and accelerate SAGE approximation.
result Empirically demonstrates efficient and accurate estimation of SAGE values.

MACQ method explains deep learning models by analyzing feature contributions across prediction levels.

problem Explaining deep learning model predictions.
method Global gradient-based, model-agnostic approach focusing on marginal attribution.
result MACQ separates feature contributions from interaction effects and visualizes 3-way relationships.

New method quantifies feature interactions in machine learning models.

problem Capturing high-order interactions and feature contributions in predictive models.
method Information-theoretic approach using Conditional Mutual Information (CMI) via k-NN.
result Accurately recovers feature interactions in synthetic and real-world datasets.

A game-theoretic approach selects features by testing their marginal contributions.

problem Feature selection in econometric and statistical models.
method A coalitional game where features are players and payoff is model performance. Hypothesis test decides feature relevance.
result The approach significantly outperforms existing methods in simulations.

We develop a theory of higher-order feature attribution for complex models.

problem Interpreting feature contributions in models with interactions is challenging.
method We extend Integrated Gradients (IG) to higher-order feature attributions.
result We establish natural connections to statistics and topological signal processing.

XPER methodology decomposes credit scoring model performance.

problem Monitoring and understanding the key drivers of credit scoring model performance.
method XPER methodology based on Shapley values, decomposing performance metrics into feature contributions.
result A small number of features explain a large part of model performance.

For feature selection and related problems, we introduce the notion of classification game, a cooperative game, with features as players and hinge loss based characteristic function and relate a feature's contribution to Shapley value based error apportioning (SVEA) of total training error. Our major contribution is ($…

2020-01-12abs ↗pdf ↗

In recent years, a large amount of model-agnostic methods to improve the transparency, trustability and interpretability of machine learning models have been developed. We introduce local feature importance as a local version of a recent model-agnostic global feature importance method. Based on local feature importance…

2018-04-18abs ↗pdf ↗

Paper compares ML methods for credit scoring, highlighting feature selection and scaling impacts.

problem Determining default risk in credit scoring models.
method Eight ML methods (SVM, Naive Bayes, DT, RF, XGBoost, KNN, MLP, LR) with feature selection and scaling.
result Feature selection and scaling improve model performance in credit scoring.

Customer Satisfaction is the most important factors in the industry irrespective of domain. Key Driver Analysis is a common practice in data science to help the business to evaluate the same. Understanding key features, which influence the outcome or dependent feature, is highly important in statistical model building.…

2018-05-25abs ↗pdf ↗

Existing feature selection methods fail to properly account for interactions between features when evaluating feature subsets. In this paper, we attempt to remedy this issue by using orthogonal variance decomposition to evaluate features. The orthogonality of the decomposition allows us to directly calculate the total …

2019-10-22abs ↗pdf ↗

Federated Machine Learning (FML) creates an ecosystem for multiple parties to collaborate on building models while protecting data privacy for the participants. A measure of the contribution for each party in FML enables fair credits allocation. In this paper we develop simple but powerful techniques to fairly calculat…

2019-09-17abs ↗pdf ↗

Non-experts have long made important contributions to machine learning (ML) by contributing training data, and recent work has shown that non-experts can also help with feature engineering by suggesting novel predictive features. However, non-experts have only contributed features to prediction tasks already posed by e…

2018-02-14abs ↗pdf ↗

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.

New guarantees for asymmetric sketching in compressive learning.

problem Statistical guarantees for compressive learning with asymmetric feature maps.
method Proves existing guarantees carry over to asymmetric scheme with LPD property, applies to quantized sketches.
result Existing statistical guarantees for compressive learning extend to asymmetric schemes with controlled error.

Collaborative Trees model analyzes feature interactions and additive effects.

problem Analyzing complex statistical associations between features and response variables.
method Proposes a novel tree model and its bagging version to decompose mean decrease in impurity and visualize feature contributions.
result Demonstrates the superior capability of the tree model in estimating additive effects and interaction effects.

Improves efficiency of random feature approximations for dot product kernels.

problem Efficiency of random feature approximations for dot product kernels.
method Generalization of existing random feature approximations using complex-valued random features, theoretical analysis of variances, data-driven optimization approach.
result Complex-valued random features can significantly reduce the variances of approximations.

GENIE balances domain-invariant feature learning and gradient alignment for improved DG performance.

problem Domain Generalization (DG) overfitting to domain-specific features
method GENIE (Generalization-ENhancing Iterative Equalizer) optimizer
result Prevents a small subset of parameters from dominating optimization, promoting domain-invariant feature learning

The increasing occurrence of ordinal data, mainly sociodemographic, led to a renewed research interest in ordinal regression, i.e. the prediction of ordered classes. Besides model accuracy, the interpretation of these models itself is of high relevance, and existing approaches therefore enforce e.g. model sparsity. For…

2019-02-20abs ↗pdf ↗

This paper is first-line research expanding GANs into graph topology analysis. By leveraging the hierarchical connectivity structure of a graph, we have demonstrated that generative adversarial networks (GANs) can successfully capture topological features of any arbitrary graph, and rank edge sets by different stages a…

2017-07-19abs ↗pdf ↗

New method decomposes sensory information from neurons into specific stimuli and features.

problem Understanding how much and what specific information neurons encode.
method Introduced axioms for meaningful stimulus-wise decomposition and derived a tractable solution using diffusion models.
result Can efficiently estimate contributions of specific stimuli and features to encoded information.

New method quantifies intrinsic causal contributions in neural networks.

problem Measuring the causal influence of input features in deep neural networks.
method Proposes an identifiable generative post-hoc framework to quantify intrinsic causal contributions (ICC) as structural causal models.
result ICC generates more intuitive and reliable explanations compared to existing global explanation techniques.

Deep learning techniques are rapidly advanced recently, and becoming a necessity component for widespread systems. However, the inference process of deep learning is black-box, and not very suitable to safety-critical systems which must exhibit high transparency. In this paper, to address this black-box limitation, we …

2019-03-13abs ↗pdf ↗

Determining risk contributions of unit exposures to portfolio-wide economic capital is an important task in financial risk management. Computing risk contributions involves difficulties caused by rare-event simulations. In this study, we address the problem of estimating risk contributions when the total risk is measur…

2017-02-10abs ↗pdf ↗