arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1406.4682cs.AIcs.CCcs.LG
收藏

潜变量条件模型的精确译码是NP困难的

Exact Decoding on Latent Variable Conditional Models is NP-Hard

Peking University(北京大学)

Xu Sun

摘要:

隐变量条件模型,包括作为特殊情况的隐条件随机场,是许多自然语言处理和视觉处理任务的流行模型。潜条件随机场中精确解码/推断的计算复杂性尚不清楚。本文试图阐明精确译码的计算复杂性。我们分析的复杂性,并证明,这是一个NP-难的问题,即使在顺序标记设置。此外,我们提出了潜在的动态推理(LDI-Naive)方法及其有界版本(LDI-Bounded),这是能够执行精确推理或几乎精确推理,通过使用顶部$n$搜索和动态规划。

英文摘要:

Latent variable conditional models, including the latent conditional random fields as a special case, are popular models for many natural language processing and vision processing tasks. The computational complexity of the exact decoding/inference in latent conditional random fields is unclear. In this paper, we try to clarify the computational complexity of the exact decoding. We analyze the complexity and demonstrate that it is an NP-hard problem even on a sequential labeling setting. Furthermore, we propose the latent-dynamic inference (LDI-Naive) method and its bounded version (LDI-Bounded), which are able to perform exact-inference or almost-exact-inference by using top-$n$ search and dynamic programming.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑