메뉴 건너뛰기




Volumn 1, Issue January, 2014, Pages 244-252

From MAP to marginals: Variational inference in Bayesian submodular models

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; LEARNING SYSTEMS; STRUCTURAL FRAMES;

EID: 84937925250     PISSN: 10495258     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (88)

References (35)
  • 2
    • 84856462978 scopus 로고    scopus 로고
    • Adaptive submodularity: Theory and applications in active learning and stochastic optimization
    • D. Golovin and A. Krause. "Adaptive Submodularity: Theory and Applications in Active Learning and Stochastic Optimization". In: Journal of Artificial Intelligence Research (JAIR) 42 (2011), pp. 427-486.
    • (2011) Journal of Artificial Intelligence Research (JAIR) , vol.42 , pp. 427-486
    • Golovin, D.1    Krause, A.2
  • 6
  • 7
    • 85162027958 scopus 로고    scopus 로고
    • Structured sparsity-inducing norms through submodular functions
    • F. Bach. "Structured sparsity-inducing norms through submodular functions." In: NIPS. 2010.
    • (2010) NIPS
    • Bach, F.1
  • 9
    • 84889843868 scopus 로고    scopus 로고
    • Learning with submodular functions: A convex optimization perspective
    • F. Bach. "Learning with submodular functions: a convex optimization perspective". In: Foundations and Trends® in Machine Learning 6.2-3 (2013), pp. 145-373. ISSN: 1935-8237.
    • (2013) Foundations and Trends® in Machine Learning , vol.6 , Issue.2-3 , pp. 145-373
    • Bach, F.1
  • 10
    • 85162526249 scopus 로고    scopus 로고
    • On fast approximate submodular minimization
    • S. Jegelka, H. Lin, and J. A. Bilmes. "On fast approximate submodular minimization." In: NIPS. 2011.
    • (2011) NIPS
    • Jegelka, S.1    Lin, H.2    Bilmes, J.A.3
  • 12
    • 0035509961 scopus 로고    scopus 로고
    • Fast approximate energy minimization via graph cuts
    • IEEE Transactions on
    • Y. Boykov, O. Veksler, and R. Zabih. "Fast approximate energy minimization via graph cuts". In: Pattern Analysis and Machine Intelligence, IEEE Transactions on 23.11 (2001), pp. 1222-1239.
    • (2001) Pattern Analysis and Machine Intelligence , vol.23 , Issue.11 , pp. 1222-1239
    • Boykov, Y.1    Veksler, O.2    Zabih, R.3
  • 13
    • 0027677367 scopus 로고
    • Polynomial-time approximation algorithms for the ising model
    • M. Jerrum and A. Sinclair. "Polynomial-time approximation algorithms for the Ising model". In: SIAM Journal on computing 22.5 (1993), pp. 1087-1116.
    • (1993) SIAM Journal on Computing , vol.22 , Issue.5 , pp. 1087-1116
    • Jerrum, M.1    Sinclair, A.2
  • 14
    • 33845528171 scopus 로고    scopus 로고
    • The complexity of ferromagnetic ising with local fields
    • L. A. Goldberg and M. Jerrum. "The complexity of ferromagnetic Ising with local fields". In: Combinatorics, Probability and Computing 16.01 (2007), pp. 43-61.
    • (2007) Combinatorics, Probability and Computing , vol.16 , Issue.1 , pp. 43-61
    • Goldberg, L.A.1    Jerrum, M.2
  • 16
    • 65749118363 scopus 로고    scopus 로고
    • Graphical models, exponential families, and variational inference
    • M. J. Wainwright and M. I. Jordan. "Graphical Models, Exponential Families, and Variational Inference". In: Found. Trends Mach. Learn. 1.1-2 (2008), pp. 1-305.
    • (2008) Found. Trends Mach. Learn. , vol.1 , Issue.1-2 , pp. 1-305
    • Wainwright, M.J.1    Jordan, M.I.2
  • 17
    • 0742286180 scopus 로고    scopus 로고
    • What energy functions can be minimized via graph cuts?
    • IEEE Transactions on
    • V. Kolmogorov and R. Zabin. "What energy functions can be minimized via graph cuts?" In: Pattern Analysis and Machine Intelligence, IEEE Transactions on 26.2 (2004), pp. 147-159.
    • (2004) Pattern Analysis and Machine Intelligence , vol.26 , Issue.2 , pp. 147-159
    • Kolmogorov, V.1    Zabin, R.2
  • 20
    • 80052906787 scopus 로고    scopus 로고
    • Submodularity beyond submodular energies: Coupling edges in graph cuts
    • 2011 IEEE Conference on
    • S. Jegelka and J. Bilmes. "Submodularity beyond submodular energies: coupling edges in graph cuts". In: Computer Vision and Pattern Recognition (CVPR), 2011 IEEE Conference on. 2011, pp. 1897-1904.
    • (2011) Computer Vision and Pattern Recognition (CVPR) , pp. 1897-1904
    • Jegelka, S.1    Bilmes, J.2
  • 23
    • 61349174704 scopus 로고    scopus 로고
    • Robust higher order potentials for enforcing label consistency
    • P. Kohli, L. Ladicky, and P. H. Torr. "Robust higher order potentials for enforcing label consistency". In: International Journal of Computer Vision 82.3 (2009), pp. 302-324.
    • (2009) International Journal of Computer Vision , vol.82 , Issue.3 , pp. 302-324
    • Kohli, P.1    Ladicky, L.2    Torr, P.H.3
  • 25
    • 77956526261 scopus 로고    scopus 로고
    • Budgeted nonparametric learning from data streams
    • R. Gomes and A. Krause. "Budgeted Nonparametric Learning from Data Streams". In: ICML. 2010.
    • (2010) ICML
    • Gomes, R.1    Krause, A.2
  • 27
    • 84897505165 scopus 로고    scopus 로고
    • Fast semidifferential-based submodular function optimization
    • R. Iyer, S. Jegelka, and J. Bilmes. "Fast Semidifferential-based Submodular Function Optimization". In: ICML (3). 2013, pp. 855-863.
    • (2013) ICML (3) , pp. 855-863
    • Iyer, R.1    Jegelka, S.2    Bilmes, J.3
  • 28
    • 0001971618 scopus 로고
    • An algorithm for quadratic programming
    • M. Frank and P. Wolfe. "An algorithm for quadratic programming". In: Naval Research Logistics Quarterly 3.1-2 (1956), pp. 95-110. ISSN: 1931-9193.
    • (1956) Naval Research Logistics Quarterly , vol.3 , Issue.1-2 , pp. 95-110
    • Frank, M.1    Wolfe, P.2
  • 32
    • 48749136131 scopus 로고
    • Submodular set functions, matroids and the greedy algorithm: Tight worst-case bounds and some generalizations of the rado-edmonds theorem
    • M. Conforti and G. Cornuejols. "Submodular set functions, matroids and the greedy algorithm: tight worst-case bounds and some generalizations of the Rado-Edmonds theorem". In: Discrete applied mathematics 7.3 (1984), pp. 251-274.
    • (1984) Discrete Applied Mathematics , vol.7 , Issue.3 , pp. 251-274
    • Conforti, M.1    Cornuejols, G.2
  • 33
    • 51249182883 scopus 로고
    • Decomposition of submodular functions
    • W. H. Cunningham. "Decomposition of submodular functions". In: Combinatorica 3.1 (1983).
    • (1983) Combinatorica , vol.3 , Issue.1
    • Cunningham, W.H.1
  • 34
    • 4344598245 scopus 로고    scopus 로고
    • An experimental comparison of min-cut/max-flow algorithms for energy minimization in vision
    • IEEE Trans. on
    • Y Boykov and V. Kolmogorov. "An experimental comparison of min-cut/max-flow algorithms for energy minimization in vision". In: Pattern Analysis and Machine Intelligence, IEEE Trans. on 26.9 (2004).
    • (2004) Pattern Analysis and Machine Intelligence , vol.26 , Issue.9
    • Boykov, Y.1    Kolmogorov, V.2


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