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.
A self-supervised debiasing method using rank regularization mitigates spurious correlations in neural networks.
problem Spurious correlations cause biases in deep neural networks, affecting generalization.
method Spectral analysis of latent representations, rank regularization, self-supervised pretraining, debiasing of downstream tasks.
result The proposed framework significantly improves generalization performance and outperforms supervised debiasing approaches.
This work addresses local fairness in machine learning models.
problem Ensuring fairness within subregions of feature space, not just global averages.
method Introduces ROAD, a Distributionally Robust Optimization (DRO) approach with adversarial learning.
result Achieves Pareto dominance in local fairness and accuracy across datasets.
New technique reduces bias in DNN models without sensitive attribute annotations.
problem Existing bias mitigation methods require instance-level annotations and do not guarantee removal of all sensitive information.
method Representation Neutralization for Fairness (RNF) debiases only the classification head of DNN models using neutralized representations.
result RNF effectively reduces discrimination of DNN models with minimal performance degradation.
This paper debiases KG embeddings by filtering sensitive attributes.
problem Social and cultural biases in KG representations.
method Exploring and filtering popularity and gender biases in KGE.
result Sensitivity of KG embeddings to sensitive attributes like gender.
MAPPING debiases GNNs for fair node classification with limited leakage.
problem Graph Neural Networks inherit and exacerbate historical discrimination in high-stake domains.
method MAPPING uses distance covariance-based fairness constraints and adversarial debiasing.
result MAPPING achieves better trade-offs between fairness and utility, mitigating privacy risks.
Method trains a debiased model from a biased one by focusing on samples that contradict the bias.
problem Training neural networks can lead to biased predictions due to spurious correlations.
method Train a pair of neural networks, intentionally biasing one and debiasing the other by focusing on contradictory samples.
result Our method significantly improves training against various types of biases, sometimes outperforming explicit supervision methods.
A theorem for debiasing machine learning with finite sample guarantees.
problem Calculating confidence intervals for machine learning functionals.
method Debiased machine learning based on bias correction and sample splitting.
result Nonasymptotic debiased machine learning theorem with finite sample guarantees.
MASC balances dataset representation using affinity clustering and distribution discrepancies.
problem Representation bias in datasets due to group imbalance.
method MASC uses affinity clustering and pairwise distribution discrepancies to balance non-protected and protected groups.
result MASC effectively debiases target datasets, comparable to existing methods.
Ridge regression is revisited with debiasing and thresholding, offering advantages over Lasso.
problem High-dimensional data challenges classical ridge regression's sparsity detection and bias issues.
method Debiasing and thresholding ridge regression, introducing a wild bootstrap for confidence regions and hypothesis testing, and a hybrid bootstrap for prediction intervals.
result Debiased and thresholded ridge regression can offer similar performance to thresholded Lasso and may be preferable in some settings.
COMMOD debiases models with minimal and interpretable changes.
problem Inconsistent and costly model updates in fair machine learning.
method Introduced COMMOD, a novel algorithm for algorithmic fairness that minimizes changes and makes them interpretable.
result COMMOD achieves comparable performance to state-of-the-art debiasing methods while making minimal and interpretable changes.
This work debiases deep chest X-ray classifiers using intra- and post-processing methods.
problem Bias in deep neural networks for chest X-ray classification.
method Intra-processing techniques (fine-tuning and pruning) and post-processing methods.
result Successfully mitigates biases in fully connected and convolutional neural networks, offering stable performance.
StochasticRank optimizes ranking metrics efficiently and guarantees global convergence.
problem Optimizing discrete ranking metrics due to their ill-posed nature.
method Stochastic smoothing, gradient estimate, debiasing, and Stochastic Gradient Langevin Boosting.
result Global convergence and superior performance on ranking datasets.
Graph neural networks (GNNs) have shown great power in learning on attributed graphs. However, it is still a challenge for GNNs to utilize information faraway from the source node. Moreover, general GNNs require graph attributes as input, so they cannot be appled to plain graphs. In the paper, we propose new models nam…
Paper develops efficient DML estimators for multiway clustered data without cross-fitting.
problem Efficient inference in models with multiway clustered dependence.
method Neyman-orthogonal moment conditions combined with localisation-based empirical process approach.
result Valid inference achieved without cross-fitting, showing debiased GMM estimators are asymptotically linear and normal.
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…
Proposes a new method for analyzing multimodal neuroimaging data.
problem Combining interpretability and flexibility in multimodal data analysis.
method Orthogonalized kernel debiased machine learning approach.
result Established consistency and asymptotic normality of the estimated primary parameter.
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.
The widespread use of automated decision processes in many areas of our society raises serious ethical issues concerning the fairness of the process and the possible resulting discriminations. In this work, we propose a novel approach called GANsan whose objective is to prevent the possibility of any discrimination i.e…
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.
Develops a method to ensure fairness across multiple sensitive attributes in machine learning.
problem Ensuring fairness among demographic groups formed by multiple sensitive attributes.
method Formulates intersectional fairness as a mutual information minimization problem and proposes a generic end-to-end algorithmic framework.
result Demonstrates effective debiasing of classification results with minimal impact to accuracy.
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.
Mitigates spurious correlations without bias labels.
problem Spurious correlations bias model performance.
method Introduces a novel training objective and debiasing method DPR.
result DPR achieves state-of-the-art performance.
DebiNet uses over-parameterized neural networks to improve linear model performance and debiasing.
problem Improving linear model performance and debiasing in high-dimensional settings.
method Incorporates over-parameterized neural networks into semi-parametric models to estimate parameters consistently.
result DebiNet offers valid inference and accurate prediction by leveraging neural networks' universal approximation and linear model's interpretability.
A new method learns fair classifiers without sacrificing accuracy.
problem Designing fair classifiers that do not discriminate based on sensitive attributes.
method A model-agnostic multi-objective architecture using a differentiable relaxation of fairness notions.
result Our method achieves lower loss of accuracy compared to current debiasing algorithms.
Although various distributed machine learning schemes have been proposed recently for pure linear models and fully nonparametric models, little attention has been paid on distributed optimization for semi-paramemetric models with multiple-level structures (e.g. sparsity, linearity and nonlinearity). To address these is…
MixCIT tests conditional independence for mixed data types efficiently and reliably.
problem Testing conditional independence for mixed data types, especially when at least one is continuous.
method Graph-based test statistic comparing kernel similarities, debiased local-polynomial approach for continuous variables.
result Unified, efficient, and statistically guaranteed solution across heterogeneous data types.
Proposes a three-stage debiasing framework to improve out-of-distribution accuracy.
problem Inaccurate uncertainty estimations in bias-only models damage ensemble-based debiasing performance.
method Calibrates the bias-only model to improve its uncertainty estimations, creating a three-stage ensemble-based debiasing framework.
result The three-stage debiasing framework consistently outperforms traditional methods in out-of-distribution accuracy.
Paper develops PGMM framework for debiased inference on nonparametric IV estimators.
problem Automatic debiased inference on nonparametric IV functionals.
method Penalized GMM (PGMM) framework for functionals of IV estimators.
result PGMM-based debiased estimator performs well, achieving near-nominal coverage.
D3M debiases models by selectively removing problematic examples.
problem Model failures on underrepresented subgroups.
method Isolates and removes specific training examples that cause failures.
result Efficiently trains debiased classifiers with minimal example removal.
Paper debiases multiple word embedding biases simultaneously.
problem Reduction of multiple biases in word embeddings.
method Joint multiclass debiasing approach using Word Embeddings Association Test (WEAT).
result Demonstrates reduction or complete elimination of bias in word embeddings.
A new method debiases multiple target parameters without IFs.
problem Debiasing multiple target parameters in nonparametric models.
method Kernel Debiased Plug-in Estimation (KDPE) using TMLE and reproducing kernel Hilbert spaces.
result KDPE simultaneously debiases all pathwise differentiable target parameters.
Current approaches for explaining machine learning models fall into two distinct classes: antecedent event influence and value attribution. The former leverages training instances to describe how much influence a training point exerts on a test point, while the latter attempts to attribute value to the features most pe…
Are Graph Neural Networks (GNNs) fair? In many real world graphs, the formation of edges is related to certain node attributes (e.g. gender, community, reputation). In this case, standard GNNs using these edges will be biased by this information, as it is encoded in the structure of the adjacency matrix itself. In this…
Debias recommender systems by accounting for hidden confounders using network information.
problem Debiased recommender systems to reduce bias caused by hidden confounders.
method Leverage network information to disentangle user conformity and item popularity, modeling exposure and ratings while controlling hidden confounders.
result The proposed method effectively debiases recommender systems, improving recommendation accuracy.
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.
A new debiasing method for high-dimensional regression with applications to PCR.
problem Debiasing in high-dimensional statistics with i.i.d. samples and sub-Gaussian covariates.
method Spectrum-Aware Debiasing using rescaled gradient descent with spectral information.
result Achieves debiasing in broader contexts with structured dependencies, heavy tails, and low-rank structures.
This paper evaluates debiasing methods on word embeddings to reduce religious bias.
problem Social biases persist in word embeddings, potentially amplifying them in AI applications.
method Investigates and evaluates three multiclass debiasing techniques on three word embeddings.
result ConceptorDebiasing is the most effective method, reducing religious bias by 82-96%.
New technique debiases distributed optimization, improving convergence rate.
problem Bias in local estimates limits effectiveness of distributed second order optimization.
method Surrogate sketching and scaled regularization to eliminate bias.
result The debiased local estimates lead to faster convergence in distributed optimization.
A debiasing method improves nonparametric regression's statistical properties.
problem Lack of theoretical guarantees for modern nonparametric regression methods.
method Model-free debiasing method incorporating a correction term.
result Debiased estimator satisfies pointwise and uniform risk convergence, asymptotic normality.
Improved local feature attributions using neighbourhood reference distributions.
problem Misleading results from global population in local model behaviour.
method Formulation of neighbourhood reference distributions and self-normalised importance sampling.
result Neighbourhood Shapley values provide meaningful sparse feature attributions.
Study improves statistical inference for CATEs using Lasso and DML.
problem Estimating and inferring CATEs in high-dimensional settings.
method Doubly robust estimator, Lasso regularization, debiased Lasso, DML.
result TDL (triple/debiased Lasso) achieves n \sqrt{n} n -consistency and confidence intervals. Multi-party machine learning leaks global dataset properties even with black-box access.
problem Leakage of global dataset properties in multi-party machine learning.
method Demonstrated leakage of sensitive attribute distributions in pooled data.
result A curious party can infer sensitive attribute distributions in other parties' data with high accuracy.
Proposes counterfactual explainability for causal attribution, extending variance analysis methods.
problem Lack of mechanistic understanding in existing tools for explaining complex models.
method Extends global sensitivity analysis methods to causal explanations using directed acyclic graphs.
result Developed methods to estimate counterfactual explainability and applied to income inequality analysis.
Develops a direct debiased machine learning framework using Bregman divergence.
problem Reduces bias in machine learning estimates of causal effects or structural models.
method Neyman targeted estimation and generalized Riesz regression using Bregman divergence.
result Improves estimation of parameters of interest in causal models.
DKGM improves image quality by debiasing kernel-based models.
problem Improving image quality in generative models without losing detail.
method Two-stage framework: KDE for density estimation, debiasing algorithm inspired by stochastic approximation.
result DKGM achieves comparable image quality to state-of-the-art models on CIFAR10.
Paper develops a distributed debiased estimator for sparse statistical inference.
problem High computational costs in debiased estimator construction for high-dimensional models.
method Develops a multi-round distributed debiased estimator using both labeled and unlabelled data.
result Unlabeled data improves statistical rate of each iteration in distributed setup.
We simplify debiasing of LASSO estimates for practical computation.
problem Bias in LASSO estimates for high-dimensional data.
method Reformulate optimization problem to compute debiasing matrix W directly.
result Efficient closed-form solution for W with unique optimal solution.