CRF-OPT: An Efficient High-Quality Conditional Random Solver

AAAI(2008)

引用 27|浏览8
暂无评分
摘要
Conditional random field (CRF) is a popular graphical model for sequence labeling. The flexibility of CRF poses significant computational challenges for training. Using existing optimization packages often leads to long training time and unsatisfactory results. In this paper, we develop CRF-OPT, a general CRF training package, to improve the efficiency and quality for training CRFs. We propose two improved versions of the forward-backward algorithm that exploit redundancy and reduce the time by several orders of magnitudes. Further, we propose an exponential transformation that enforces sufficient step sizes for quasi-Newton methods. The technique improves the convergence quality, leading to better training results. We evaluate CRF-OPT on a gene prediction task on pathogenic DNA sequences, and show that it is faster and achieves better prediction accuracy than both the HMM models and the original CRF model without exponential transformation.
更多
查看译文
关键词
training crfs,better prediction accuracy,hmm model,original crf model,better training result,gene prediction task,general crf training package,high-quality conditional random field,exponential transformation,convergence quality,long training time,forward backward algorithm,search algorithm,gene prediction,conditional random field,dna sequence,graphical model,quasi newton method,continuous optimization
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要