Main navigation | Main content
HOME » PROGRAMS/ACTIVITIES » Annual Thematic ProgramPROGRAMS/ACTIVITIES
Annual Thematic Program »Postdoctoral Fellowships »Hot Topics and Special »Public Lectures »New Directions »PI Programs »Math Modeling »Seminars »Be an Organizer »Annual »Hot Topics »PI Summer »PI Conference »Applying to Participate »
Talk Abstract
Sparse Matrix Methods and Probabilistic Inference Algorithms
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.
Back to Codes, Systems and Graphical Models
|
|
|
|
|