IEEE Trans Pattern Anal Mach Intell. 2015 Sep;37(9):1917-29. doi: 10.1109/TPAMI.2014.2388228.
Hidden conditional random fields (HCRFs) are discriminative latent variable models which have been shown to successfully learn the hidden structure of a given classification problem. An Infinite hidden conditional random field is a hidden conditional random field with a countably infinite number of hidden states, which rids us not only of the necessity to specify a priori a fixed number of hidden states available but also of the problem of overfitting. Markov chain Monte Carlo (MCMC) sampling algorithms are often employed for inference in such models. However, convergence of such algorithms is rather difficult to verify, and as the complexity of the task at hand increases the computational cost of such algorithms often becomes prohibitive. These limitations can be overcome by variational techniques. In this paper, we present a generalized framework for infinite HCRF models, and a novel variational inference approach on a model based on coupled Dirichlet Process Mixtures, the HCRF-DPM. We show that the variational HCRF-DPM is able to converge to a correct number of represented hidden states, and performs as well as the best parametric HCRFs-chosen via cross-validation-for the difficult tasks of recognizing instances of agreement, disagreement, and pain in audiovisual sequences.
隐条件随机场 (HCRF) 是一种判别式潜在变量模型,已被证明可以成功地学习给定分类问题的隐藏结构。无穷隐条件随机场是具有可数无穷多个隐藏状态的隐条件随机场,它不仅消除了预先指定可用的固定数量的隐藏状态的必要性,还解决了过拟合的问题。马尔可夫链蒙特卡罗 (MCMC) 抽样算法通常用于此类模型的推断。然而,此类算法的收敛性很难验证,并且随着手头任务的复杂性增加,此类算法的计算成本通常变得过高。这些限制可以通过变分技术来克服。在本文中,我们提出了一个用于无穷 HCRF 模型的广义框架,以及一种基于耦合狄利克雷过程混合的模型的新的变分推断方法,即 HCRF-DPM。我们证明了变分 HCRF-DPM 能够收敛到正确数量的表示隐藏状态,并且在识别视听序列中的一致性、不一致性和疼痛实例等困难任务中,与通过交叉验证选择的最佳参数 HCRF 表现一样好。