资源论文Fast Classification Rates for High-dimensional Gaussian Generative Models

Fast Classification Rates for High-dimensional Gaussian Generative Models

2020-02-04 | |  76 |   39 |   0

Abstract 

We consider the problem of binary classification when the covariates conditioned on the each of the response values follow multivariate Gaussian distributions. We focus on the setting where the covariance matrices for the two conditional distributions are the same. The corresponding generative model classifier, derived via the Bayes rule, also called Linear Discriminant Analysis, has been shown to behave poorly in high-dimensional settings. We present a novel analysis of the classification error of any linear discriminant approach given conditional Gaussian models. This allows us to compare the generative model classifier, other recently proposed discriminative approaches that directly learn the discriminant function, and then finally logistic regression which is another classical discriminative model classifier. As we show, under a natural sparsity assumption, and letting s denote the sparsity of the Bayes classifier, p the number of covariates, and n the number of samples, the simple (image.png -regularized) logistic regression classifier achieves the fast misclassification error rates of image.png , which is much better than the other approaches, which are either  inconsistent under high-dimensional settings, or achieve a slower rate of image.png  .

上一篇:Sampling from Probabilistic Submodular Models

下一篇:Empirical Localization of Homogeneous Divergences on Discrete Sample Spaces

用户评价
全部评价

热门资源

  • The Variational S...

    Unlike traditional images which do not offer in...

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • Learning to learn...

    The move from hand-designed features to learned...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...