Maximum Entropy Discrimination Markov Networks
Jun Zhu, and Eric P. Xing

TL;DR
This paper introduces MaxEnDNet, a unified framework combining Bayesian estimation and max-margin structured learning for Markov networks, leading to improved inference and generalization in structured prediction tasks.
Contribution
It presents a novel Bayesian-structured max-margin learning framework for Markov networks, extending existing models and providing efficient inference and generalization guarantees.
Findings
Outperforms existing structured learning methods on synthetic data
Provides a sparse, regularized Markov network model
Offers a PAC-Bayesian generalization bound
Abstract
In this paper, we present a novel and general framework called {\it Maximum Entropy Discrimination Markov Networks} (MaxEnDNet), which integrates the max-margin structured learning and Bayesian-style estimation and combines and extends their merits. Major innovations of this model include: 1) It generalizes the extant Markov network prediction rule based on a point estimator of weights to a Bayesian-style estimator that integrates over a learned distribution of the weights. 2) It extends the conventional max-entropy discrimination learning of classification rule to a new structural max-entropy discrimination paradigm of learning the distribution of Markov networks. 3) It subsumes the well-known and powerful Maximum Margin Markov network (MN) as a special case, and leads to a model similar to an -regularized MN that is simultaneously primal and dual sparse, or other types of…
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
TopicsGaussian Processes and Bayesian Inference · Statistical Methods and Inference · Neural Networks and Applications
