arXiv (Cornell University) · 2015 · 104 citations · 14 references
ComputingComputer ScienceDiscriminationMachine LearningNon-discriminationCensorshipFairness In Machine LearningOptimization For Machine LearningRepresentation LearningAdversary ModelFair Representation LearningMinimax OptimizationPrivacy-preserving Model TrainingStochastic Gradient Descent
Machine‑learning applications often impose constraints that representations or decisions must not favor a group or reveal identifying information. The authors propose learning flexible representations that reduce an adversary’s ability to infer sensitive variables, thereby addressing discrimination and privacy. They formulate a minimax adversarial objective where a critic predicts the sensitive variable from the representation, and train the representation by alternating stochastic gradient updates to minimize the critic’s performance. The method yields discriminant‑free representations that outperform prior fairness baselines and successfully removes image annotations from unaligned data without prior knowledge of annotation form.
In practice, there are often explicit constraints on what representations or decisions are acceptable in an application of machine learning. For example it may be a legal requirement that a decision must not favour a particular group. Alternatively it can be that that representation of data must not have identifying information. We address these two related issues by learning flexible representations that minimize the capability of an adversarial critic. This adversary is trying to predict the relevant sensitive variable from the representation, and so minimizing the performance of the adversary ensures there is little or no information in the representation about the sensitive variable. We demonstrate this adversarial approach on two problems: making decisions free from discrimination and removing private information from images. We formulate the adversarial model as a minimax problem, and optimize that minimax objective using a stochastic gradient alternate min-max optimizer. We demonstrate the ability to provide discriminant free representations for standard test problems, and compare with previous state of the art methods for fairness, showing statistically significant improvement across most cases. The flexibility of this method is shown via a novel problem: removing annotations from images, from unaligned training examples of annotated and unannotated images, and with no a priori knowledge of the form of annotation provided to the model.
14
Adam: A Method for Stochastic Optimization
Diederik P. Kingma, Jimmy Ba · UvA-DARE (University of Amsterdam) · 2014 · 84.8K citations · Full text
UCI Machine Learning Repository
Arthur Asuncion · Medical Entomology and Zoology · 2007 · 24.4K citations
A theory of learning from different domains
Shai Ben-David, John Blitzer, Koby Crammer et al. · Machine Learning · 2009 · 3.5K citations · Full text
Deep Generative Image Models using a Laplacian Pyramid of Adversarial Networks
Emily Denton, Soumith Chintala, Arthur Szlam et al. · arXiv (Cornell University) · 2015 · 1.7K citations · Full text