Deriving discriminative classifiers from generative models
Elie Azeraf, Emmanuel Monfrini, Wojciech Pieczynski

TL;DR
This paper demonstrates that classifiers traditionally considered generative can also be derived discriminatively from the same models, blurring the distinction between generative and discriminative approaches.
Contribution
It provides a general theoretical framework for deriving discriminative classifiers from generative models, including new extensions of Naive Bayes and Hidden Markov Chains.
Findings
Generative classifiers can be computed discriminatively from the same model.
Theoretical unification of Naive Bayes and Hidden Markov Chain classifiers.
Application of the approach to NLP tasks shows practical benefits.
Abstract
We deal with Bayesian generative and discriminative classifiers. Given a model distribution , with the observation and the target , one computes generative classifiers by firstly considering and then using the Bayes rule to calculate . A discriminative model is directly given by , which is used to compute discriminative classifiers. However, recent works showed that the Bayesian Maximum Posterior classifier defined from the Naive Bayes (NB) or Hidden Markov Chain (HMC), both generative models, can also match the discriminative classifier definition. Thus, there are situations in which dividing classifiers into "generative" and "discriminative" is somewhat misleading. Indeed, such a distinction is rather related to the way of computing classifiers, not to the classifiers themselves. We present a general theoretical result specifying how a…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsNatural Language Processing Techniques · Topic Modeling · Bayesian Modeling and Causal Inference
