메뉴 건너뛰기




Volumn 1, Issue , 2012, Pages 783-790

LPQP for MAP: Putting LP solvers to better use

Author keywords

[No Author keywords available]

Indexed keywords

AUXILIARY VARIABLES; BELIEF PROPAGATION; BUILDING BLOCKES; DUAL DECOMPOSITION; ENERGY FUNCTIONS; KULLBACK LEIBLER DIVERGENCE; LP RELAXATION; REAL WORLD DATA;

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

References (20)
  • 1
    • 85014561619 scopus 로고    scopus 로고
    • A fast iterative shrinkage-thresholding algorithm for linear inverse problems
    • Beck, A and Teboulle, M. A fast iterative shrinkage-thresholding algorithm for linear inverse problems. SIAM Journal on Imaging Sciences, 2(1), 2009.
    • (2009) SIAM Journal on Imaging Sciences , vol.2 , Issue.1
    • Beck, A.1    Teboulle, M.2
  • 3
    • 85167601516 scopus 로고    scopus 로고
    • Dual decomposition for marginal inference
    • Domke, J. Dual decomposition for marginal inference. In AAAI, 2011.
    • (2011) AAAI
    • Domke, J.1
  • 4
    • 78649384136 scopus 로고    scopus 로고
    • Norm-product belief propagation: Primal-dual message-passing for approximate inference
    • Hazan, T and Shashua, A. Norm-product belief propagation: Primal-dual message-passing for approximate inference. IEEE TIT, 56(12):6294-6316, 2010.
    • (2010) IEEE TIT , vol.56 , Issue.12 , pp. 6294-6316
    • Hazan, T.1    Shashua, A.2
  • 5
    • 77956557111 scopus 로고    scopus 로고
    • Accelerated dual decomposition for MAP inference
    • Jojic, V, Gould, S, and Koller, D. Accelerated dual decomposition for MAP inference. In ICML, 2010.
    • (2010) ICML
    • Jojic, V.1    Gould, S.2    Koller, D.3
  • 6
    • 84867132729 scopus 로고    scopus 로고
    • MAP-Inference for Highly-Connected Graphs with DC-Programming
    • Kappes, J and Schnoerr, C. MAP-Inference for Highly-Connected Graphs with DC-Programming. In DAGM, 2008.
    • (2008) DAGM
    • Kappes, J.1    Schnoerr, C.2
  • 7
    • 33750129298 scopus 로고    scopus 로고
    • Convergent tree-reweighted message passing for energy minimization
    • Kolmogorov, V. Convergent tree-reweighted message passing for energy minimization. PAMI, 2006.
    • (2006) PAMI
    • Kolmogorov, V.1
  • 8
    • 50649087920 scopus 로고    scopus 로고
    • MRF optimization via dual decomposition: Message-passing revisited
    • Komodakis, N, Paragios, N, and Tziritas, G. MRF optimization via dual decomposition: Message-passing revisited. In In ICCV, 2007.
    • (2007) ICCV
    • Komodakis, N.1    Paragios, N.2    Tziritas, G.3
  • 9
    • 80053157605 scopus 로고    scopus 로고
    • Message-Passing Algorithms for Quadratic Programming Formulations of MAP Estimation
    • Kumar, A and Zilberstein, S. Message-Passing Algorithms for Quadratic Programming Formulations of MAP Estimation. In UAI, 2011.
    • (2011) UAI
    • Kumar, A.1    Zilberstein, S.2
  • 10
    • 84867136217 scopus 로고    scopus 로고
    • Message-Passing Algorithms for MAP Estimation Using DC Programming
    • Kumar, A, Zilberstein, S, and Toussaint, M. Message-Passing Algorithms for MAP Estimation Using DC Programming. In AISTATS, 2012.
    • (2012) AISTATS
    • Kumar, A.1    Zilberstein, S.2    Toussaint, M.3
  • 13
    • 33749267091 scopus 로고    scopus 로고
    • Quadratic Programming Relaxations for Metric Labeling and Markov Random Field MAP Estimation
    • Ravikumar, P and Lafferty, J. Quadratic Programming Relaxations for Metric Labeling and Markov Random Field MAP Estimation. In ICML, 2006.
    • (2006) ICML
    • Ravikumar, P.1    Lafferty, J.2
  • 14
    • 77951167674 scopus 로고    scopus 로고
    • Message-passing for graph-structured linear programs: Proximal methods and rounding schemes
    • Ravikumar, P, Agarwal, A, and Wainwright, M J. Message-passing for graph-structured linear programs: Proximal methods and rounding schemes. J. Mach. Learn. Res., 11:1043-1080, 2010.
    • (2010) J. Mach. Learn. Res. , vol.11 , pp. 1043-1080
    • Ravikumar, P.1    Agarwal, A.2    Wainwright, M.J.3
  • 15
    • 80052904935 scopus 로고    scopus 로고
    • A study of Nesterov's scheme for Lagrangian decomposition and MAP labeling
    • Savchynskyy, B, Kappes, J H, Schmidt, S, and Schnörr, C. A study of Nesterov's scheme for Lagrangian decomposition and MAP labeling. In CVPR, pp. 1817-1823, 2011.
    • (2011) CVPR , pp. 1817-1823
    • Savchynskyy, B.1    Kappes, J.H.2    Schmidt, S.3    Schnörr, C.4
  • 16
    • 33947143988 scopus 로고
    • Syntactic analysis of two-dimensional visual signals in noisy conditions
    • Schlesinger, M I. Syntactic analysis of two-dimensional visual signals in noisy conditions. Kibernetika, 4: 113-130, 1976.
    • (1976) Kibernetika , vol.4 , pp. 113-130
    • Schlesinger, M.I.1
  • 17
    • 80053283534 scopus 로고    scopus 로고
    • Tightening LP relaxations for MAP using message-passing
    • Sontag, D, Meltzer, T, Globerson, A, Weiss, Y, and Jaakkola, T. Tightening LP relaxations for MAP using message-passing. In UAI, pp. 503-510, 2008.
    • (2008) UAI , pp. 503-510
    • Sontag, D.1    Meltzer, T.2    Globerson, A.3    Weiss, Y.4    Jaakkola, T.5
  • 19
    • 33745778496 scopus 로고    scopus 로고
    • Linear programming relaxations and belief propagation - An empirical study
    • Yanover, C, Meltzer, T, and Weiss, Y. Linear programming relaxations and belief propagation - an empirical study. JMLR, 2006.
    • (2006) JMLR
    • Yanover, C.1    Meltzer, T.2    Weiss, Y.3


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