Free energy of stochastic context free grammar on variational Bayes

被引:0
|
作者
Hosino, Tikara
Watanabe, Kazuho
Watanabe, Sumio
机构
[1] Tokyo Inst Technol, Midori Ku, Yokohama, Kanagawa 2268503, Japan
[2] Nihon Unisys Ltd, Koutou Ku, Tokyo 1358560, Japan
[3] Tokyo Inst Technol, Precis & Intelligence Lab, Midori Ku, Yokohama, Kanagawa 2268503, Japan
关键词
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Variational Bayesian learning is proposed for approximation method of Bayesian learning. In spite of efficiency and experimental good performance, their mathematical property has not yet been clarified. In this paper we analyze variational Bayesian Stochastic Context Free Grammar which includes the true distribution thus the model is non-identifiable. We derive their asymptotic free energy. It is shown that in some prior conditions, the free energy is much smaller than identifiable models and satisfies eliminating redundant non-terminals.
引用
收藏
页码:407 / 416
页数:10
相关论文
共 50 条
  • [41] A Graphical Model for Context-Free Grammar Parsing
    Pingali, Keshav
    Bilardi, Gianfranco
    COMPILER CONSTRUCTION (CC 2015), 2015, 9031 : 3 - 27
  • [42] CONTEXT-FREE GRAMMAR FORMS WITH STRICT INTERPRETATIONS
    MAURER, HA
    SALOMAA, A
    WOOD, D
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1980, 21 (01) : 110 - 135
  • [43] Statistical Parsing with Context-Free Filtering Grammar
    Demko, Michael
    Penn, Gerald
    ADVANCES IN ARTIFICIAL INTELLIGENCE, PROCEEDINGS, 2009, 5549 : 52 - +
  • [44] Context free grammar and the infinite-state automaton
    Lu, Yingzhi
    Tien Tzu Hsueh Pao/Acta Electronica Sinica, 1996, 24 (08): : 23 - 27
  • [45] STRONGLY EQUIVALENT CONTEXT-FREE GRAMMAR FORMS
    GINSBURG, S
    MAURER, HA
    COMPUTING, 1976, 16 (03) : 281 - 290
  • [46] DESCRIPTIONAL COMPLEXITY OF CONTEXT-FREE GRAMMAR FORMS
    CSUHAJVARJU, E
    KELEMENOVA, A
    THEORETICAL COMPUTER SCIENCE, 1993, 112 (02) : 277 - 289
  • [47] ELIMINATION OF LEFT RECURSION IN CONTEXT-FREE GRAMMAR
    BORDIER, J
    REVUE FRANCAISE D AUTOMATIQUE INFORMATIQUE RECHERCHE OPERATIONNELLE, 1970, 4 (NB3): : 145 - 162
  • [48] ELIMINATION OF LOEFT RECURSIVITY IN A CONTEXT-FREE GRAMMAR
    BORDIER, J
    REVUE FRANCAISE D INFORMATIQUE DE RECHERCHE OPERATIONNELLE, 1970, 4 (NB3): : 145 - &
  • [49] The omphalos context-free grammar learning competition
    Starkie, B
    Coste, F
    van Zaanen, M
    GRAMMATICAL INFERENCE: ALGORITHMS AND APPLICATIONS, PROCEEDINGS, 2004, 3264 : 16 - 27
  • [50] SIZE COMPLEXITY IN CONTEXT-FREE GRAMMAR FORMS
    GINSBURG, S
    LYNCH, N
    JOURNAL OF THE ACM, 1976, 23 (04) : 582 - 598