Talk abstract:

Sparse Matrix Methods and Probabilistic Inference Algorithms

Radford M. Neal
Department of Statistics University of Toronto
radford@utstat.toronto.edu

Algorithms for solving sparse systems of linear equations seem similar to algorithms for probability propagation in networks with sparse connections. The aim of this talk is to examine the similarities and differences between these problems, and to see whether methods from one field might help in the other.

Slides used during the talk

Back to Codes, Systems and Graphical Models