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

145291436581 · Jun 202019922001200920172026
48 results for global variable importance

New local MDI variable importances derived from global scores match Shapley values.

problem Local feature relevance in tree-based models.
method Deriving local MDI importance measure from global scores and linking it to Shapley values.
result Local MDI importances have a natural connection with Shapley values.

New framework quantifies variable importance across all good models and is stable across data distribution.

problem Conflicting variable importance conclusions from different models trained on the same data.
method Proposes a new variable importance framework that considers all good models and is stable across data distribution.
result Framework accurately estimates true variable importance and recovers rankings for complex setups.

Global Sensitivity Analysis improves feature importance ranking in Random Forests.

problem Improving feature importance ranking in Random Forests.
method Applying Global Sensitivity Analysis to Random Forests for feature ranking.
result Our method provides a novel way to rank features based on their importance.

Framework assesses variable importance for heterogeneous treatment effects.

problem High-risk domains need reliable methods to assess treatment effect heterogeneity.
method Inferential framework based on Shapley values and semiparametric theory.
result Valid inference on variable importance for heterogeneous treatment effects.

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.

Proposes ICE-based metric for better understanding interactions in black-box models.

problem Misleading global sensitivity metrics in black-box models due to interaction effects.
method Individual Conditional Expectation (ICE) curves to compute feature importance and interactions.
result ICE-based metric provides richer insights into feature importance and interactions.

We introduce a variable importance measure to quantify the impact of individual input variables to a black box function. Our measure is based on the Shapley value from cooperative game theory. Many measures of variable importance operate by changing some predictor values with others held fixed, potentially creating unl…

2019-11-01abs ↗pdf ↗

DEDACT breaks down feature importance into direct and associative components.

problem Lack of clear distinction between direct and associative feature importance.
method DEDACT framework to decompose direct and associative importance measures.
result Provides insight into sources of prediction-relevant information and feature pathways.

Proposes φφ-table for statistical SHAP explanations in regression models.

problem Lack of clear directional summaries, uncertainty, and fidelity in SHAP feature importance.
method SHAP importance selection, fitting a standardized linear surrogate, reporting coefficients, uncertainty, fidelity, and stability.
result Extends SHAP into a statistical global explanation with direction, uncertainty, fidelity, and stability.

A new method uses asymmetric Shapley values to assess gene importance in clinical prediction models.

problem Clinical prediction models struggle with assessing the importance of high-dimensional features like genomics.
method Derive efficient algorithms to compute local and global asymmetric Shapley values for a mixed-dimensional prediction model.
result Asymmetric Shapley values provide a more suitable alternative to quantify feature importance in clinical prediction models.

In this work, we propose a simple but effective method to interpret black-box machine learning models globally. That is, we use a compact binary tree, the interpretation tree, to explicitly represent the most important decision rules that are implicitly contained in the black-box machine learning models. This tree is l…

2018-02-11abs ↗pdf ↗

The study examines cross-border lending behavior from G7 countries, showing changes in driving factors after the 2008 financial crisis.

problem Understanding the factors affecting cross-border lending behavior among G7 countries.
method Employed a gravity model to analyze bilateral and global factors influencing cross-border lending.
result Driving factors for cross-border lending have changed since the 2008 financial crisis, with continent variable becoming more significant.

Efficiently identifies key input variables for expensive functions using active learning.

problem Efficiently identify key input variables for expensive, black-box functions.
method Proposes novel active learning acquisition functions targeting derivative-based global sensitivity measures (DGSMs) under Gaussian process surrogate models.
result Active learning substantially enhances sample efficiency of DGSM estimation, especially with limited evaluation budgets.

New method identifies important features and interactions in RF models.

problem Limited theoretical understanding of local feature and interaction importance in RF models.
method Combines global and local analysis to identify frequent feature co-occurrences.
result Proves consistent recovery of true local signal features and interactions.

Two important goals of high-dimensional modeling are prediction and variable selection. In this article, we consider regularization with combined L1L_1 and concave penalties, and study the sampling properties of the global optimum of the suggested method in ultra-high dimensional settings. The L1L_1-penalty provides th…

2016-05-11abs ↗pdf ↗

New algorithm optimizes stochastic optimization with circular dependency.

problem Circular dependency between decision variable and importance sampling.
method Single-loop stochastic approximation algorithm based on Nesterov's dual averaging.
result Achieves minimal asymptotic variance and resolves circular optimization challenge.

While the success of deep neural networks (DNNs) is well-established across a variety of domains, our ability to explain and interpret these methods is limited. Unlike previously proposed local methods which try to explain particular classification decisions, we focus on global interpretability and ask a universally ap…

2019-01-28abs ↗pdf ↗

Random Forest variable importance is improved by class balancing techniques.

problem Class imbalance problem in machine learning.
method Proposed a variable selection algorithm using RF variable importance and its confidence interval.
result Our algorithm efficiently selects an optimal feature set, leading to improved prediction performance.

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.

HALO uses local Lipschitz constants to optimize functions efficiently.

problem Efficiently solving global optimization problems with complex objective functions.
method Hybrid Adaptive Lipschizian Optimization (HALO) algorithm that estimates local Lipschitz constants and balances global and local information.
result HALO outperforms other global optimization algorithms on numerous test functions.

A new variable importance measure for DRFs detects broader impacts on output distributions.

problem Estimating full conditional distributions of multivariate outputs given inputs.
method Based on the drop and relearn principle and MMD distance.
result Consistent and high-performing variable importance measure for DRFs.

When using deep, multi-layered architectures to build generative models of data, it is difficult to train all layers at once. We propose a layer-wise training procedure admitting a performance guarantee compared to the global optimum. It is based on an optimistic proxy of future performance, the best latent marginal. W…

2012-12-07abs ↗pdf ↗

CPI overcomes limitations of permutation importance by providing accurate variable selection.

problem Misidentification of unimportant variables in complex models due to covariate correlations.
method Developed a model agnostic and computationally lean Conditional Permutation Importance (CPI) approach.
result CPI provides accurate type-I error control and more parsimonious variable selection.

The paper investigates causal relationships in heart failure prediction using machine learning.

problem Understanding the causal relationships between clinical variables and heart failure.
method Proposes a new computational framework for causal structure discovery (CSD) of mixed-type clinical variables for binary disease outcomes.
result Feature importance from nonlinear classifiers strongly correlates with causal strength of variables, but not differentiating cause and effect.

Study proves boundedness of operators in variable exponent Morrey spaces.

problem Boundedness of operators in global Morrey-type spaces with variable exponents.
method Analysis of Hardy-Littlewood maximal operator and potential type operator in variable exponent Morrey spaces.
result Boundedness of the Hardy-Littlewood maximal operator and potential type operator in global Morrey-type spaces with variable exponents.

DSVNP uses global and local latent variables for improved neural process predictions.

problem Limited expressiveness of vanilla neural processes in capturing target-specific local variation.
method Introduces DSVNP combining global and local latent variables for prediction.
result Competitive prediction performance in multi-output regression and uncertainty estimation.

New method for mixed-variable GSA improves material design efficiency.

problem Designing materials with both quantitative and qualitative variables.
method Integrates LVGP with Sobol' analysis for mixed-variable GSA.
result Accelerates exploration of novel MOF candidates in combinatorial design spaces.

In this paper, we solve portfolio rebalancing problem when security returns are represented by uncertain variables considering transaction costs. The performance of the proposed model is studied using constant-proportion portfolio insurance (CPPI) as rebalancing strategy. Numerical results showed that uncertain paramet…

2018-12-18abs ↗pdf ↗

This paper analyzes Mean Decrease Impurity (MDI) variable importance in random forests.

problem Lack of interpretability in random forest variable importances.
method Analysis of Mean Decrease Impurity (MDI) in random forests.
result MDI provides a variance decomposition of the output when variables are independent and there are no interactions.

Hierarchical-CPI improves variable importance measurement for medical data.

problem Limited interpretability of complex medical models.
method Hierarchical-CPI measures conditional variable importance with statistical control, handling correlated data.
result Hierarchical-CPI outperforms existing methods in medical datasets.

Study examines challenges in variable importance ranking due to feature correlation.

problem Challenges in variable importance ranking under correlation.
method Simulation study and theoretical analysis of feature knockoffs and conditional predictive impact (CPI).
result Highly correlated features increase the correlation of knockoff variables, posing a limitation for CPI.

A new algorithm optimizes Gaussian process posterior mean functions efficiently.

problem Optimizing Gaussian process posterior mean functions over hyperrectangles is challenging due to nonlinearity and nonconvexity.
method PALM-Mean, a piecewise-analytic lower-bounding framework embedded in reduced-space spatial branch-and-bound.
result PALM-Mean improves scalability for large datasets compared to general-purpose solvers.

Proposes a framework to assess feature importance without algorithm constraints.

problem Lack of a general framework for assessing feature importance across different algorithms.
method Develops a nonparametric framework for algorithm-agnostic variable importance assessment.
result Valid confidence intervals and testing strategies for variable importance.

Efficiently estimates variable importance in prediction tasks using Shapley values.

problem Valid statistical inference on the importance of variables in prediction tasks.
method Randomly sampling feature subsets to estimate Shapley Population Variable Importance Measure (SPVIM) efficiently.
result The proposed estimator converges at an asymptotically optimal rate and can construct valid confidence intervals and hypothesis tests.