GADGET framework decomposes global feature effects using recursive partitioning.
problem Misleading global feature effects when feature interactions are present.
method Generalized additive decomposition of global effects (GADGET) based on recursive partitioning.
result Minimizes interaction-related heterogeneity of local feature effects.
Study robustness of global feature effect explanations in machine learning models.
problem Vulnerability of global feature effect explanations to data and model perturbations.
method Theoretical bounds and experimental evaluation of partial dependence plots and accumulated local effects.
result Quantifies the gap between best and worst-case scenarios of misinterpreting machine learning predictions globally.
Analyzes error sources in global feature effect estimation methods.
problem Unexplored error sources in global feature effect estimation methods.
method Systematic, estimator-level analysis of bias and variance.
result Holdout data is theoretically cleanest, but estimation variance depends on sample size and model characteristics.
The problem of explaining deep learning models, and model predictions generally, has attracted intensive interest recently. Many successful approaches forgo global approximations in order to provide more faithful local interpretations of the model's behavior. LIME develops multiple interpretable models, each approximat…
Estimating global pairwise interaction effects, i.e., the difference between the joint effect and the sum of marginal effects of two input features, with uncertainty properly quantified, is centrally important in science applications. We propose a non-parametric probabilistic method for detecting interaction effects of…
Mutual Information (MI) is often used for feature selection when developing classifier models. Estimating the MI for a subset of features is often intractable. We demonstrate, that under the assumptions of conditional independence, MI between a subset of features can be expressed as the Conditional Mutual Information (…
Study compares and contrasts various ML explanation methods, highlighting their disagreements and similarities.
problem Understanding and quantifying the differences between various machine learning explanation methods.
method Synthesized and visualized various explanation methods for global and local aspects of ML models.
result There is substantial agreement on the top features but less on specific rankings, and tree interpreter is comparable to SHAP for feature effects.
Introduces joint Shapley values to measure feature importance in models.
problem Measuring the importance of feature sets in machine learning models.
method Extends Shapley's axioms to measure a set of features' average contribution to a model's prediction.
result Joint Shapley values provide unique insights and are more consistent with local intuitions.
DNN2LR bridges DNN power and LR interpretability.
problem Combining DNN power and LR interpretability for real-world tabular data.
method Automatic feature crossing method based on DNN interpretation inconsistencies.
result DNN2LR outperforms complex DNN models and feature crossing methods.
FedCONST adapts update magnitudes to enhance feature generalization in FL.
problem Heterogeneous client data in FL leads to overfitting and distorted transferable features.
method FedCONST uses linear convex constraints to stabilize training and preserve generalization.
result FedCONST enhances feature transferability and robustness, achieving state-of-the-art 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.
Theoretical analysis of vision transformers' performance with MAE and CL objectives.
problem Understanding the distinct representations learned by vision transformers with MAE and CL objectives.
method Modeling visual data distribution and analyzing ViTs training dynamics with gradient descent.
result ViTs trained with MAE objectives learn both global and local features, while CL-trained ViTs favor global features.
In this study, a novel feature coding method that exploits invariance for transformations represented by a finite group of orthogonal matrices is proposed. We prove that the group-invariant feature vector contains sufficient discriminative information when learning a linear classifier using convex loss minimization. Ba…
This paper improves land cover classification using global spatial features in CNN.
problem Limited classification accuracy and universality of traditional remote sensing image classification methods.
method Integrates global spatial features into a dual-branch CNN for hyperspectral/SAR imagery classification.
result The proposed method outperforms traditional single-channel CNN methods.
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.
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.
New quantum kernels avoid overfitting by combining local and global components.
problem Exponential concentration in quantum kernels leads to overfitting.
method Local-global quantum kernels combining small subsystem and full-system measurements.
result Demonstrated benign overfitting in local-global quantum kernels.
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.
Study uses machine learning to analyze patient survey data for Lyme disease.
problem Understanding patient responses to treatment and disease progression.
method Applied various machine learning techniques to a patient registry.
result Identified key features that predict patient responses to antibiotic treatment.
Study characterizes cryospheric spectral feature space using joint PC+t-SNE approach.
problem Characterize cryospheric spectral feature space for remote sensing applications.
method Compare and contrast two approaches for identifying feature space basis vectors via dimensionality reduction (PCA and t-SNE).
result Joint characterization reveals distinct continua and clusters of ice reflectance properties.
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.
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.
Deeper networks are better for local labels, but shallower for global labels.
problem Understanding the effect of depth in overparameterized neural networks.
method Introduced local and global labels to investigate the advantage of depth.
result Deeper networks are better for local labels, shallower for global labels.
Dropout is used to avoid overfitting by randomly dropping units from the neural networks during training. Inspired by dropout, this paper presents GI-Dropout, a novel dropout method integrating with global information to improve neural networks for text classification. Unlike the traditional dropout method in which the…
In many important machine learning applications, the training distribution used to learn a probabilistic classifier differs from the testing distribution on which the classifier will be used to make predictions. Traditional methods correct the distribution shift by reweighting the training data with the ratio of the de…
Visualizing the details of different cellular structures is of great importance to elucidate cellular functions. However, it is challenging to obtain high quality images of different structures directly due to complex cellular environments. Fluorescence staining is a popular technique to label different structures but …
Enhances stock return prediction using LLMs and hybrid models.
problem Insufficient use of semantic information and alignment of LLMs with stock features.
method LG model with three strategies for global information modeling and SCRL for embedding alignment.
result Superior performance in Rank Information Coefficient and returns compared to models relying only on stock features.
The goal of supervised feature selection is to find a subset of input features that are responsible for predicting output values. The least absolute shrinkage and selection operator (Lasso) allows computationally efficient feature selection based on linear dependency between input features and output values. In this pa…
Multiple modalities of biomarkers have been proved to be very sensitive in assessing the progression of Alzheimer's disease (AD), and using these modalities and machine learning algorithms, several approaches have been proposed to assist in the early diagnosis of AD. Among the recent investigated state-of-the-art appro…
GRANITE unifies feature-based explanation methods to reduce disagreement.
problem Disagreement among feature-based explanation methods.
method GRANITE partitions feature space into regions minimizing interaction and distribution influences.
result Unified and consistent feature explanations.
Compared with global average pooling in existing deep convolutional neural networks (CNNs), global covariance pooling can capture richer statistics of deep features, having potential for improving representation and generalization abilities of deep CNNs. However, integration of global covariance pooling into deep CNNs …
SGD batch size affects autoencoder global minima sparsity and sharpness.
problem Investigating how batch size impacts autoencoder learning.
method Non-convex autoencoder training with SGD, varying batch sizes.
result SGD batch size influences global minimum sparsity and sharpness.
It is common for CCTV operators to overlook inter- esting events taking place within the crowd due to large number of people in the crowded scene (i.e. marathon, rally). Thus, there is a dire need to automate the detection of salient crowd regions acquiring immediate attention for a more effective and proactive surveil…
A new method ranks and selects features without model fitting.
problem Feature importance measures algorithm-specific and need improvement.
method Integrates global sensitivity analysis with forward selection and backward elimination.
result Demonstrates clear advantage over state-of-the-art methods.
Proposes DR-ME test for interpretable distributional treatment effects.
problem Detects invisible differences in treatment effects on distributional outcomes.
method Semiparametrically efficient finite-location test using kernel witnesses and orthogonal features.
result DR-ME reveals causal-discrepancy coordinates and has noncentral chi-square local power.
Unified local and global explanations through functional decomposition of low dimensional structures.
problem Tackles the challenge of extracting meaningful local and global explanations from machine learning models.
method Proposes a new identification constraint to decompose the global representation into main and interaction components of arbitrary order.
result Unified local and global explanations by connecting partial dependence plots and interventional SHAP values.
MGM improves media profiling by integrating textual and structural features.
problem Evaluating the bias and factuality of news media from digital data.
method MediaGraphMind (MGM) framework using variational EM, integrating textual and structural features.
result Achieves new state-of-the-art results in media profiling.
GOLFS selects features for clustering by combining global and local information.
problem Feature selection for high-dimensional clustering without labels.
method Combines global and local information via manifold learning and regularized self-representation.
result Improves feature selection and clustering accuracy.
Paper uses deep learning to improve thermal-hydraulic simulations.
problem Limited credibility of thermal-hydraulic codes in real plant conditions.
method Feature Similarity Measurement (FSM) and deep learning.
result Deep learning constructs relationships between local physical features and simulation errors.
New method R-LOCO improves local feature importance analysis.
problem Local attribution methods fail to accurately identify important features.
method R-LOCO segments input space into regions and applies global methods within.
result R-LOCO delivers more accurate local attributions.
CatGCN improves GCNs by modeling feature interactions for categorical node features.
problem Suboptimal initial node representations in GCNs due to lack of feature interaction modeling.
method Integrates explicit interaction modeling (local and global) into initial node representation learning for categorical node features.
result CatGCN enhances initial node representations through feature interaction modeling, leading to improved model performance.
Tree-based machine learning models such as random forests, decision trees, and gradient boosted trees are the most popular non-linear predictive models used in practice today, yet comparatively little attention has been paid to explaining their predictions. Here we significantly improve the interpretability of tree-bas…
Most of previous machine learning algorithms are proposed based on the i.i.d. hypothesis. However, this ideal assumption is often violated in real applications, where selection bias may arise between training and testing process. Moreover, in many scenarios, the testing data is not even available during the training pr…
Purpose: Lung nodules have very diverse shapes and sizes, which makes classifying them as benign/malignant a challenging problem. In this paper, we propose a novel method to predict the malignancy of nodules that have the capability to analyze the shape and size of a nodule using a global feature extractor, as well as …
A novel method integrates feature and topology views for unsupervised graph representation learning.
problem Lack of mutual information across feature and topology views in graph representation learning.
method Proposes a multi-view representation learning module and a common representation learning module using mutual information maximization and reconstruction loss minimization.
result Demonstrates effectiveness in integrating feature and topology views, achieving comparable or better performance than supervised methods.
Laplace kernel feature selection offers statistical guarantees for nonparametric models with few samples.
problem Statistical guarantees for kernel-based feature selection in nonconvex optimization problems.
method Sharp characterization of the gradient of the objective function for Laplace kernel feature selection.
result Model-selection consistency for Laplace kernel-based feature selection in nonparametric settings with n∼logp samples. Defines globalness measure for explainers using optimal transport.
problem Challenges in evaluating and comparing explainability methods.
method Axiomatic definition and proof of Wasserstein Globalness measure.
result Wasserstein Globalness measure facilitates meaningful comparison and selection of explainers.
Paper presents a novel approach for global feature aggregation in Graph Neural Networks.
problem Graphs lack a straightforward way to perform non-local feature aggregation like images and texts.
method Utilizes Latent Fixed Data Structure (LFDS) to aggregate feature vectors from local extraction.
result Proposed methods achieve competitive or better results with linear computational complexity.