%PDF-1.4 % 4 0 obj (I Introduction) endobj 5 0 obj << /D (section.2) /S /GoTo >> endobj 8 0 obj (II Notations, Problem Setup and Background) endobj 9 0 obj << /D (subsection.2.1) /S /GoTo >> endobj 12 0 obj (II-A Inference using a Variational Principle) endobj 13 0 obj << /D (section.3) /S /GoTo >> endobj 16 0 obj (III The Norm-Product Belief Propagation Algorithm) endobj 17 0 obj << /D (section.4) /S /GoTo >> endobj 20 0 obj (IV The Convex Belief Propagation Algorithms) endobj 21 0 obj << /D (subsection.4.1) /S /GoTo >> endobj 24 0 obj (IV-A Convex-sum-product Algorithm) endobj 25 0 obj << /D (subsection.4.2) /S /GoTo >> endobj 28 0 obj (IV-B LP-relaxation Bounds) endobj 29 0 obj << /D (subsection.4.3) /S /GoTo >> endobj 32 0 obj (IV-C Convex-max-product Algorithm) endobj 33 0 obj << /D (section.5) /S /GoTo >> endobj 36 0 obj (V Experiments) endobj 37 0 obj << /D (section.6) /S /GoTo >> endobj 40 0 obj (VI Discussion) endobj 41 0 obj << /D (section*.1) /S /GoTo >> endobj 44 0 obj (Appendix A: Mathematical Background on Conjugate Duality) endobj 45 0 obj << /D (section*.2) /S /GoTo >> endobj 48 0 obj (Appendix B: The Primal-Dual Block Ascent Algorithm) endobj 49 0 obj << /D (subsection.Appendix.B.1) /S /GoTo >> endobj 52 0 obj (B-A The non-convex case) endobj 53 0 obj << /D (subsection.Appendix.B.2) /S /GoTo >> endobj 56 0 obj (B-B The non-strictly convex case) endobj 57 0 obj << /D (section*.3) /S /GoTo >> endobj 60 0 obj (Appendix C: The Norm-Product Algorithm) endobj 61 0 obj << /D (section*.4) /S /GoTo >> endobj 64 0 obj (Appendix D: Convex-Free-Energy Parameter Settings) endobj 65 0 obj << /D (section*.5) /S /GoTo >> endobj 68 0 obj (Appendix E: Incorporating zero potentials) endobj 69 0 obj << /D (section*.6) /S /GoTo >> endobj 72 0 obj (Appendix F: Acknowledgements) endobj 73 0 obj << /D (section*.7) /S /GoTo >> endobj 76 0 obj (References) endobj 77 0 obj << /D [ 78 0 R /Fit ] /S /GoTo >> endobj 98 0 obj << /Filter /FlateDecode /Length 5665 >> stream x;r۸~k$[et2]Y\S=S