Double-edge factor graphs: definition, properties, and examples
Refereed conference paper presented and published in conference proceedings


引用次數
替代計量分析
.

其它資訊
摘要Some of the most interesting quantities associated with a factor graph are its marginals and its partition sum. For factor graphs without cycles and moderate message-update complexities, the sum-product algorithm (SPA) can be used to efficiently compute these quantities exactly. Moreover, for various classes of factor graphs with cycles, the SPA has been successfully applied to efficiently compute good approximations to these quantities. Note that in the case of factor graphs with cycles, the local functions are usually non-negative real-valued functions.

In this paper we introduce a class of factor graphs, called double-edge factor graphs (DE-FGs), which allow local functions to be complex-valued and only require them, in some suitable sense, to be positive semi-definite kernel functions. We discuss various properties of the SPA when running it on DE-FGs and we show promising numerical results for various example DE-FGs, some of which have connections to quantum information processing.
著者Michael X. Cao, Pascal O. Vontobel
會議名稱2017 IEEE Information Theory Workshop
會議開始日06.11.2017
會議完結日10.11.2017
會議地點Kaohsiung
會議國家/地區台灣
會議論文集題名2017 IEEE Information Theory Workshop (ITW)
出版年份2017
出版社IEEE
頁次136 - 140
國際標準書號978-1-5090-3097-2
國際標準期刊號2475-420X
語言美式英語

上次更新時間 2021-23-09 於 01:07