paper-with-me

홈 › Papers

A Differentiable Distance Approximation for Fairer Image Classification

2022-10-09 · Nicholas Rosa, Tom Drummond, Mehrtash Harandi

Naively trained AI models can be heavily biased. This can be particularly problematic when the biases involve legally or morally protected attributes such as ethnic background, age or gender. Existing solutions to this problem come at the cost of extra computation, unstable adversarial optimisation or have losses on the feature space structure that are disconnected from fairness measures and only loosely generalise to fairness. In this work we propose a differentiable approximation of the variance of demographics, a metric that can be used to measure the bias, or unfairness, in an AI model. Our approximation can be optimised alongside the regular training objective which eliminates the need for any extra models during training and directly improves the fairness of the regularised models. We demonstrate that our approach improves the fairness of AI models in varied task and dataset scenarios, whilst still maintaining a high level of classification accuracy. Code is available at https://bitbucket.org/nelliottrosa/base_fairness.

📄 PDF Abstract BibTeX arXiv:2210.04369

Code (1)

https://bitbucket.org/nelliottrosa/base_fairness 공식 구현 pytorch

Tasks

ClassificationFairnessimage-classificationImage Classification

Similar Papers 제목 키워드 기반

Differentiable Earth Mover's Distance for Data Compression at the High-Luminosity LHC

2023-06-07 · Rohan Shenoy, Javier Duarte, Christian Herwig, James Hirschauer 외

The Earth mover's distance (EMD) is a useful metric for image recognition and classification, but its usual implementations are not differentiable or too slow to be used as a loss function for training other algorithms v…

Data Compression

Feature-based Individual Fairness in k-Clustering

2021-09-09 · Debajyoti Kar, Mert Kosan, Debmalya Mandal, Sourav Medya 외

Ensuring fairness in machine learning algorithms is a challenging and essential task. We consider the problem of clustering a set of points while satisfying fairness constraints. While there have been several attempts to…

ClusteringFairness

Improving Discrete Latent Representations With Differentiable Approximation Bridges

2019-05-09 · Jason Ramapuram, Russ Webb

Modern neural network training relies on piece-wise (sub-)differentiable functions in order to use backpropagation to update model parameters. In this work, we introduce a novel method to allow simple non-differentiable …

Density EstimationGeneral Classificationimage-classificationImage Classification+2

Approximating DTW with a convolutional neural network on EEG data

2023-01-30 · Hugo Lerogeron, Romain Picot-Clemente, Alain Rakotomamonjy, Laurent Heutte

Dynamic Time Wrapping (DTW) is a widely used algorithm for measuring similarities between two time series. It is especially valuable in a wide variety of applications, such as clustering, anomaly detection, classificatio…

Anomaly DetectionComputational EfficiencyEEGElectroencephalogram (EEG)+5

Soft edit distance for differentiable comparison of symbolic sequences

2019-04-29 · Evgenii Ofitserov, Vasily Tsvetkov, Vadim Nazarov

Edit distance, also known as Levenshtein distance, is an essential way to compare two strings that proved to be particularly useful in the analysis of genetic sequences and natural language processing. However, edit dist…

Clustering