Graphical Models and Message-Passing Algorithms: Some Introductory Lectures
DOI10.1007/978-3-319-16967-5_3zbMath1338.62017OpenAlexW2182258425MaRDI QIDQ3463611
Publication date: 19 January 2016
Published in: Lecture Notes in Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-16967-5_3
Applications of graph theory (05C90) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to statistics (62-01) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Graph theory (including graph drawing) in computer science (68R10) Graphical methods in statistics (62A09) Multivariate analysis (62Hxx) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Sparse inverse covariance estimation with the graphical lasso
- High-dimensional structure estimation in Ising models: local separation criterion
- Sanov property, generalized I-projection and a conditional limit theorem
- A note on the Lasso for Gaussian graphical model selection
- High-dimensional Ising model selection using \(\ell _{1}\)-regularized logistic regression
- An iterative procedure for obtaining I-projections onto the intersection of convex sets
- The geometry of exponential families
- Causation, prediction, and search
- I-divergence geometry of probability distributions and minimization problems
- Probability propagation
- A geometric interpretation of Darroch and Ratcliff's generalized iterative scaling
- Differential geometry of curved exponential families. Curvatures and information loss
- High-dimensional covariance estimation by minimizing \(\ell _{1}\)-penalized log-determinant divergence
- Differential-geometrical methods in statistics
- High-dimensional graphs and variable selection with the Lasso
- Triangulated graphs and the elimination process
- Nonserial dynamic programming
- The Use of Linear Graphs in Gauss Elimination
- Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
- Graphical Models, Exponential Families, and Variational Inference
- Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
- Complexity of Finding Embeddings in a k-Tree
- Abstract Dynamic Programming Models under Commutativity Conditions
- The Evolution of the Minimum Degree Ordering Algorithm
- A recursive approach to low complexity codes
- Computing the Minimum Fill-In is NP-Complete
- Efficiency of pseudolikelihood estimation for simple Gaussian fields
- The generalized distributive law
- Factor graphs and the sum-product algorithm
- Tree-based reparameterization framework for analysis of sum-product and related algorithms
- An Approximate Minimum Degree Ordering Algorithm
- Beitrag zur Theorie des Ferromagnetismus
- Error bounds for convolutional codes and an asymptotically optimum decoding algorithm
- Approximating discrete probability distributions with dependence trees
- An Iterative Procedure for Estimation in Contingency Tables
- Generalized Iterative Scaling for Log-Linear Models
- A Theorem about Random Fields
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
- An Iterative Method of Adjusting Sample Frequency Tables When Expected Marginal Totals are Known
