Neutralized Empirical Risk Minimization with Generalization Neutrality Bound

11/06/2015
by   Kazuto Fukuchi, et al.
0

Currently, machine learning plays an important role in the lives and individual activities of numerous people. Accordingly, it has become necessary to design machine learning algorithms to ensure that discrimination, biased views, or unfair treatment do not result from decision making or predictions made via machine learning. In this work, we introduce a novel empirical risk minimization (ERM) framework for supervised learning, neutralized ERM (NERM) that ensures that any classifiers obtained can be guaranteed to be neutral with respect to a viewpoint hypothesis. More specifically, given a viewpoint hypothesis, NERM works to find a target hypothesis that minimizes the empirical risk while simultaneously identifying a target hypothesis that is neutral to the viewpoint hypothesis. Within the NERM framework, we derive a theoretical bound on empirical and generalization neutrality risks. Furthermore, as a realization of NERM with linear classification, we derive a max-margin algorithm, neutral support vector machine (SVM). Experimental results show that our neutral SVM shows improved classification performance in real datasets without sacrificing the neutrality guarantee.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/03/2014

Support Vector Machine Model for Currency Crisis Discrimination

Support Vector Machine (SVM) is powerful classification technique based ...
research
06/21/2021

Benign Overfitting in Multiclass Classification: All Roads Lead to Interpolation

The growing literature on "benign overfitting" in overparameterized mode...
research
04/20/2015

F-SVM: Combination of Feature Transformation and SVM Learning via Convex Relaxation

The generalization error bound of support vector machine (SVM) depends o...
research
05/18/2020

Information-theoretic analysis for transfer learning

Transfer learning, or domain adaptation, is concerned with machine learn...
research
05/07/2018

Computing the Shattering Coefficient of Supervised Learning Algorithms

The Statistical Learning Theory (SLT) provides the theoretical guarantee...
research
07/22/2015

An Empirical Comparison of SVM and Some Supervised Learning Algorithms for Vowel recognition

In this article, we conduct a study on the performance of some supervise...
research
04/10/2017

On the Fine-Grained Complexity of Empirical Risk Minimization: Kernel Methods and Neural Networks

Empirical risk minimization (ERM) is ubiquitous in machine learning and ...

Please sign up or login with your details

Forgot password? Click here to reset