scientific article; zbMATH DE number 6253910
From MaRDI portal
Publication:5396643
Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Learning and adaptive systems in artificial intelligence (68T05) Graphical methods in statistics (62A09) Symbolic computation and algebraic computation (68W30)
Recommendations
- Message-passing algorithms for inference and optimization
- Message-Passing Algorithms: Reparameterizations and Splittings
- Message-passing algorithms for quadratic minimization
- Fast algorithms for the maximum convolution problem
- A Class of Optimal Structures for Node Computations in Message Passing Algorithms
- Message passing algorithms and improved LP decoding
- Message-Passing Algorithms and Improved LP Decoding
- On the optimality of solutions of the max-product belief-propagation algorithm in arbitrary graphs
- Communication complexity of approximate maximum matching in the message-passing model
Cited in
(9)- Recursive sum-product algorithm for generalized outer-planar graphs
- Leveraging cluster backbones for improving MAP inference in statistical relational models
- Collective inference for extraction MRFs coupled with symmetric clique potentials
- On the optimality of solutions of the max-product belief-propagation algorithm in arbitrary graphs
- Computation of cross-moments using message passing over factor graphs
- Message-passing algorithms for inference and optimization
- Improving probabilistic inference in graphical models with determinism and cycles
- \(\mathrm{AD}^3\): alternating directions dual decomposition for MAP inference in graphical models
- FastInf: an efficient approximate inference library
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5396643)
