In-Run Data Shapley offers efficient data attribution for large-scale models.
problem Existing data attribution methods are computationally intensive and cannot target specific models.
method In-Run Data Shapley, which efficiently attributes data contributions to a specific model without re-training.
result In-Run Data Shapley achieves significant efficiency, enabling data attribution for pretraining models.
GGDA simplifies DA for large models, speeding up attribution by up to 50x.
problem Computational intensity of existing DA methods limits their applicability to large-scale models.
method Generalized Group Data Attribution (GGDA) framework attributing to groups of training points.
result GGDA achieves up to 50x speedups over standard DA methods while maintaining effectiveness.
SLOGAN improves GANs' conditional generation by balancing latent attribute distributions.
problem Imbalanced latent attribute distributions in GANs.
method Stein latent optimization with a Gaussian mixture prior and contrastive loss.
result SLOGAN achieves state-of-the-art unsupervised conditional generation performance.
A new method improves semi-supervised learning by handling tasks with different attribute spaces.
problem Existing methods assume tasks share the same attribute space, limiting their applicability.
method Meta-learning approach that embeds labeled and unlabeled data in task-specific spaces using neural networks.
result Improves test performance on tasks with small labeled data using unlabeled and various task data.
In this paper, we study the problem of transfer learning with the attribute data. In the transfer learning problem, we want to leverage the data of the auxiliary and the target domains to build an effective model for the classification problem in the target domain. Meanwhile, the attributes are naturally stable cross d…
Method generates time-series attribution maps with identifiability guarantees.
problem Lack of identifiability guarantees in gradient-based attribution methods.
method Regularized contrastive learning algorithm trained on time-series data.
result Empirically shows robust approximation of zero vs. non-zero entries in the ground-truth attribution map.
A new method for disentangled latent spaces in VAEs that can manipulate attributes.
problem Disentangled representation of attributes in latent spaces of VAEs.
method Attribute-based regularization loss to enforce monotonic relationships between attributes and latent codes.
result Manipulation of attributes in latent spaces post-training.
As known, attribute selection is a method that is used before the classification of data mining. In this study, a new data set has been created by using attributes expressing overall satisfaction in Turkey Statistical Institute (TSI) Life Satisfaction Survey dataset. Attributes are sorted by Ranking search method using…
Study shows data attribution methods are sensitive to hyperparameters, making tuning costly.
problem Hyperparameter sensitivity in data attribution methods makes tuning impractical.
method Theoretical analysis and lightweight procedure for selecting regularization value without retraining.
result Proposes a lightweight procedure for selecting regularization value without model retraining.
Mining tasks over sequential data, such as clickstreams and gene sequences, require a careful design of embeddings usable by learning algorithms. Recent research in feature learning has been extended to sequential data, where each instance consists of a sequence of heterogeneous items with a variable length. However, m…
A new network-based method for high-level data classification without normalization.
problem Evaluation and classification of data with hidden attribute interactions.
method A new network-building methodology based on attribute-attribute interactions, avoiding normalization.
result Improvement in accuracy of high-level classification using betweenness centrality.
Paper tackles source attribution for LLM-generated texts.
problem Identify the data provider of synthetic texts generated by LLMs.
method Watermarking to embed information about data providers in synthetic texts.
result Proposes and evaluates a source attribution framework that achieves effective source attribution.
Adapts IG for better feature attributions and robustness.
problem Reliability concerns in feature attributions for deep learning models.
method Adaptation of path-based feature attribution to Riemannian geometry of data manifolds.
result IG along geodesics generates more intuitive and robust explanations.
Graph structured data provide two-fold information: graph structures and node attributes. Numerous graph-based algorithms rely on both information to achieve success in supervised tasks, such as node classification and link prediction. However, node attributes could be missing or incomplete, which significantly deterio…
CDLEEDS detects local changes in evolving data streams for accurate feature attributions.
problem Local feature attributions become obsolete in evolving data streams.
method CDLEEDS, a flexible framework for detecting local change and concept drift.
result CDLEEDS reliably detects both local and global concept drift.
Improved scalability and interpretability in training data attribution.
problem Identifying which training data drives specific behaviors, especially unintended ones.
method Leveraging interpretable structures within the model to attribute model behavior to semantic directions, not individual test examples.
result Simple probe-based attribution methods are first-order approximations of Concept Influence that achieve comparable performance while being over an order-of-magnitude faster.
New method combines hypergraph structure and node attributes for better community detection.
problem Improving community detection in hypergraphs with node attributes.
method Developed a principled model that learns from data to combine higher-order interactions and node attributes.
result Strong performance in hyperedge prediction and community detection, especially when attributes are informative.
This work addresses fairness in ML models by training and evaluating attribute classifiers under uncertain and incomplete data.
problem Challenges in fairness metrics due to uncertain and incomplete data.
method Developed a theoretical and empirical analysis to understand and improve bias estimation in the data-scarce regime.
result The test accuracy of the attribute classifier is not always correlated with its effectiveness in bias estimation.
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.
Study on protecting sensitive properties of datasets during analysis.
problem Ensuring privacy of sensitive properties in datasets.
method Proposes definitions and mechanisms for attribute privacy using the Pufferfish framework.
result Developed efficient and inefficient mechanisms for attribute privacy.
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.
Nonparametric method measures influence of training images on diffusion model outputs.
problem Quantifying influence of individual training examples on diffusion model outputs.
method Patch-level similarity between generated and training images, using optimal score function.
result Strong attribution performance, matching gradient-based approaches and outperforming baselines.
Semantic labeling for numerical values is a task of assigning semantic labels to unknown numerical attributes. The semantic labels could be numerical properties in ontologies, instances in knowledge bases, or labeled data that are manually annotated by domain experts. In this paper, we refer to semantic labeling as a r…
RoSHAP stabilizes feature attribution in machine learning models.
problem Stochastic variation in feature attribution measures.
method Modeling feature attribution score distribution and estimating it through bootstrap resampling and kernel density estimation.
result RoSHAP provides stable feature rankings and improves model performance.
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…
Proposes new attribution methods for trees with regularization.
problem Feature attribution for trees trained with regularization.
method Prediction Decomposition Attribution (PreDecomp) and TreeInner.
result TreeInner shows state-of-the-art feature selection performance.
Paper analyzes multi-attribute data to estimate differences in Gaussian graphical models.
problem Estimating differences in two Gaussian graphical models with similar structure.
method Group lasso penalized D-trace loss function and ADMM algorithm for optimization.
result Consistency in support recovery and estimation in high-dimensional settings established.
Algorithm uncovers latent attribute graph from molecular data.
problem Learning latent representations and interpreting them for limited data.
method Perturbation experiments on latent codes of a generative autoencoder.
result Effective graphical model of latent codes and attributes.
Recent research has demonstrated that feature attribution methods for deep networks can themselves be incorporated into training; these attribution priors optimize for a model whose attributions have certain desirable properties -- most frequently, that particular features are important or unimportant. These attributio…
In this paper, we propose a novel domain adaptation method that can be applied without target data. We consider the situation where domain shift is caused by a prior change of a specific factor and assume that we know how the prior changes between source and target domains. We call this factor an attribute, and reformu…
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.
Private release of sensitive data enables fair learning.
problem Learning fair predictors with restricted sensitive data.
method Private release of sensitive demographic data, adapting non-discriminatory learners.
result The approach provides theoretical guarantees on performance for fair predictors.
In many data exploration tasks it is meaningful to identify groups of attribute interactions that are specific to a variable of interest. For instance, in a dataset where the attributes are medical markers and the variable of interest (class variable) is binary indicating presence/absence of disease, we would like to k…
Wavelet Attribution Method (WAM) improves feature attribution for deep models.
problem Inability of pixel-based heatmaps to capture data structure and variability in feature attribution.
method Wavelet domain for feature attribution, leveraging spatial and scale-localized properties of wavelet coefficients.
result WAM provides quantitatively superior explanations across audio, image, and volume modalities.
Unified analysis of removal-based feature attributions robustness.
problem Robustness of removal-based feature attributions is not well understood.
method Theoretical analysis and upper bounds derivation for removal-based feature attributions under input and model perturbations.
result Upper bounds for the difference between intact and perturbed attributions derived under various perturbation settings.
Improved data attribution for high-dimensional models.
problem Inaccurate influence functions in high-dimensional settings.
method Rescaled influence functions (RIF) for more precise data attribution.
result RIFs offer significantly better predictions in practice.
Users in various web and mobile applications are vulnerable to attribute inference attacks, in which an attacker leverages a machine learning classifier to infer a target user's private attributes (e.g., location, sexual orientation, political view) from its public data (e.g., rating scores, page likes). Existing defen…
New technique clusters and classifies datasets with missing attributes.
problem Clustering and classification issues with incomplete data.
method Modified K-MEANS++, Scalable K-MEANS++, and kNN algorithms using Sentenced Discrepancy Measure (AWPD).
result New algorithms show better results on datasets with missing attributes.
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…
PASS protects private attributes by stochastically substituting data.
problem Protecting private attributes in ML services while maintaining data utility.
method PASS uses stochastic data substitution with a novel loss function derived from information theory.
result PASS effectively protects private attributes across various datasets.
New method builds complex networks from attribute interactions without normalization.
problem Improving high-level classification algorithms by capturing hidden attribute interactions.
method Proposes a new complex network building methodology based on attribute-attribute interactions, avoiding normalization.
result Demonstrates improved performance in high-level classification techniques.
Study uncovers bias in image classification models using attribution maps.
problem Data bias in image classification models.
method Created an artificial dataset with known bias, trained CNNs, and used attribution maps to inspect decisions.
result Different attribution map techniques highlight bias better than others, and metrics support bias identification.
New framework detects out-of-distribution data by considering intrinsic ID attributes in outliers.
problem Deploying reliable machine learning systems requires effective out-of-distribution detection.
method Structured multi-view-based out-of-distribution detection learning (MVOL) framework.
result MVOL effectively utilizes both auxiliary OOD datasets and wild datasets with noisy in-distribution data.
Many real world network problems often concern multivariate nodal attributes such as image, textual, and multi-view feature vectors on nodes, rather than simple univariate nodal attributes. The existing graph estimation methods built on Gaussian graphical models and covariance selection algorithms can not handle such d…
New model generates unseen attribute combinations from limited data.
problem Lack of generalization in deep generative models for unseen attribute combinations.
method Introduces multilinear latent conditioning to capture multiplicative interactions.
result Demonstrates effectiveness on MNIST, Fashion-MNIST, and CelebA datasets.
We are interested in attribute-guided face generation: given a low-res face input image, an attribute vector that can be extracted from a high-res image (attribute image), our new method generates a high-res face image for the low-res input that satisfies the given attributes. To address this problem, we condition the …
Better Hessian approximations improve influence function attributions in deep learning.
problem Influence functions are difficult to compute due to ill-conditioned Hessians, leading to poor data attribution performance.
method Investigated the impact of Hessian approximation quality on influence-function attributions in a controlled setting.
result Better Hessian approximations consistently yield better influence score quality.
Unified analysis for graph learning from multi-attribute Gaussian time series.
problem Estimating conditional independence graph from multi-attribute Gaussian time series data.
method Unified theoretical analysis using a penalized log-likelihood objective function in the frequency domain.
result Established sufficient conditions for consistency and graph recovery in high-dimensional settings.