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,695 papers · 148 categories

Trend · papers per month

8.8%17.6%26.4%35.2% · Jun 202019922001200920172026
48 results for algorithmic discrimination

Study data biases to predict algorithmic discrimination, developing a Data Bias Profile.

problem Data biases contribute to algorithmic discrimination, but their impact is understudied.
method Analyzed three common data biases across various datasets and models, developing a Data Bias Profile.
result Combination of proxies and label bias can lead to more significant discrimination than underrepresentation alone.

New algorithms improve robust estimation in contaminated Gaussian models.

problem Simultaneous estimation of location and variance matrix in contaminated Gaussian models.
method Tractable adversarial algorithms with spline discriminators for robust estimation.
result Achieve minimax optimal rates or near-optimal rates under Huber's contamination model.

Proposes a test to ensure predictive algorithms predict intended outcomes better than unintended ones.

problem Unintended model behavior leading to prediction of unintended outcomes.
method Falsification framework using nonparametric hypothesis testing to compare prediction losses across outcomes.
result Establishes discriminant validity with respect to gender but not race in an admissions setting.

Discriminator guidance improves autoregressive diffusion models for generating molecular graphs.

problem Improving the accuracy of autoregressive diffusion models for generating molecular graphs.
method Deriving ways to use a discriminator with a pretrained generative model in the discrete case, including optimal and sub-optimal scenarios.
result Using a discriminator can correct pretrained models and improve exact sampling from the data distribution.

Generative Adversarial Networks (GANs) can successfully approximate a probability distribution and produce realistic samples. However, open questions such as sufficient convergence conditions and mode collapse still persist. In this paper, we build on existing work in the area by proposing a novel framework for trainin…

2018-07-31abs ↗pdf ↗

Feature learning forms the cornerstone for tackling challenging learning problems in domains such as speech, computer vision and natural language processing. In this paper, we consider a novel class of matrix and tensor-valued features, which can be pre-trained using unlabeled samples. We present efficient algorithms f…

2014-12-19abs ↗pdf ↗

We study the interplay between sequential decision making and avoiding discrimination against protected groups, when examples arrive online and do not follow distributional assumptions. We consider the most basic extension of classical online learning: "Given a class of predictors that are individually non-discriminato…

2018-10-28abs ↗pdf ↗

New robust algorithms improve learning with feature feedback.

problem Interactive learning with discriminative feature feedback.
method Developed new robust interactive learning algorithms with improved mistake bounds.
result Achieved significantly lower mistake bounds in adversarial and stochastic settings.

For mass spectra acquired from cancer patients by MALDI or SELDI techniques, automated discrimination between cancer types or stages has often been implemented by machine learnings. These techniques typically generate "black-box" classifiers, which are difficult to interpret biologically. We develop new and efficient s…

2014-10-13abs ↗pdf ↗

A new algorithm improves Wasserstein discriminant analysis for better data classification.

problem Improving data classification in machine learning.
method Bi-level nonlinear eigenvector algorithm (WDA-nepv) for optimal transport and trace ratio optimizations.
result WDA-nepv enhances classification accuracy and scalability.

The paper integrates statistical significance and discriminative power in pattern discovery.

problem Discovering actionable patterns that meet rigorous statistical significance and discriminative power criteria.
method Integrates statistical significance and discriminative power criteria into state-of-the-art algorithms.
result Improves discriminative power and statistical significance of discovered patterns without quality deterioration.

In recent years, kernel-based sparse coding (K-SRC) has received particular attention due to its efficient representation of nonlinear data structures in the feature space. Nevertheless, the existing K-SRC methods suffer from the lack of consistency between their training and test optimization frameworks. In this work,…

2019-03-12abs ↗pdf ↗

Non-discrimination is a recognized objective in algorithmic decision making. In this paper, we introduce a novel probabilistic formulation of data pre-processing for reducing discrimination. We propose a convex optimization for learning a data transformation with three goals: controlling discrimination, limiting distor…

2017-04-11abs ↗pdf ↗

Discriminative pattern mining is an essential task of data mining. This task aims to discover patterns which occur more frequently in a class than other classes in a class-labeled dataset. This type of patterns is valuable in various domains such as bioinformatics, data classification. In this paper, we propose a novel…

2019-06-02abs ↗pdf ↗

Generative adversarial nets (GANs) are a promising technique for modeling a distribution from samples. It is however well known that GAN training suffers from instability due to the nature of its maximin formulation. In this paper, we explore ways to tackle the instability problem by dualizing the discriminator. We sta…

2017-06-19abs ↗pdf ↗

Sparse GEMINI selects relevant features for clustering without assumptions.

problem Feature selection in clustering with relevant clusters and variables.
method Discriminative clustering model maximizing GEMINI with l1 penalty.
result Sparse GEMINI selects relevant subsets of variables without prior hypotheses.

Improved LDA method for better classification and dimensionality reduction.

problem Improving linear discriminant analysis for better classification performance.
method Integrates spectrally-corrected covariance matrix and regularized discriminant analysis.
result SRLDA has a linear classification global optimal solution under spiked model assumption.

Recent works propose using the discriminator of a GAN to filter out unrealistic samples of the generator. We generalize these ideas by introducing the implicit Metropolis-Hastings algorithm. For any implicit probabilistic model and a target distribution represented by a set of samples, implicit Metropolis-Hastings oper…

2019-06-09abs ↗pdf ↗

Mining discriminative features for graph data has attracted much attention in recent years due to its important role in constructing graph classifiers, generating graph indices, etc. Most measurement of interestingness of discriminative subgraph features are defined on certain graphs, where the structure of graph objec…

2013-01-28abs ↗pdf ↗

A new method quantifies feature-map discriminativeness for efficient pruning of deep neural networks.

problem Efficiently pruning deep neural networks to reduce computation while maintaining accuracy.
method Presented a novel mathematical formulation (Discriminant Information, DI) to quantify feature-map discriminativeness, enabling efficient pruning and intra-layer mixed precision quantization.
result Our pruned ResNet50 achieves 44% FLOPs reduction without any Top-1 accuracy loss.

Naive Bayes can be used as a discriminative classifier, matching the definition of logistic regression.

problem The definition of generative and discriminative classifiers.
method Comparing Naive Bayes and logistic regression, showing they can be used in either generative or discriminative ways.
result Naive Bayes can be used as a discriminative classifier.

A new method removes policy optimization in adversarial imitation learning.

problem Adversarial imitation learning's delicate alternated optimization.
method Explicitly condition discriminator on two policies, solving generator's optimization problem directly.
result Simpler approach competitive to prevalent methods.

A new classification rule for FDA improves classification performance by accounting for unequal covariance matrices.

problem Unequal covariance matrices in practical situations affect the performance of FDA and its variants.
method Proposes a novel classification rule for FDA that accounts for unequal covariance matrices, applicable to many FDA variants.
result The new classification rule improves classification performance compared to original FDA and variants.

We present a novel approach to the formulation and the resolution of sparse Linear Discriminant Analysis (LDA). Our proposal, is based on penalized Optimal Scoring. It has an exact equivalence with penalized LDA, contrary to the multi-class approaches based on the regression of class indicator that have been proposed s…

2012-06-27abs ↗pdf ↗

SEDA improves RLDA for high-dimensional data.

problem Inconsistent performance of RLDA in high-dimensional scenarios.
method Developed a non-asymptotic approximation of misclassification rate, derived new theoretical results on eigenvectors, and proposed SEDA algorithm.
result SEDA achieves higher classification accuracy and dimensionality reduction compared to existing LDA methods.

We present a two-stage approach for learning dictionaries for object classification tasks based on the principle of information maximization. The proposed method seeks a dictionary that is compact, discriminative, and generative. In the first stage, dictionary atoms are selected from an initial dictionary by maximizing…

2012-08-17abs ↗pdf ↗

New method reduces indirect discrimination in insurance risk models.

problem Indirect discrimination in insurance risk models using machine learning.
method Mathematical concepts of linear algebra to reduce indirect discrimination.
result Demonstrated promising performance in a concrete case of risk selection in life insurance.

The paper explores fairness metrics in automated decision-making and their limitations.

problem Discrimination in automated resource allocation decisions.
method Analysis of fairness metrics and distributive justice principles.
result Prominent fairness metrics fail to address egalitarian and sufficiency concerns in resource allocation.

Paper proposes a method to identify and treat latent discriminating features in machine learning models.

problem Fairness issues in machine learning models trained on historical data containing sensitive attributes.
method A novel algorithm that identifies and treats latent discriminating features, agnostic of the learning algorithm.
result Experimental results show near-ideal fairness measurement compared to other methods.

A new algorithm balances fairness in clustering to avoid discrimination.

problem Clustering data can unfairly discriminate against different demographic groups.
method Designing a stochastic alternating balance fair k-means algorithm (SAfairKM) that alternates between k-means updates and group swap updates.
result The algorithm efficiently constructs well-spread and high-quality Pareto fronts on synthetic and real datasets.