Jump to ContentJump to Main Navigation
Bayesian Statistics 9$
Users without a subscription are not able to see the full content.

José M. Bernardo, M. J. Bayarri, James O. Berger, A. P. Dawid, David Heckerman, Adrian F. M. Smith, and Mike West

Print publication date: 2011

Print ISBN-13: 9780199694587

Published to Oxford Scholarship Online: January 2012

DOI: 10.1093/acprof:oso/9780199694587.001.0001

Show Summary Details
Page of

PRINTED FROM OXFORD SCHOLARSHIP ONLINE (oxford.universitypressscholarship.com). (c) Copyright Oxford University Press, 2021. All Rights Reserved. An individual user may print out a PDF of a single chapter of a monograph in OSO for personal use. date: 13 April 2021

Approximating Max‐Sum‐Product Problems using Multiplicative Error Bounds

Approximating Max‐Sum‐Product Problems using Multiplicative Error Bounds

(p.439) Approximating Max‐Sum‐Product Problems using Multiplicative Error Bounds
Bayesian Statistics 9

Christopher Meek

Ydo Wexler

Oxford University Press

We describe the Multiplicative Approximation Scheme (MAS) for approximate inference in multiplicative models. We apply this scheme to develop the DynaDecomp approximation algorithm. This algorithm can be used to obtain bounded approximations for various types of max‐sum‐product problems including the computation of the log probability of evidence, the log‐partition function, Most Probable Explanation (MPE) and maximum a posteriori probability (MAP) inference problems. We demonstrate that this algorithm yields bounded approximations superior to existing methods using a variety of large graphical models.

Keywords:   Approximate inference, graphical models, max‐sum‐product, sum‐product

Oxford Scholarship Online requires a subscription or purchase to access the full text of books within the service. Public users can however freely search the site and view the abstracts and keywords for each book and chapter.

Please, subscribe or login to access full text content.

If you think you should have access to this title, please contact your librarian.

To troubleshoot, please check our FAQs , and if you can't find the answer there, please contact us .