AI帮你理解科学
Tightening LP Relaxations for MAP using Message Passing
Uncertainty in Artificial Intelligence, (2012): 503-510
EI
摘要
Linear Programming (LP) relaxations have become powerful tools for finding the most probable (MAP) configuration in graphical models. These relaxations can be solved eciently using message-passing algorithms such as belief propagation and, when the re- laxation is tight, provably find the MAP con- figuration. The standard LP relaxation is...更多
代码:
数据:
标签
评论
数据免责声明
页面数据均来自互联网公开来源、合作出版商和通过AI技术自动分析结果,我们不对页面数据的有效性、准确性、正确性、可靠性、完整性和及时性做出任何承诺和保证。若有疑问,可以通过电子邮件方式联系我们:report@aminer.cn