This shows you the differences between two versions of the page.
| Next revision | Previous revision | ||
|
en:projects:details:igm09 [2009/06/05 18:54] masoud created |
en:projects:details:igm09 [2016/06/23 11:26] (current) |
||
|---|---|---|---|
| Line 2: | Line 2: | ||
| title : Approximate inference in Graphical Models | title : Approximate inference in Graphical Models | ||
| contactname: Masoud Alipour | contactname: Masoud Alipour | ||
| - | contactmail_mail: masoud [dot] alipour [at] epfl [dot] ch | + | contactmail_mail: masoud.alipour@epfl.ch |
| contacttel: 021 6937529 | contacttel: 021 6937529 | ||
| contactroom: BC 150 | contactroom: BC 150 | ||
| type : master semester | type : master semester | ||
| - | status : available | + | state : completed |
| created_dt : 2009-06-03 | created_dt : 2009-06-03 | ||
| - | taken_dt : | + | taken_dt : 2009-06-15 |
| - | completed_dt : | + | completed_dt : 2010-01-13 |
| - | by : | + | by : Bogdan Stroe |
| output_media : | output_media : | ||
| table : projects | table : projects | ||
| Line 16: | Line 16: | ||
| template:datatemplates:project | template:datatemplates:project | ||
| ---- | ---- | ||
| + | |||
| + | Graphical Models are unifying framework for inference and learning for different applications such as Bioinformatics, speech processing, image processing, coding, and control theory. Many methods have been proposed for exact and approximate inference in graphical models. However, in most cases the exact inference is intractable and therefore the approximate inference methods are the focus of research in this area. One class of of approximate inference method is based on Linear and semidefinite programming relaxation of the problem. The aim of this project is to study and implement this method for general graphical models. Furthermore, the student should assess the performance, of this method on different datasets. The proportion of theoretical and empirical (programming, simulation) work in this project is 50-50 percent. | ||
| + | |||
| + | Requirement: | ||
| + | * Good familiarity with probability theory | ||
| + | * Strong programming skills | ||
| + | * Familiarity with graph algorithms | ||
| + | What will you learn | ||
| + | * Learning and Inference in Graphical Models | ||
| + | * Semidefinite Programming (SDP) | ||
| + | * Second-Order Cone Programming (SOCP) | ||
| + | * Fast implementation of inference algorithms for graphical models | ||
| + | * Using and interfacing to existing efficient solvers | ||
| + | |||
| + | Suggested Readings and References | ||
| + | * [[https://www.nowpublishers.com/product.aspx?product=MAL&doi=2200000001|Graphical Models, Exponential Families, and Variational Inference]], Martin J. Wainwright, Michael I. Jordan | ||
| + | * [[http://www.stanford.edu/~boyd/cvxbook/|Convex Optimization]], Boyd, Vandenberghe | ||
| + | * [[http://research.microsoft.com/en-us/um/people/cmbishop/prml/|Pattern Recognition and Machine Learning]], Christopher M. Bishop | ||