• Corpus ID: 63168474

# What Can I Do Now? Guiding Users in a World of Automated Decisions

@article{Gall2017WhatCI,
title={What Can I Do Now? Guiding Users in a World of Automated Decisions},
author={Matthias Gall{\'e}},
journal={arXiv: Machine Learning},
year={2017}
}
• Matthias Gallé
• Published 13 January 2017
• Computer Science
• arXiv: Machine Learning
More and more processes governing our lives use in some part an automatic decision step, where -- based on a feature vector derived from an applicant -- an algorithm has the decision power over the final outcome. Here we present a simple idea which gives some of the power back to the applicant by providing her with alternatives which would make the decision algorithm decide differently. It is based on a formalization reminiscent of methods used for evasion attacks, and consists in enumerating…

## References

SHOWING 1-10 OF 15 REFERENCES

• Computer Science
• 2002
A Selective Bayesian classifier that simply uses only those features that C4.5 would use in its decision tree when learning a small example of a training set, a combination of the two different natures of classifiers is described.
• Computer Science
ICML
• 2016
A novel algorithm for systematically computing evasions for tree ensembles such as boosted trees and random forests and harden a boosted tree model without loss of predictive accuracy by augmenting the training set of each boosting round with evading instances, a technique the authors call adversarial boosting.
• Computer Science
ECML/PKDD
• 2011
This work proposes to employ "oblique" random forests (oRF) built from multivariate trees which explicitly learn optimal split directions at internal nodes using linear discriminative models, rather than using random coefficients as the original oRF.
• Computer Science
• 2001
The main idea is to use techniques from the field of information theory to select a set of important attributes that can be used to classify tuples and a neural network is trained using these attributes.
Cathy O’Neil’s Weapons of Math Destruction is a timely reminder of the power and perils of predictive algorithms and model-driven decision processes and speaks forcefully to the cultural moment the authors share.
• Computer Science
KDD 2005
• 2005
"Data mining and knowledge discovery is over ten years old, and is now mature enough to begin to make some big plans and to tackle some very difficult problems and challenges" is the theme for this year's KDD Conference.
Tracing the arc of a persons life, ONeil exposes the black box models that shape the authors' future, both as individuals and as a society, in this urgent and necessary book.
• Mathematics, Computer Science
SIAM J. Comput.
• 1977
This paper presents a new efficient algorithm for generating all the maximal independent sets, for which processing time and memory space are bounded by $O(nm\mu)$ and $O (n+m)$, respectively, where n, m, and $\mu$ are the numbers of vertices, edges, and maximalIndependent sets of a graph.
• Computer Science
ArXiv
• 2013
A fast, parallel, maximum clique algorithm for large, sparse graphs that is designed to exploit characteristics of social and information networks and finds that using the core number of a vertex in combination with a good heuristic clique finder efficiently removes the vast majority of the search space.
• Shikha Verma
• Computer Science
Vikalpa: The Journal for Decision Makers
• 2019