Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,742 papers · 148 categories

Trend · papers per month

55109164218 · Jun 202019922001200920172026
48 results for classifier protection

Framework for fair classification with noisy protected attributes and provable guarantees.

problem Fair classification with noisy protected attributes.
method Optimization framework for linear and linear-fractional fairness constraints, handling multiple non-binary attributes.
result Provably fair classifier with minimal accuracy loss, even with large noise.

Paper introduces SPADE method to protect classifiers from OOD and adversarial samples.

problem Protecting classifiers from out-of-distribution and adversarial samples.
method SPADE method based on GEV model in latent space.
result Provable protection against OOD and adversarial samples.

CST detects discrimination by comparing protected and non-protected individuals with a counterfactual.

problem Detecting discrimination in classifiers using legal fairness conditions.
method Operationalizes fairness given the difference using counterfactual reasoning.
result CST uncovers more discrimination cases than traditional situation testing.

Topologically protected vortex knots and links are proposed and proven.

problem Decaying of tangled vortex structures through local reconnections and strand crossings.
method Proposed and proven topologically protected vortex structures using non-Abelian topological vortices.
result Existence of topologically protected Q8Q_8-colored links and classification using the QQ-invariant.

Paper presents a dynamic tail risk protection strategy using ML and econometrics.

problem Tail risk protection in finance with solid mathematical and statistical tools.
method Dynamic tail risk protection strategy using weak classifiers (parametric and non-parametric) to estimate exceedance probability and derive trading signals.
result Ensemble classifier improves generalization and trading performance.

Machine learning (ML) classification is increasingly used in safety-critical systems. Protecting ML classifiers from adversarial examples is crucial. We propose that the main threat is that of an attacker perturbing a confidently classified input to produce a confident misclassification. To protect against this we devi…

2019-09-19abs ↗pdf ↗

A popular methodology for building binary decision-making classifiers in the presence of imperfect information is to first construct a non-binary "scoring" classifier that is calibrated over all protected groups, and then to post-process this score to obtain a binary decision. We study the feasibility of achieving vari…

2018-10-03abs ↗pdf ↗

New framework for fair classification in adversarial settings with provable guarantees.

problem Fairness in classification with adversarial perturbations of protected attributes.
method Optimization framework for learning fair classifiers with provable guarantees.
result Near-tightness of accuracy and fairness guarantees for multiple protected attributes and various hypothesis classes.

Optimizes signal detection in particle physics by decorrelating classifiers.

problem Systematic errors in background models can mislead signal detection.
method Use optimal transport to decorrelate classifiers from protected variables, then apply semiparametric mixture model.
result Decorrelation and signal enrichment improve the stability, robustness, and power of signal detection tests.

TaCo prevents non-linear classifiers from detecting sensitive attributes.

problem Ensuring fairness in NLP models by preventing sensitive attribute detection.
method Targeted Concept Erasure (TaCo) removes sensitive information from final latent representations, even against non-linear classifiers.
result TaCo outperforms state-of-the-art methods in reducing sensitive attribute prediction accuracy while preserving overall task performance.

Most approaches aiming to ensure a model's fairness with respect to a protected attribute (such as gender or race) assume to know the true value of the attribute for every data point. In this paper, we ask to what extent fairness interventions can be effective even when only imperfect information about the protected at…

2019-06-07abs ↗pdf ↗

Vanilla CNNs, as uncalibrated classifiers, suffer from classifying out-of-distribution (OOD) samples nearly as confidently as in-distribution samples. To tackle this challenge, some recent works have demonstrated the gains of leveraging available OOD sets for training end-to-end calibrated CNNs. However, a critical que…

2019-10-18abs ↗pdf ↗

Deep chest X-ray classifiers show bias in predicting diagnoses.

problem Bias in deep learning classifiers predicting diagnoses from chest X-rays.
method Trained convolutional neural networks on multiple public datasets to predict 14 diagnostic labels.
result True positive rates vary significantly among different protected attributes, indicating bias.

We consider the problem of obfuscating sensitive information while preserving utility, and we propose a machine learning approach inspired by the generative adversarial networks paradigm. The idea is to set up two nets: the generator, that tries to produce an optimal obfuscation mechanism to protect the data, and the c…

2019-04-01abs ↗pdf ↗

Classifiers and rating scores are prone to implicitly codifying biases, which may be present in the training data, against protected classes (i.e., age, gender, or race). So it is important to understand how to design classifiers and scores that prevent discrimination in predictions. This paper develops computationally…

2017-10-16abs ↗pdf ↗

Develops methods for fair classification under linear disparity constraints.

problem Disparate impacts of machine learning algorithms on protected groups.
method Bayes-optimal fair classification methods via pre-, in-, and post-processing.
result Explicit forms of Bayes-optimal fair classifiers under linear disparity measures.

A new framework reduces data upload for image classification while protecting user privacy.

problem Data upload limitations and privacy concerns in cloud-based image classification.
method Unsupervised autoencoder training at edge devices, followed by latent vector transmission to server for classifier training.
result The framework reduces communications overhead and protects user data privacy.

We consider the task of training classifiers without labels. We propose a weakly supervised method---adversarial label learning---that trains classifiers to perform well against an adversary that chooses labels for training data. The weak supervision constrains what labels the adversary can choose. The method therefore…

2018-05-22abs ↗pdf ↗

This paper tackles fair Bayes-optimal classifiers under predictive parity, proving their limitations and proposing a new algorithm.

problem Ensuring fair Bayes-optimal classifiers under predictive parity, especially when group performance levels vary widely.
method Proving the limitations of fair Bayes-optimal classifiers under predictive parity and proposing a new adaptive thresholding algorithm, FairBayes-DPP.
result Fair Bayes-optimal classifiers under predictive parity may not hold if group performance levels vary widely, leading to within-group unfairness.

We present FlipTest, a black-box technique for uncovering discrimination in classifiers. FlipTest is motivated by the intuitive question: had an individual been of a different protected status, would the model have treated them differently? Rather than relying on causal information to answer this question, FlipTest lev…

2019-06-21abs ↗pdf ↗

SEP uses checkpoints to protect data from training good models.

problem Protecting data from competitors training high-performance models.
method Forming perturbed examples using model checkpoints' gradients to ensure they are always unrecognized.
result SEP significantly reduces model accuracy when trained on perturbed data, demonstrating its effectiveness.

Real-world applications of machine learning tools in high-stakes domains are often regulated to be fair, in the sense that the predicted target should satisfy some quantitative notion of parity with respect to a protected attribute. However, the exact tradeoff between fairness and accuracy is not entirely clear, even f…

2019-06-19abs ↗pdf ↗

The widespread use of ML-based decision making in domains with high societal impact such as recidivism, job hiring and loan credit has raised a lot of concerns regarding potential discrimination. In particular, in certain cases it has been observed that ML algorithms can provide different decisions based on sensitive a…

2019-09-17abs ↗pdf ↗

privGAN protects synthetic data from membership inference attacks.

problem Membership inference attacks on synthetic data generated by GANs.
method Developed a new GAN architecture (privGAN) that not only generates synthetic data but also defends against membership inference attacks.
result privGAN provides protection against membership inference attacks without significantly compromising downstream performance.

We consider the problem of a neural network being requested to classify images (or other inputs) without making implicit use of a "protected concept", that is a concept that should not play any role in the decision of the network. Typically these concepts include information such as gender or race, or other contextual …

2018-06-16abs ↗pdf ↗

New classifiers ensure fairness by adjusting a base classifier's operating characteristics.

problem Ensuring fairness in binary classification with multiple group constraints.
method Intervening directly on a base classifier's operating characteristics using group-wise ROC convex hulls and post-processing.
result Methods satisfy multiple fairness constraints (DP, EO, PP) with minimal interventions and near-oracle accuracy.

Motivated by settings in which predictive models may be required to be non-discriminatory with respect to certain attributes (such as race), but even collecting the sensitive attribute may be forbidden or restricted, we initiate the study of fair learning under the constraint of differential privacy. We design two lear…

2018-12-06abs ↗pdf ↗

Develops methods to measure and reduce fairness in datasets with limited protected attribute labels.

problem Measuring and reducing fairness in datasets with limited protected attribute labels.
method Proposes methods to estimate fairness metrics and train models to limit fairness violations using probabilistic protected attribute labels.
result Our methods provide tighter bounds on true disparity and effectively reduce fairness violations with lesser fairness-accuracy trade-offs.

A central goal of algorithmic fairness is to reduce bias in automated decision making. An unavoidable tension exists between accuracy gains obtained by using sensitive information (e.g., gender or ethnic group) as part of a statistical model, and any commitment to protect these characteristics. Often, due to biases pre…

2018-10-19abs ↗pdf ↗

Study protects federated learning models from eavesdropping attacks.

problem Protecting client models in federated learning from eavesdropping adversaries.
method Theoretical analysis and numerical experiments examining various factors.
result Theoretical and experimental results show the effectiveness of protection methods.

Fairness audits fail under missing protected labels, especially at zero access.

problem Understanding the reliability of fairness audits with incomplete protected-label data.
method Introduced a seed-calibrated stress test to separate missingness effects from seed-to-seed movement.
result Missing protected labels do not significantly alter fairness mitigation methods, but they can lead to harmful intersectional outcomes.

The paper analyzes how to combine self-protection and self-insurance for risk reduction.

problem Combining self-protection and self-insurance for risk reduction when market insurance is absent.
method The approach uses Value-at-Risk and Tail Value-at-Risk to evaluate residual risk and solves the problem using isoquant geometry based on marginal-balance curves.
result The analysis identifies the conditions under which self-protection and self-insurance behave as substitutes or complements.