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

110220330440 · Jun 202019922001200920172026
48 results for discriminative classification

Paper proposes distributed sparse multicategory discriminant analysis for classification.

problem Sparse multicategory classification with distributed data.
method Convex formulation, distributed setting, invariant discriminant subspace recovery.
result Distributed sparse multicategory linear discriminant analysis performs as good as centralized version after a few rounds of communications.

Proposes improved classification via transfer learning with regularized linear discriminant analysis.

problem High dimensionality and small sample sizes lead to poor classification performance.
method Regularized random-effects linear discriminant analysis, combining ridge estimates from target and source models.
result Explicit derivation of asymptotic weights and classification error rates in high-dimensional settings.

Kernel discriminant analysis uses nonlinear embeddings to improve classification.

problem Limited effectiveness of linear discriminant analysis in capturing nonlinear features.
method Study of nonlinear embeddings in kernel discriminant analysis using polynomial and Gaussian kernels, solving generalized eigenvalue problems.
result Polynomial and Gaussian discriminants capture class differences through population moments and randomized projections.

Smart Bayes integrates generative and discriminative features for improved classification.

problem Improving classification performance by combining generative and discriminative modeling.
method Integrates generative likelihood-ratio features into a logistic-regression-style classifier.
result Often outperforms logistic regression and Naive Bayes in simulations and real data.

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.

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.

A new LDA variant improves multi-label classification performance.

problem Improving multi-label classification performance.
method Saliency-based weights redefine between-class and within-class scatter matrices for multi-label classification.
result The proposed method leads to performance improvements in various multi-label classification problems.

Mitigates bias in text classification by weighting instances.

problem Unintended biases in text classification datasets based on demographic terms.
method Instance weighting to recover non-discrimination distribution.
result Effective mitigation of unintended biases without sacrificing generalization.

Paper proposes a new approach to stabilize GAN training by treating generated data as unlabeled.

problem Traditional GAN training treats generated data as negative, ignoring their potential quality.
method Defines positive and unlabeled classification for GANs, treating generated data as unlabeled.
result PUGAN achieves comparable or better performance than sophisticated discriminator stabilization methods.

Develops MGQDA for multi-group classification with theoretical guarantees and practical applications.

problem Complex multi-group classification problems with nonlinear decision boundaries and group-specific covariance patterns.
method MGQDA, a method based on quadratic discriminant analysis that projects predictors onto a lower-dimensional subspace.
result MGQDA achieves competitive or improved predictive performance compared to existing methods.

A variety of real-world tasks involve the classification of images into pre-determined categories. Designing image classification algorithms that exhibit robustness to acquisition noise and image distortions, particularly when the available training data are insufficient to learn accurate models, is a significant chall…

2016-03-08abs ↗pdf ↗

This paper focuses on the discrimination capacity of aggregation functions: these are the permutation invariant functions used by graph neural networks to combine the features of nodes. Realizing that the most powerful aggregation functions suffer from a dimensionality curse, we consider a restricted setting. In partic…

2019-05-31abs ↗pdf ↗

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 ↗

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 ↗

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.

Improves model classification accuracy in black-box settings.

problem Difficulty in inferring model properties due to limited query access.
method Introduces discriminative factorization to distinguish high-quality queries.
result Probability of chance-level classification decreases exponentially with query budget.

Paper introduces negative margin loss for better few-shot classification accuracy.

problem Improving few-shot classification accuracy with metric learning.
method Introduces negative margin loss and analyzes its impact on feature discriminability.
result Negative margin loss outperforms regular softmax loss on few-shot classification benchmarks.

In this paper, we investigate the multi-variate sequence classification problem from a multi-instance learning perspective. Real-world sequential data commonly show discriminative patterns only at specific time periods. For instance, we can identify a cropland during its growing season, but it looks similar to a barren…

2017-12-19abs ↗pdf ↗

New robust discriminant analysis for non-Gaussian data.

problem Classical discriminant analysis struggles with non-Gaussian distributions and contaminated datasets.
method Each data point follows its own ES distribution with arbitrary scale, leading to robust classification.
result Maximum-likelihood estimation and classification are simple, fast, and robust.

Incorporating feature selection into a classification or regression method often carries a number of advantages. In this paper we formalize feature selection specifically from a discriminative perspective of improving classification/regression accuracy. The feature selection method is developed as an extension to the r…

2013-01-16abs ↗pdf ↗

DFSOS improves sparse discriminant analysis for high-dimensional data.

problem Sparse discriminant analysis in high-dimensional settings with feature selection.
method Deflation-Free Sparse Optimal Scoring (DFSOS) using Bregman iteration and orthogonality-constrained optimization.
result DFSOS achieves comparable or better classification accuracy than deflation-based methods.

Machine learning approaches to multi-label document classification have to date largely relied on discriminative modeling techniques such as support vector machines. A drawback of these approaches is that performance rapidly drops off as the total number of labels and the number of labels per document increase. This pr…

2011-07-13abs ↗pdf ↗

In this note, we point out a basic link between generative adversarial (GA) training and binary classification -- any powerful discriminator essentially computes an (f-)divergence between real and generated samples. The result, repeatedly re-derived in decision theory, has implications for GA Networks (GANs), providing…

2017-09-05abs ↗pdf ↗

Recent studies in the literature have paid much attention to the sparsity in linear classification tasks. One motivation of imposing sparsity assumption on the linear discriminant direction is to rule out the noninformative features, making hardly contribution to the classification problem. Most of those work were focu…

2014-12-26abs ↗pdf ↗

WLDA enhances LDA for missing data, improving classification accuracy and interpretability.

problem Missing data in real-world datasets hinders classification accuracy and interpretability of LDA.
method WLDA incorporates a weight matrix to handle missing data directly, preserving interpretability.
result WLDA significantly outperforms traditional methods in datasets with missing values.

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 detects unknown classes and adapts to extra dimensions in high-dimensional classification.

problem Handling unknown classes and extra variables in high-dimensional classification.
method Dimension-Adaptive Mixture Discriminant Analysis (D-AMDA) using an EM algorithm for model estimation.
result The method can adapt to unknown classes and extra dimensions in high-dimensional data.

Generative Adversarial Networks (GANs) were intuitively and attractively explained under the perspective of game theory, wherein two involving parties are a discriminator and a generator. In this game, the task of the discriminator is to discriminate the real and generated (i.e., fake) data, whilst the task of the gene…

2017-11-06abs ↗pdf ↗

The paper improves classification accuracy by leveraging a shared signal across domains in high-dimensional classification.

problem Improving classification accuracy in high-dimensional data with shared signals across domains.
method Transfer learning for linear discriminant analysis, decomposing mean differences into common and domain-specific components.
result Deterministic limits for transfer performance, leading to optimal weights and corrections for bias.

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.

A hierarchical approach improves classification accuracy in large datasets.

problem Improving classification accuracy in large datasets with high dimensionality.
method Hierarchical subspace learning to scale manifold learning methods.
result Average 5% increase in classification accuracy.