The paper compares different fairness definitions under various worldviews.
problem Avoiding disparity amplification under different worldviews.
method Mathematical comparison of four fairness definitions using a theoretical framework.
result Different worldviews require different fairness definitions to avoid disparity amplification.
New feature selection methods reduce bias amplification in models.
problem Bias amplification in machine learning models.
method Analysis and development of feature selection algorithms.
result Feature-wise bias amplification can be mitigated through targeted feature selection.
Study shows significant differences in recommendation bias between model-based and memory-based algorithms.
problem Recommendation bias disparity across different algorithms and item categories.
method Examined bias disparity in a range of collaborative recommendation algorithms and item categories.
result Significant differences found between model-based and memory-based algorithms.
The paper develops a theory explaining how machine learning models can amplify biases.
problem Understanding and mitigating bias in machine learning models.
method Analytical theory of ridge regression with and without random projections.
result Observations and predictions align with empirical data on machine learning bias.
Examines fairness in ML for health, highlighting its importance and challenges.
problem Ensuring fairness in ML models for health to prevent health disparities.
method Reviews fairness notions in ML for health, including group, individual, and causal-based approaches.
result Discusses the importance and challenges of fairness in health-focused ML applications.
The paper addresses bias amplification in prediction and decision-making using causal analysis.
problem Bias amplification in automated systems, especially after thresholding.
method Introduces margin complement and causal decomposition of prediction disparities.
result Disparity in predictor Y ^ \widehat Y Y can be decomposed into causal influences of X X X on S S S and M M M . Machine learning models (e.g., speech recognizers) are usually trained to minimize average loss, which results in representation disparity---minority groups (e.g., non-native speakers) contribute less to the training objective and thus tend to suffer higher loss. Worse, as model accuracy affects user retention, a minor…
Language is increasingly being used to define rich visual recognition problems with supporting image collections sourced from the web. Structured prediction models are used in these tasks to take advantage of correlations between co-occurring labels and visual input but risk inadvertently encoding social biases found i…
Improves privacy amplification by shuffling for differential privacy.
problem Enhancing privacy guarantees in systems with anonymous data contributions.
method Theoretical and numerical analysis of Rényi differential privacy parameters and privacy amplification by shuffling.
result First asymptotically optimal analysis of Rényi differential privacy parameters for shuffled outputs.
Advantage amplification helps RL in slow-evolving latent-state environments.
problem Challenges in reinforcement learning for long-horizon latent-state environments.
method Temporal abstraction and aggregation methods to overcome belief state error and small action advantage.
result Proven advantage amplification in settings with slowly evolving latent states.
Mitigates gender bias amplification in model predictions.
problem Gender bias amplification in model predictions.
method Posterior regularization to mitigate bias.
result Almost removes gender bias amplification in model predictions.
Gradient amplification boosts deep learning model performance without increasing training time.
problem Vanishing gradients in deep neural networks.
method Gradient amplification approach to prevent vanishing gradients and training strategy to enable/disable across epochs.
result Improves performance of deep learning models with reduced training time.
Privacy is enhanced by synthetic data release even with unlimited data.
problem Improving privacy guarantees for synthetic data release.
method Analyzing a bounded-parameter assumption to show privacy amplification persists with unlimited synthetic records.
result Privacy amplification is possible even with an unbounded number of synthetic records.
Iterated Amplification uses subproblem solutions to build training signals for complex tasks.
problem Learning complex tasks when humans can't directly evaluate performance.
method Progressively builds training signal by combining solutions to easier subproblems.
result Efficiently learns complex behaviors in algorithmic environments.
Paper improves privacy amplification by subsampling with a general method.
problem Ensuring privacy guarantees with subsampled data.
method General method leveraging divergence characterization of differential privacy.
result Recovery and improvement of prior analyses, derivation of lower bounds, and new instances.
Privacy amplification improved through contraction coefficients and E γ E_γ E γ -divergence.
problem Improving privacy guarantees in iterative algorithms.
method Using contraction coefficients derived from E γ E_γ E γ -divergence to determine differential privacy parameters. result Tighter bounds on differential privacy parameters of iterative algorithms.
New method amplifies privacy in decentralized learning without centralized communication.
problem Privacy amplification in decentralized federated learning.
method Random check-in protocol for DP-SGD in FL.
result Privacy/accuracy trade-offs similar to subsampling/shuffling, but without server-initiated communication.
The paper explores how mixing and diffusion mechanisms can enhance privacy in data processing.
problem Enhancing privacy guarantees of data mechanisms through post-processing.
method The study uses Markov operators and coupling arguments to analyze privacy amplification.
result The introduction of a new family of diffusion-based mechanisms that are closed under post-processing.
The paper studies and mitigates accuracy disparity in regression models.
problem Accuracy disparity between different demographic subgroups in high-stakes domains.
method Error decomposition theorem and distribution alignment algorithm.
result The proposed algorithm effectively mitigates accuracy disparity while maintaining predictive power.
Structured subsampling improves privacy in deep time series forecasting.
problem Incompatible privacy guarantees with time series forecasting.
method Structured subsampling of sequential data for privacy amplification.
result Structured subsampling enables training with strong privacy guarantees.
Study shows unequal success of membership inference attacks across different groups.
problem Unequal success of membership inference attacks across different groups.
method Established conditions for preventing MIAs and derived connections to fairness and differential privacy.
result Estimating disparate vulnerability to MIAs can lead to overestimation; suitable attacks and statistical framework provided.
The paper offers methods for testing disparate impact using confidence intervals.
problem Testing for disparate impact in machine learning.
method Asymptotic distribution of indexes and use of confidence intervals.
result The importance of using confidence intervals over single values in testing disparate impact.
Develops methods for fair classification under linear disparity constraints.
problem Disparate impacts of machine learning algorithms on protected groups.
method Bayes-optimal fair classification methods via pre-, in-, and post-processing.
result Explicit forms of Bayes-optimal fair classifiers under linear disparity measures.
Following related work in law and policy, two notions of disparity have come to shape the study of fairness in algorithmic decision-making. Algorithms exhibit treatment disparity if they formally treat members of protected subgroups differently; algorithms exhibit impact disparity when outcomes differ across subgroups,…
Study decomposes racial healthcare disparities via shifts in mediator distributions.
problem Racial disparities in healthcare expenditures and their underlying drivers.
method Framework decomposing disparities into mediator distribution shifts and residual components, using MEPS data.
result Substantial disparities persist even when mediators are equalized, suggesting unmeasured or structural factors.
Study shows explanation disparities in machine learning models are influenced by data and model properties.
problem Disparities in post-hoc machine learning explanation methods across race and gender.
method Simulations and experiments on a real-world dataset to assess challenges to explanation disparities.
result Increased covariate shift, concept shift, and omission of covariates increase explanation disparities, especially for neural network models.
Bayesian model identifies health disparities in disease progression.
problem Health disparities bias disease progression models.
method Interpretable Bayesian model accounting for three disparities.
result Model identifies and corrects for health disparities.
New privacy amplification technique for iterative algorithms.
problem Ensuring privacy in iterative learning algorithms.
method Demonstrates privacy amplification for contractive iterations without releasing intermediate results.
result Strong privacy amplification achieved with minimal intermediate releases.
Study shows label errors impact model disparity metrics, proposing mitigation methods.
problem Impact of label errors on model disparity metrics.
method Empirical study, characterizing label error effects; proposing estimation and relabeling methods.
result Label errors significantly affect model disparity metrics, particularly for minority groups.
New method for privacy amplification without sampling for matrix factorization.
problem Privacy amplification for differentially private model training with matrix factorization.
method Sampling-free bounds based on Rényi divergence and conditional composition.
result Stronger privacy guarantees for small ε, applicable to various matrices.
Unified framework for subsampling mechanisms with tighter privacy guarantees.
problem Improving privacy in machine learning models through subsampling.
method Conditional optimal transport for deriving mechanism-specific subsampling guarantees.
result Tighter privacy bounds for subsampled mechanisms compared to traditional methods.
Proposes a method to quantify and decompose disparity in ML models, separating exempt and non-exempt components.
problem Quantifying disparity in ML models, especially when certain features are exempted due to their critical importance.
method Information-theoretic decomposition into exempt and non-exempt components, satisfying desirable properties.
result Proposes a measure of non-exempt disparity that satisfies all desirable properties, and shows impossibility results for observational measures.
End-to-end framework learns precise disparity for activity recognition.
problem Precise portrayal of intraclass disparity in activity recognition.
method Knowledge-directed adversarial learning framework with two competitive encoding distributions.
result Robust and generalizable performance on HAR benchmark datasets.
Paper explores fair classification with bounded disparity using finite datasets.
problem Ensuring fairness in binary classification with protected groups.
method Minimax optimal approach with fairness constraints and demographic disparity control.
result Proposes FairBayes-DDP+ method that achieves minimax lower bound on fairness-aware excess risk.
New sampling scheme improves privacy in DP-SGD without sacrificing utility.
problem Suboptimal privacy amplification due to participation variance in Poisson subsampling.
method Balanced Iteration Subsampling (BIS) with structured randomness.
result BIS achieves stronger privacy amplification than Poisson subsampling and is optimal at both extremes of noise spectrum.
The paper shows how to amplify small datasets to look like they came from a known distribution.
problem How to increase dataset size when learning from an unknown distribution is impossible.
method Develops amplification procedures to output larger sets of samples that mimic the original distribution.
result Valid amplification procedures exist even when the input dataset is significantly smaller than needed for learning.
FLAME improves privacy in federated learning without trusted parties.
problem Ensuring privacy in federated learning without trusted parties.
method FLAME uses the shuffle model of differential privacy to achieve better accuracy and privacy.
result FLAME protocols improve testing accuracy by 60.7% compared to local model FL.
This study quantifies systemic importance in global banks using a continuous framework that amplifies localized shocks.
problem Analyzing financial contagion and systemic risk in global banks.
method Developed a continuous framework incorporating geographic proximity and interbank network linkages, using a master equation and Feynman-Kac representation.
result The amplification factor correctly identifies systemically important institutions and predicts crisis outcomes.
Sharp pseudospectral bounds prevent transient amplification in coupled gradient descent.
problem Transient amplification in coupled gradient descent systems.
method Developed a sharp pseudospectral theory for block-triangular Jacobians, proving Kreiss constant bounds and matching minimax lower bounds.
result Obtained a finite-horizon iteration-complexity bound of O ( K ( J ) 2 log ( 1 / δ ) ) O(K(J)^2 \log(1/δ)) O ( K ( J ) 2 log ( 1/ δ )) for stochastic coupled descent. Missing data enhances privacy in differential privacy.
problem Privacy preservation in datasets with missing values.
method Formalized missing data as a privacy amplification mechanism within differential privacy.
result Incomplete data can yield privacy amplification for differentially private algorithms.
The study explains how market-makers' hedging affects stock volatility during gamma-squeeze events.
problem Endogenous volatility amplification in option markets during gamma-squeeze events.
method Developed a theoretical framework linking hedging behavior and market turbulence, incorporating beta-normalized volatility.
result Low-beta stocks amplify volatility more during gamma-squeeze events.
Automated data-driven decision making systems are increasingly being used to assist, or even replace humans in many settings. These systems function by learning from historical decisions, often taken by humans. In order to maximize the utility of these systems (or, classifiers), their training involves minimizing the e…
Unified approach amplifies data for distribution property estimation.
problem Estimating properties of discrete distributions efficiently.
method Unified, linear-time, competitive estimator using just 2n samples.
result Achieves performance of empirical estimator with n√log n samples using only 2n samples.
The paper examines how adversarial robustness affects accuracy disparity across different classes.
problem Understanding the impact of adversarial robustness on accuracy disparity across different classes.
method Linear classifiers under a Gaussian mixture model, decomposing the impact into inherent and imbalance effects.
result Adversarial robustness consistently degrades standard accuracy in balanced classes, but the class imbalance ratio plays a different role in accuracy disparity.
Most of the econometric and econophysics models have been borrowed from the statistical physics, and as a cosequence, a new interdisciplinary science called econophysics has emerged. In this paper we planned to extend the analogy between different economic processes or phenomena and processes and phenomena from differe…
The paper addresses fairness in machine learning by adjusting input distributions.
problem Reducing disparate impact in machine learning models over different groups.
method The approach involves learning a counterfactual distribution to adjust input variables for disadvantaged groups.
result The method can reduce disparate impact without training a new model.
Synthetic data can amplify privacy in linear regression models.
problem Understanding how synthetic data can enhance privacy in linear regression models.
method Investigated through the linear regression framework, analyzing synthetic data generated from random inputs and controlled inputs.
result Releasing a limited number of synthetic data points amplifies privacy beyond the model's inherent guarantees when inputs are random, but not when inputs are controlled by an adversary.
Paper tackles fairness in CCA by minimizing correlation disparity error.
problem Fairness issues in CCA.
method Framework to minimize correlation disparity error in CCA.
result Reduces correlation disparity error without sacrificing CCA accuracy.