메뉴 건너뛰기




Volumn , Issue , 2011, Pages

Message-passing for approximate MAP inference with latent variables

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; ARTIFICIAL INTELLIGENCE; IMAGE SEGMENTATION; MAXIMUM PRINCIPLE;

EID: 85162379829     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (20)

References (24)
  • 1
    • 85117703506 scopus 로고    scopus 로고
    • Minimum bayes-risk decoding for statistical machine translation
    • Speech Processing
    • Shankar Kumar, William Byrne, and Speech Processing. Minimum bayes-risk decoding for statistical machine translation. In HLT-NAACL, 2004.
    • (2004) HLT-NAACL
    • Kumar, S.1    Byrne, W.2
  • 3
    • 84875745284 scopus 로고    scopus 로고
    • Fixing max-product: Convergent message passing algorithms for map lp-relaxations
    • Amir Globerson and Tommi Jaakkola. Fixing max-product: Convergent message passing algorithms for map lp-relaxations. In NIPS, 2007.
    • (2007) NIPS
    • Globerson, A.1    Jaakkola, T.2
  • 4
    • 56449095463 scopus 로고    scopus 로고
    • Message-passing for graph-structured linear programs: Proximal projections, convergence and rounding schemes
    • Pradeep Ravikumar, Alekh Agarwal, and Martin J. Wainwright. Message-passing for graph-structured linear programs: proximal projections, convergence and rounding schemes. In ICML, 2008.
    • (2008) ICML
    • Ravikumar, P.1    Agarwal, A.2    Wainwright, M.J.3
  • 5
    • 80053147630 scopus 로고    scopus 로고
    • Variational algorithms for marginal map
    • Qiang Liu and Alexander Ihler. Variational algorithms for marginal map. In UAI, 2011.
    • (2011) UAI
    • Liu, Q.1    Ihler, A.2
  • 6
    • 0242292825 scopus 로고    scopus 로고
    • MAP complexity results and approximation methods
    • James D. Park. MAP Complexity Results and Approximation Methods. In UAI, 2002.
    • (2002) UAI
    • Park, J.D.1
  • 9
    • 0001492251 scopus 로고    scopus 로고
    • Minimum Bayes-risk automatic speech recognition
    • Vaibhava Goel and William J. Byrne. Minimum Bayes-risk automatic speech recognition. Computer Speech and Language, 14(2), 2000.
    • (2000) Computer Speech and Language , vol.14 , Issue.2
    • Goel, V.1    Byrne, W.J.2
  • 14
    • 29344473978 scopus 로고    scopus 로고
    • Tree-reweighted belief propagation algorithms and approximate ml estimation by pseudo-moment matching
    • Martin J. Wainwright, Tommi S. Jaakkola, and Alan S. Willsky. Tree-reweighted belief propagation algorithms and approximate ml estimation by pseudo-moment matching. In AISTATS, 2003.
    • (2003) AISTATS
    • Wainwright, M.J.1    Jaakkola, T.S.2    Willsky, A.S.3
  • 15
    • 80053381171 scopus 로고    scopus 로고
    • Why doesnt em find good hmm pos-taggers
    • Mark Johnson. Why doesnt em find good hmm pos-taggers. In EMNLP, pages 296-305, 2007.
    • (2007) EMNLP , pp. 296-305
    • Johnson, M.1
  • 18
    • 0002788893 scopus 로고    scopus 로고
    • A view of the EMAlgorithm that justifies incremental, sparse, andother variants
    • RadfordM. Neal and Geoffrey E. Hinton. A View of the EMAlgorithm that Justifies Incremental, Sparse, andOther Variants. In Learning in graphical models, pages 355-368, 1999.
    • (1999) Learning in Graphical Models , pp. 355-368
    • Neal, R.M.1    Hinton, G.E.2
  • 19
    • 85162020178 scopus 로고    scopus 로고
    • Discriminative log-linear grammars with latent variables
    • Slav Petrov and Dan Klein. Discriminative log-linear grammars with latent variables. In NIPS, 2008.
    • (2008) NIPS
    • Petrov, S.1    Klein, D.2
  • 20
    • 85119621244 scopus 로고    scopus 로고
    • A latent variable model for generative dependency parsing
    • Ivan Titov and James Henderson. A latent variable model for generative dependency parsing. In IWPT, 2007.
    • (2007) IWPT
    • Titov, I.1    Henderson, J.2
  • 23
    • 33745778496 scopus 로고    scopus 로고
    • Linear programming relaxations and belief propagation - An empirical study
    • Chen Yanover, Talya Meltzer, and Yair Weiss. Linear programming relaxations and belief propagation - an empirical study. Journal of Machine Learning Research, 7:1887-1907, 2006.
    • (2006) Journal of Machine Learning Research , vol.7 , pp. 1887-1907
    • Yanover, C.1    Meltzer, T.2    Weiss, Y.3
  • 24
    • 70450200743 scopus 로고    scopus 로고
    • Minimizing and learning energy functions for side-chain prediction
    • Chen Yanover,Ora Schueler-furman, and Yair Weiss. Minimizing and learning energy functions for side-chain prediction. In RECOMB2007, 2007.
    • (2007) RECOMB2007
    • Yanover, C.1    Schueler-Furman, O.2    Weiss, Y.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.