Serving MPE Queries on Tensor Networks by Computing Derivatives

被引:0
作者
Wenig, Maurice [1 ]
Barschel, Hanno [1 ]
Giesen, Joachim [1 ]
Goral, Andreas [1 ]
Blacher, Mark [1 ]
机构
[1] Friedrich Schiller Univ Jena, Jena, Germany
来源
INTERNATIONAL CONFERENCE ON PROBABILISTIC GRAPHICAL MODELS | 2024年 / 246卷
关键词
Graphical Models; Tensor Networks; Most Probable Explanation (MPE); Maximum Probability States; Tensor Derivatives; INFERENCE; ALGORITHM;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Recently, tensor networks have been proposed as a data structure for weighted model counting. Computing a weighted model count is thus reduced to contracting a factorized tensor expression. Inference queries on graphical models, especially PoE (probability of evidence) queries, can be expressed directly as weighted model counting problems. Maximization problems can also be addressed on the same data structure, only the standard sum-product semiring has to be replaced by either the tropical (max-sum) or the Viterbi (max-product) semiring in the computations, that is, the tensor contractions. However, tensor contractions only provide maximal values, but MPE (most probable explanation) queries on graphical models do not ask for the maximal value, but for a state, or even the states, at which the maximal value is attained. In the special case of tropical tensor networks for ground states of spin glasses, it has been observed that the ground state can be obtained by computing a derivative of the tensor network over the tropical semiring. Here, we generalize this observation, provide a generic algorithm for computing the derivatives, and prove its correctness.
引用
收藏
页码:515 / 527
页数:13
相关论文
共 14 条
[1]   PyTorch 2: Faster Machine Learning Through Dynamic Python']Python Bytecode Transformation and Graph Compilation [J].
Ansel, Jason ;
Yang, Edward ;
He, Horace ;
Gimelshein, Natalia ;
Jain, Animesh ;
Voznesensky, Michael ;
Bao, Bin ;
Bell, Peter ;
Berard, David ;
Burovski, Evgeni ;
Chauhan, Geeta ;
Chourdia, Anjali ;
Constable, Will ;
Desmaison, Alban ;
DeVito, Zachary ;
Ellison, Elias ;
Feng, Will ;
Gong, Jiong ;
Gschwind, Michael ;
Hirsh, Brian ;
Huang, Sherlock ;
Kalambarkar, Kshiteej ;
Kirsch, Laurent ;
Lazos, Michael ;
Lezcano, Mario ;
Liang, Yanbo ;
Liang, Jason ;
Lu, Yinghai ;
Luk, C. K. ;
Maher, Bert ;
Pan, Yunjie ;
Puhrsch, Christian ;
Reso, Matthias ;
Saroufim, Mark ;
Siraichi, Marcos Yukio ;
Suk, Helen ;
Suo, Michael ;
Tillet, Phil ;
Wang, Eikan ;
Wang, Xiaodong ;
Wen, William ;
Zhang, Shunting ;
Zhao, Xu ;
Zhou, Keren ;
Zou, Richard ;
Mathews, Ajit ;
Chanan, Gregory ;
Wu, Peng ;
Chintala, Soumith .
PROCEEDINGS OF THE 29TH ACM INTERNATIONAL CONFERENCE ON ARCHITECTURAL SUPPORT FOR PROGRAMMING LANGUAGES AND OPERATING SYSTEMS, ASPLOS 2024, VOL 2, 2024, :929-947
[2]   On probabilistic inference by weighted model counting [J].
Chavira, Mark ;
Darwiche, Adnan .
ARTIFICIAL INTELLIGENCE, 2008, 172 (6-7) :772-799
[3]   A knowledge compilation map [J].
Darwiche, A ;
Marquis, P .
JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH, 2002, 17 :229-264
[4]   A differential approach to inference in Bayesian networks [J].
Darwiche, A .
JOURNAL OF THE ACM, 2003, 50 (03) :280-305
[5]  
Dudek JM, 2021, Arxiv, DOI arXiv:2006.15512
[6]  
Dudek JM, 2020, Arxiv, DOI arXiv:1908.04381
[7]   Hyper-optimized tensor network contraction [J].
Gray, Johnnie ;
Kourtis, Stefanos .
QUANTUM, 2021, 5
[8]   Algorithm 799: Revolve: An implementation of checkpointing for the reverse or adjoint mode of computational differentiation [J].
Griewank, A ;
Walther, A .
ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE, 2000, 26 (01) :19-45
[9]  
Griewank A, 2008, OTHER TITL APPL MATH, V105, P1
[10]  
Lagniez JM, 2017, PROCEEDINGS OF THE TWENTY-SIXTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, P667