Classification via score-based generative modelling

• URL: http://arxiv.org/abs/2207.11091v1
• Date: Fri, 22 Jul 2022 13:59:43 GMT
• Title: Classification via score-based generative modelling
• Authors: Yongchao Huang
• Abstract summary: We investigated the application of score-based learning in discriminative and generative classification settings. We performed experiments on simulated and real-world datasets, demonstrating its effectiveness in achieving and improving binary classification performance.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: In this work, we investigated the application of score-based gradient learning in discriminative and generative classification settings. Score function can be used to characterize data distribution as an alternative to density. It can be efficiently learned via score matching, and used to flexibly generate credible samples to enhance discriminative classification quality, to recover density and to build generative classifiers. We analysed the decision theories involving score-based representations, and performed experiments on simulated and real-world datasets, demonstrating its effectiveness in achieving and improving binary classification performance, and robustness to perturbations, particularly in high dimensions and imbalanced situations.

Related papers

• Latent Enhancing AutoEncoder for Occluded Image Classification [2.6217304977339473]
  We introduce LEARN: Latent Enhancing feAture Reconstruction Network. An auto-encoder based network that can be incorporated into the classification model before its head. On the OccludedPASCAL3D+ dataset, the proposed LEARN outperforms standard classification models.
  arXiv  Detail & Related papers  (2024-02-10T12:22:31Z)
• Variational Classification [51.2541371924591]
  We derive a variational objective to train the model, analogous to the evidence lower bound (ELBO) used to train variational auto-encoders. Treating inputs to the softmax layer as samples of a latent variable, our abstracted perspective reveals a potential inconsistency. We induce a chosen latent distribution, instead of the implicit assumption found in a standard softmax layer.
  arXiv  Detail & Related papers  (2023-05-17T17:47:19Z)
• Diffusing Gaussian Mixtures for Generating Categorical Data [21.43283907118157]
  We propose a generative model for categorical data based on diffusion models with a focus on high-quality sample generation. Our method of evaluation highlights the capabilities and limitations of different generative models for generating categorical data.
  arXiv  Detail & Related papers  (2023-03-08T14:55:32Z)
• Boosting Differentiable Causal Discovery via Adaptive Sample Reweighting [62.23057729112182]
  Differentiable score-based causal discovery methods learn a directed acyclic graph from observational data. We propose a model-agnostic framework to boost causal discovery performance by dynamically learning the adaptive weights for the Reweighted Score function, ReScore.
  arXiv  Detail & Related papers  (2023-03-06T14:49:59Z)
• Generative Robust Classification [3.4773470589069477]
  Training adversarially robust discriminative (i.e., softmax) classification has been the dominant approach to robust classification. We investigate using adversarial training (AT)-based generative models. We find it straightforward to apply advanced data augmentation to achieve better robustness in our approach.
  arXiv  Detail & Related papers  (2022-12-14T15:33:11Z)
• When in Doubt: Improving Classification Performance with Alternating Normalization [57.39356691967766]
  We introduce Classification with Alternating Normalization (CAN), a non-parametric post-processing step for classification. CAN improves classification accuracy for challenging examples by re-adjusting their predicted class probability distribution. We empirically demonstrate its effectiveness across a diverse set of classification tasks.
  arXiv  Detail & Related papers  (2021-09-28T02:55:42Z)
• Discriminative Attribution from Counterfactuals [64.94009515033984]
  We present a method for neural network interpretability by combining feature attribution with counterfactual explanations. We show that this method can be used to quantitatively evaluate the performance of feature attribution methods in an objective manner.
  arXiv  Detail & Related papers  (2021-09-28T00:53:34Z)
• No Fear of Heterogeneity: Classifier Calibration for Federated Learning with Non-IID Data [78.69828864672978]
  A central challenge in training classification models in the real-world federated system is learning with non-IID data. We propose a novel and simple algorithm called Virtual Representations (CCVR), which adjusts the classifier using virtual representations sampled from an approximated ssian mixture model. Experimental results demonstrate that CCVR state-of-the-art performance on popular federated learning benchmarks including CIFAR-10, CIFAR-100, and CINIC-10.
  arXiv  Detail & Related papers  (2021-06-09T12:02:29Z)
• On Positive-Unlabeled Classification in GAN [130.43248168149432]
  This paper defines a positive and unlabeled classification problem for standard GANs. It then leads to a novel technique to stabilize the training of the discriminator in GANs.
  arXiv  Detail & Related papers  (2020-02-04T05:59:37Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.