Laplace Maximum Margin Markov Networks

author: Jun Zhu, Department of Computer Science and Technology, Tsinghua University
published: July 28, 2008,   recorded: July 2008,   views: 5420


Related Open Educational Resources

Related content

Report a problem or upload files

If you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
Lecture popularity: You need to login to cast your vote.


Learning sparse Markov networks based on the maximum margin principle remains an open problem in structured prediction. In this paper, we proposed the Laplace max-margin Markov network (LapM3N), and a general class of Bayesian M3N (BM3N) of which the LapM3N is a special case and enjoys a sparse representation. The BM3N is built on a novel Structured Maximum Entropy Discrimination (SMED) formalism, which offers a general framework for combining Bayesian learning and max-margin learning of log-linear models for structured prediction, and it subsumes the unsparsified M3N as a special case. We present an efficient iterative learning algorithm based on variational approximation and existing convex optimization methods employed in M3N. We show that our method outperforms competing ones on both synthetic and real OCR data.

See Also:

Download slides icon Download slides: icml08_zhu_lmm_01.pdf (1.5 MB)

Download slides icon Download slides: icml08_zhu_lmm_01.ppt (4.2 MB)

Help icon Streaming Video Help

Link this page

Would you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !

Reviews and comments:

Comment1 Jian, August 17, 2008 at 6:03 p.m.:

The author is from Tsinghua University, not UWM.

Comment2 Davor (VL editor), August 22, 2008 at 8:21 a.m.:

Thanks Jian, I have changed the institution

Comment3 Yelly, May 12, 2021 at 8:33 p.m.:

I agree that doing research can be a little tricky. And those students who are easier to get the liberal arts may face difficulties. They are more likely to need help from Likewise, student computer programmers have difficulty completing humanitarian assignments, and it is good that there are services that help with humanitarian assignments.

Comment4 Daniel Mark, August 17, 2021 at 2:19 p.m.:

Recommend to try <a href=""></a>

Comment5 Daniel Mark, August 17, 2021 at 2:20 p.m.:

Recommend to try

Write your own review or comment:

make sure you have javascript enabled or clear this field: