Proposes a method to predict node attributes using network topology.
problem Predicting node attributes in graphs for various applications.
method Creates a feature map using all attributes of neighbors to predict attributes values for a node.
result Significantly improves prediction accuracy compared to baseline approaches.
DEAL model predicts links for new nodes with only attribute info.
problem Predicting links for new nodes with only attribute info.
method DEAL model with two encoders and alignment mechanism.
result DEAL significantly outperforms existing methods on inductive link prediction.
In predictive process analytics, current and historical process data in event logs is used to predict the future, e.g., to predict the next activity or how long a process will still require to complete. Recurrent neural networks (RNN) and its subclasses have been demonstrated to be well suited for creating prediction m…
DVA framework attributes value of predictive models to features, configurations, and interactions.
problem Lack of explanation for how predictive models influence operational decisions.
method Shapley-based cooperative game theory applied to predict-then-optimize systems.
result DVA can guide targeted interventions to align model beliefs with operational performance.
Framework learns dynamic graph attributes and links co-evolution.
problem Forecasting change of node attributes and link formation in dynamic graphs.
method CoEvoGNN framework with temporal self-attention and joint optimization.
result Framework outperforms baselines on predicting unseen graph snapshots.
New method attributes feature uncertainty in ML models using cooperative game theory.
problem Lack of feature-level uncertainty attribution in explainable AI.
method Proposes a novel, model-agnostic uncertainty attribution method using cooperative game theory and conformal prediction.
result Demonstrates improved runtime efficiency and practical utility in real-world applications.
Performance analysis, from the external point of view of a client who would only have access to returns and holdings of a fund, evolved towards exact attribution made in the context of portfolio optimisation, which is the internal point of view of a manager controlling all the parameters of this optimisation. Attributi…
Personalized models using group attributes reduce performance, study finds.
problem Reducing performance of models using group attributes like race or gender.
method Formal conditions and collective preference guarantees to ensure fair use.
result Models personalized with group attributes reduce performance at a group level.
A framework to explain decoder-only sequence classification models using intermediate predictions.
problem Explaining predictions of decoder-only sequence classification models.
method Progressive Inference framework with Single Pass-Progressive Inference and Multi Pass-Progressive Inference methods.
result Significantly better attributions compared to prior work on text classification tasks.
PSI models and infers feature attributions efficiently and accurately.
problem Modeling and inferring feature attributions in flexible predictive models.
method Probabilistic Shapley inference (PSI) framework using latent random variables and a masking-based neural network architecture.
result PSI learns feature attribution distributions centered at Shapley values, revealing meaningful uncertainty.
MAGIC method optimally estimates model predictions changes.
problem Estimating how training data affects model predictions in large-scale settings.
method Combines classical methods and recent advances in metadifferentiation.
result MAGIC method nearly optimally estimates model predictions changes.
Most companies utilize demographic information to develop their strategy in a market. However, such information is not available to most retail companies. Several studies have been conducted to predict the demographic attributes of users from their transaction histories, but they have some limitations. First, they focu…
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.
Archipelago provides interpretable explanations of feature interactions in machine learning models.
problem Interpreting the impact of feature interactions on predictions in machine learning models.
method Archipelago is a novel framework for extracting and attributing feature interactions in a scalable and interpretable manner.
result Archipelago provides significantly more interpretable explanations of feature interactions than comparable methods.
The stochastic block model (SBM) is a probabilistic model for community structure in networks. Typically, only the adjacency matrix is used to perform SBM parameter inference. In this paper, we consider circumstances in which nodes have an associated vector of continuous attributes that are also used to learn the node-…
Proposes DAPr framework to learn feature importance from prior knowledge.
problem Ensuring meaningful feature attributions in deep models.
method Jointly learns feature importance from prior knowledge and biases models to rely on important features.
result Improves model generalization and provides new interpretation methods.
This paper significantly improves on, and finishes to validate, an approach proposed in previous research in which safety outcomes were predicted from attributes with machine learning. Like in the original study, we use Natural Language Processing (NLP) to extract fundamental attributes from raw incident reports and ma…
DArtNet predicts time series data using graph structure and dynamic attributes.
problem Predicting time series data using graph structure and dynamic attributes.
method DArtNet learns static and dynamic embeddings for graph nodes and encodes history information using RNN for joint link and attribute prediction.
result Improved time series prediction accuracy on five datasets.
This paper tackles graph translation challenges by predicting both node and edge attributes simultaneously.
problem Challenges in predicting both node and edge attributes in graph translation, especially in interactive, iterative, and asynchronous processes.
method Developed a novel framework integrating both node and edge translations seamlessly, using spectral graph regularization to maintain consistency.
result Demonstrated the effectiveness of the proposed method on both synthetic and real-world application data.
New framework improves attribution of predictive uncertainties in classification models.
problem Improper attribution of predictive uncertainties in classification tasks.
method Combines path integrals, counterfactual explanations, and generative models.
result Framework outperforms existing alternatives in quantitative evaluations.
DFI maps covariates to latent representations for feature importance.
problem Feature importance when predictors are statistically dependent.
method Disentangled Feature Importance (DFI) using entropic optimal transport.
result DFI yields stable, interpretable, uncertainty-quantified attributions of shared predictive signal.
GG-SAGE predicts links in directed graphs with attributes, outperforming existing methods.
problem Predicting links in directed graphs with node attributes.
method Gravity-GraphSAGE, a modified GraphSAGE model with a gravity-inspired decoder.
result GG-SAGE outperforms state-of-the-art GDL link prediction techniques.
WassersteinGrad improves weather forecasting explanations by addressing geometric misalignment issues.
problem Improving explainability of autoregressive neural predictions on dynamic physical fields.
method WassersteinGrad, a geometric consensus method for averaged perturbed attribution maps.
result WassersteinGrad provides more accurate explanations for weather forecasting models.
In principle, zero-shot learning makes it possible to train a recognition model simply by specifying the category's attributes. For example, with classifiers for generic attributes like \emph{striped} and \emph{four-legged}, one can construct a classifier for the zebra category by enumerating which properties it posses…
TRAK traces model predictions to training data efficiently.
problem Inefficiency in data attribution methods for large-scale models.
method TRAK: a new data attribution method that is both effective and computationally tractable.
result TRAK matches the performance of methods requiring thousands of models with just a handful.
New method optimizes fairness in predictive models for continuous sensitive attributes.
problem Enforcing full statistical independence on continuous sensitive attributes is too restrictive.
method Functional bilevel optimization (FBO) and ITD algorithms.
result Achieves lowest or near-lowest fairness-accuracy regret on synthetic and real datasets.
The paper introduces COAR to estimate component attributions and enable model editing.
problem Understanding how ML models transform inputs into predictions.
method Component modeling and COAR algorithm for estimating component attributions.
result COAR enables model editing across various tasks.
A barrier to the wider adoption of neural networks is their lack of interpretability. While local explanation methods exist for one prediction, most global attributions still reduce neural network decisions to a single set of features. In response, we present an approach for generating global attributions called GAM, w…
Bayesian approach scores influential training examples for model predictions.
problem Enhance interpretability and safety of machine learning models.
method Formulate TDA as a Bayesian information-theoretic problem, scoring subsets by information loss.
result Method aligns with classical influence scores while promoting diversity for subsets.
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.
AUASE embeds dynamic networks with stability guarantees for node comparison.
problem Stability in dynamic network embeddings for comparing nodes across time.
method Attributed unfolded adjacency spectral embedding (AUASE) for stable unsupervised learning.
result AUASE provides significant improvements in link prediction and node classification.
SWAG combines screening and wrapper methods for interpretable sparse learning.
problem Need for interpretable and replicable machine learning results in sparse settings.
method Greedy exploration of attribute space to find sparse learners.
result Library of equivalent learners for attribute availability.
New method for interpreting financial model risks.
problem Fairly allocating risk in financial models.
method Extending Shapley value framework for axiomatic risk attribution.
result Risk can be well allocated in financial models.
Ordinal regression predicts the objects' labels that exhibit a natural ordering, which is important to many managerial problems such as credit scoring and clinical diagnosis. In these problems, the ability to explain how the attributes affect the prediction is critical to users. However, most, if not all, existing ordi…
Robustly detects and attributes climate change impacts under interventions.
problem Detect and attribute climate change impacts from observations robustly.
method Supervised learning with anchor regression for robust predictions under interventions.
result CO2 forcing can be robustly predicted from temperature patterns under strong solar forcing interventions.
Predicting click and conversion probabilities when bidding on ad exchanges is at the core of the programmatic advertising industry. Two separated lines of previous works respectively address i) the prediction of user conversion probability and ii) the attribution of these conversions to advertising events (such as clic…
Convolutional neural network based systems have largely failed to be adopted in many high-risk application areas, including healthcare, military, security, transportation, finance, and legal, due to their highly uninterpretable "black-box" nature. Towards solving this deficiency, we teach a novel multi-task capsule net…
New method predicts dynamic relationships in terrorist networks.
problem Dynamic co-evolution of multiplex graphs and nodal attributes in terrorism networks.
method Time-varying stochastic latent factor models with neural network Gaussian processes.
result Superior performance in predicting unobserved dynamic relationships.
In this work we present the novel ASTRID method for investigating which attribute interactions classifiers exploit when making predictions. Attribute interactions in classification tasks mean that two or more attributes together provide stronger evidence for a particular class label. Knowledge of such interactions make…
An emerging problem in trustworthy machine learning is to train models that produce robust interpretations for their predictions. We take a step towards solving this problem through the lens of axiomatic attribution of neural networks. Our theory is grounded in the recent work, Integrated Gradients (IG), in axiomatical…
Automates UI implementation from designer images.
problem Automating UI implementation from designer images.
method Generative model training and imitation learning.
result 92.5% accuracy on Android Button attribute inference.
Background doesn't affect personality predictions in deep networks.
problem Understanding how background images influence personality attribution in deep learning models.
method Explicitly studied the effect of background images on personality prediction in deep residual networks, controlling for confounds.
result Adding background information to input decreases model performance for personality trait prediction.
Extends local attributions to Bayesian Neural Networks for improved explanations.
problem Lack of explanations for Bayesian Neural Networks' predictions.
method Extend local attributions to a probabilistic explanation distribution of BNNs.
result Enriches standard explanations with uncertainty information and visualizes explanation stability.
New framework for fairness in continuous protected attributes.
problem Inherited biases in AI predictions with continuous protected attributes.
method Formalizes SP and PP through path-specific partial derivatives, introduces a fair tuning algorithm.
result Existence and construction of fair predictors that satisfy SP along not-allowed paths and PP along allowed paths.
New method predicts model output distributions to improve data attribution.
problem Traditional training data attribution ignores randomness in model training.
method Distributional Training Data Attribution (d-TDA) using influence functions.
result Influence functions are effective and emerge naturally from d-TDA.
Interpreting predictions from tree ensemble methods such as gradient boosting machines and random forests is important, yet feature attribution for trees is often heuristic and not individualized for each prediction. Here we show that popular feature attribution methods are inconsistent, meaning they can lower a featur…
Complex models are commonly used in predictive modeling. In this paper we present R packages that can be used to explain predictions from complex black box models and attribute parts of these predictions to input features. We introduce two new approaches and corresponding packages for such attribution, namely live and …
In this paper we investigate the usage of adversarial perturbations for the purpose of privacy from human perception and model (machine) based detection. We employ adversarial perturbations for obfuscating certain variables in raw data while preserving the rest. Current adversarial perturbation methods are used for dat…