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

Trend · papers per month

63125188250 · Jun 202019922001200920172026
48 results for Discriminative Classifier

New method computes discriminative classifiers from generative models.

problem Discriminative vs generative classifiers are often seen as distinct, but this work shows they can be equivalent.
method General theoretical result showing generative classifiers can be computed discriminatively.
result Bayesian Maximum Posterior classifier from generative models matches discriminative classifier definition.

Discrimination-aware classification is receiving an increasing attention in data science fields. The pre-process methods for constructing a discrimination-free classifier first remove discrimination from the training data, and then learn the classifier from the cleaned data. However, they lack a theoretical guarantee f…

2017-02-28abs ↗pdf ↗

Discriminative classifier for compositional data using hierarchical mixture of Generalized Dirichlet models.

problem Classifying compositional data, especially in spam detection and color space identification.
method Hierarchical mixture of discriminative Generalized Dirichlet classifiers, using variational approximation for parameter learning.
result First time a variational upper-bound for Generalized Dirichlet mixture is proposed in literature.

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.

We show that, for generative classifiers, conditional independence corresponds to linear constraints for the induced discrimination functions. Discrimination functions of undirected Markov network classifiers can thus be characterized by sets of linear constraints. These constraints are represented by a second order fi…

2018-11-12abs ↗pdf ↗

Similarity-based clustering and semi-supervised learning methods separate the data into clusters or classes according to the pairwise similarity between the data, and the pairwise similarity is crucial for their performance. In this paper, we propose a novel discriminative similarity learning framework which learns dis…

2017-09-05abs ↗pdf ↗

A new QDA classifier for high-dimensional data with spiked covariance.

problem Classifying high-dimensional data with distinct covariance matrices.
method Proposes a novel quadratic classification technique with parameters chosen to maximize the fisher-discriminant ratio.
result The proposed classifier outperforms classical R-QDA and requires lower computational complexity.

Nested Cavity Classifier (NCC) is a classification rule that pursues partitioning the feature space, in parallel coordinates, into convex hulls to build decision regions. It is claimed in some literatures that this geometric-based classifier is superior to many others, particularly in higher dimensions. First, we give …

2019-06-23abs ↗pdf ↗

PBN combines generative and discriminative capabilities in a neural network.

problem Combining generative and discriminative capabilities in neural networks.
method Convolutional PBN, sharing FF-NN embodiment, combining generative and discriminative qualities.
result PBN shows excellent qualities from either generative or discriminative viewpoint.

Generative classifiers show surprising human-like performance.

problem Comparing generative and discriminative models for object recognition.
method Built on recent advances in generative modeling to create classifiers and compared them to discriminative models.
result Generative classifiers outperform discriminative models in several key areas, including shape bias and out-of-distribution accuracy.

A new adaptive kNN classifier outperforms Random Forests.

problem Improving classification accuracy using nearest neighbors.
method Finding discriminant subspaces for efficient nearest neighbor classification, leveraging bagging for diversity.
result The proposed method outperforms Random Forests and other nearest neighbors ensembles.

The discriminator from generative adversarial nets (GAN) has been used by researchers as a feature extractor in transfer learning and appeared worked well. However, there are also studies that believe this is the wrong research direction because intuitively the task of the discriminator focuses on separating the real s…

2019-12-02abs ↗pdf ↗

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.

There is a rising interest in studying the robustness of deep neural network classifiers against adversaries, with both advanced attack and defence techniques being actively developed. However, most recent work focuses on discriminative classifiers, which only model the conditional distribution of the labels given the …

2018-02-19abs ↗pdf ↗

A new framework separates classifier calibration and discrimination.

problem Combining reliability and resolution in probabilistic predictions.
method Manokhin Probability Matrix separates reliability and resolution using Spiegelhalter Z-statistic and AUC-ROC.
result Classifiers are categorized into four archetypes: Eagle, Bull, Sloth, and Mole.

We present a growing dimension asymptotic formalism. The perspective in this paper is classification theory and we show that it can accommodate probabilistic networks classifiers, including naive Bayes model and its augmented version. When represented as a Bayesian network these classifiers have an important advantage:…

2012-12-12abs ↗pdf ↗

INK scores improve OOD detection for classifiers.

problem Detecting out-of-distribution inputs for classification models.
method INK scores operate on constrained latent embeddings modeled as a mixture of hyperspherical embeddings, optimizing in modern neural networks.
result INK establishes a new state-of-the-art in OOD detection.

This paper presents a novel kernel-based generative classifier which is defined in a distortion subspace using polynomial series expansion, named Kernel-Distortion (KD) classifier. An iterative kernel selection algorithm is developed to steadily improve classification performance by repeatedly removing and adding kerne…

2016-06-21abs ↗pdf ↗

In practice, the data distribution at test time often differs, to a smaller or larger extent, from that of the original training data. Consequentially, the so-called source classifier, trained on the available labelled data, deteriorates on the test, or target, data. Domain adaptive classifiers aim to combat this probl…

2018-06-21abs ↗pdf ↗

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.

Extends Fisher's Discriminant Analysis for interval-valued data.

problem Classifying entities represented by intervals and histograms.
method Adapts Fisher's Discriminant Analysis using Moore's interval arithmetic and Mallows' distance.
result Discriminant directions for interval-valued data are numerically maximized.

Adaptive classifier optimizes high-dimensional data with spiked covariance structure.

problem Classification of high-dimensional data with spiked covariance structure.
method Adaptive classifier that whitens data, screens features, and applies Fisher linear discriminant.
result The classifier is Bayes optimal under certain conditions and performs well on real and synthetic data.

New method compresses large sample data for faster discriminant analysis.

problem Large sample sizes in discriminant analysis increase computational burden.
method Proposes a new compression approach for reducing training samples.
result Significant computational gains and superior predictive ability compared to random sub-sampling.

The paper revisits discriminative vs. generative classifiers, showing naive Bayes requires fewer samples.

problem Comparing discriminative and generative classifiers in multiclass settings.
method Theoretical analysis and simulations of naive Bayes vs. logistic regression.
result Multiclass naive Bayes requires fewer samples to approach asymptotic error compared to logistic regression.

Representing examples in a way that is compatible with the underlying classifier can greatly enhance the performance of a learning system. In this paper we investigate scalable techniques for inducing discriminative features by taking advantage of simple second order structure in the data. We focus on multiclass classi…

2013-10-07abs ↗pdf ↗

We explore the question of whether the representations learned by classifiers can be used to enhance the quality of generative models. Our conjecture is that labels correspond to characteristics of natural data which are most salient to humans: identity in faces, objects in images, and utterances in speech. We propose …

2016-02-09abs ↗pdf ↗

Machine learning algorithms are increasingly involved in sensitive decision-making process with adversarial implications on individuals. This paper presents mdfa, an approach that identifies the characteristics of the victims of a classifier's discrimination. We measure discrimination as a violation of multi-differenti…

2019-03-18abs ↗pdf ↗

Permutation of Weierstrass points on Veech surfaces in H(2)\mathcal{H}(2) classified by discriminant.

problem Classifying permutations of Weierstrass points on Veech surfaces in H(2)\mathcal{H}(2) based on discriminant.
method Analyzing the permutation group induced by the affine group on Weierstrass points, considering both affine and Dehn multitwists.
result The permutation group is Dih4\mathrm{Dih}_4, Dih5\mathrm{Dih}_5, or Dih6\mathrm{Dih}_6 depending on the discriminant value.

GAN-based semi-supervised learning improves classifier generalization.

problem Improving classifier performance with limited labeled data.
method Theoretical analysis of GAN-SSL, proving equivalence of discriminator optimization and supervised learning, and exploring conditions for perfect discriminator.
result GAN-SSL theoretically outputs a perfect discriminator on both labeled and unlabeled data.

Improved R-QDA classifier performs well in unbalanced data settings.

problem High sensitivity of R-QDA to covariance matrix estimation noise in unbalanced data.
method Proposes an improved R-QDA with two regularization parameters and a modified bias.
result Significantly better classification performance compared to traditional R-QDA.

Discriminative Dictionary Learning (DL) methods have been widely advocated for image classification problems. To further sharpen their discriminative capabilities, most state-of-the-art DL methods have additional constraints included in the learning stages. These various constraints, however, lead to additional computa…

2019-03-07abs ↗pdf ↗

In this paper we formulate a probabilistic model for class-specific discriminant subspace learning. The proposed model can naturally incorporate the multi-modal structure of the negative class, which is neglected by existing class-specific methods. Moreover, it can be directly used to define a class-specific probabilis…

2018-12-14abs ↗pdf ↗

Proposes TFDF to learn transferable and discriminative features for unsupervised domain adaptation.

problem Difficult to induce supervised classifier without labeled data in unsupervised domain adaptation.
method TFDF optimizes transferability and discriminability by aligning distributions and minimizing class confusion.
result TFDF achieves better performance on real-world datasets compared to existing methods.