CGLGMay 19, 2021

Obstructing Classification via Projection

arXiv:2105.09047v16 citations
Originality Incremental advance
AI Analysis

This addresses bias removal in machine learning for datasets with sensitive attributes, but it is incremental as it builds on geometric theorems and focuses on theoretical conditions.

The paper tackles the problem of removing bias from data by obstructing classification of a specific property via projection to a lower-dimensional space, showing that under certain conditions, a projection to R^(d-1) can eliminate linear separability for one property while preserving it for others, and connects the number of projections needed to Helly-type properties for more complex separabilities.

Machine learning and data mining techniques are effective tools to classify large amounts of data. But they tend to preserve any inherent bias in the data, for example, with regards to gender or race. Removing such bias from data or the learned representations is quite challenging. In this paper we study a geometric problem which models a possible approach for bias removal. Our input is a set of points P in Euclidean space R^d and each point is labeled with k binary-valued properties. A priori we assume that it is "easy" to classify the data according to each property. Our goal is to obstruct the classification according to one property by a suitable projection to a lower-dimensional Euclidean space R^m (m < d), while classification according to all other properties remains easy. What it means for classification to be easy depends on the classification model used. We first consider classification by linear separability as employed by support vector machines. We use Kirchberger's Theorem to show that, under certain conditions, a simple projection to R^(d-1) suffices to eliminate the linear separability of one of the properties whilst maintaining the linear separability of the other properties. We also study the problem of maximizing the linear "inseparability" of the chosen property. Second, we consider more complex forms of separability and prove a connection between the number of projections required to obstruct classification and the Helly-type properties of such separabilities.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes