COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. |

University of Cambridge > Talks.cam > Machine Learning @ CUED > Approximate Bayesian Inference for Large Scale Inverse Problems: A Computational Viewpoint

## Approximate Bayesian Inference for Large Scale Inverse Problems: A Computational ViewpointAdd to your list(s) Download to your calendar using vCal - Prof. Matthias Seeger (EPFL)
- Thursday 28 July 2011, 11:30-12:30
- Engineering Department, CBL Room 438.
If you have a question about this talk, please contact Zoubin Ghahramani. Tomographic sparse linear inverse problems are at the core of medical imaging (MRI, CT), astronomy, analysis of large scale networks, and many other applications. Viewed as a probabilistic graphical model, they are characterized by a densely, non-locally coupled likelihood and a non-Gaussian sparsity prior. Even MAP estimation is challenging for these models, yet intense recent research has produced a range of competitive MAP algorithms. However, for these underdetermined problems, there are compelling reasons to move beyond MAP towards Bayesian inference and decision making, such as increased robustness and interpretability, built-in mechanisms to fit linear or nonlinear hyperparameters, and adaptation of the measurement operator by experimental design (active learning). Unfortunately, current approximate inference algorithms are many orders of magnitude too slow to accept this challenge. A key strategy to narrow the gap to MAP is to find ways to reduce approximate inference to subproblems of penalized likelihood structure. Using tools from convex duality, I show how to achieve such iterative decoupling for a range of commonly used variational inference relaxations. Resulting double loop algorithms are orders of magnitude faster than previous coordinate descent (or “message-passing”) algorithms. Not surprisingly, approximate inference remains harder than MAP , but the added difficulties are transparent and amenable to fast techniques from signal processing and numerical mathematics. Time permitting, I will comment on work in progress on integrating factorization assumptions and on approximate Bayesian blind deconvolution. This talk is part of the Machine Learning @ CUED series. ## This talk is included in these lists:- Seminar
- All Talks (aka the CURE list)
- Biology
- CBL important
- Cambridge Big Data
- Cambridge Forum of Science and Humanities
- Cambridge Language Sciences
- Cambridge Neuroscience Seminars
- Cambridge University Engineering Department Talks
- Centre for Smart Infrastructure & Construction
- Creating transparent intact animal organs for high-resolution 3D deep-tissue imaging
- Engineering Department, CBL Room 438
- Featured lists
- Guy Emerson's list
- Inference Group Summary
- Information Engineering Division seminar list
- Joint Machine Learning Seminars
- Life Science
- Life Sciences
- Machine Learning @ CUED
- Machine Learning Summary
- Neuroscience
- Neuroscience Seminars
- Neuroscience Seminars
- Required lists for MLG
- School of Technology
- Stem Cells & Regenerative Medicine
- dh539
- ndk22's list
- rp587
Note that ex-directory lists are not shown. |
## Other listsCambridge Talk-What Cambridge Wore- RSE Seminars Cambridge University Computing and Technology Society (CUCaTS)## Other talksDesign a Resillient Manufacturing System in the Presence of Change Metamaterials and the Science of Invisibility Breast cancer - demographics, presentation, diagnosis and patient pathway Solving the Reproducibility Crisis Giving the Sign: Katherine Mansfield Intelligent Self-Driving Vehicles |