University of Cambridge > Talks.cam > Microsoft Research Cambridge, public talks > Data Structures for Efficient Inference and Optimization in Expressive Continuous Domains

Log in

University Account

External (via Google)

Information on

Subscribing to talks details

Finding a talk details

Adding a talk details

Disseminating talks details

Help and Documentation details

Data Structures for Efficient Inference and Optimization in Expressive Continuous Domains

Download to your calendar using vCal

Scott Sanner, NICTA and the Australian National University
Friday 26 July 2013, 10:00-11:00
Microsoft Research Ltd, 21 Station Road, Cambridge, CB1 2FB.

If you have a question about this talk, please contact Microsoft Research Cambridge Talks Admins .

This event may be recorded and made available internally or externally via http://research.microsoft.com. Microsoft will own the copyright of any recordings made. If you do not wish to have your image/voice recorded please consider this before attending

This talk is in two parts. In the first part, I introduce an extension of the algebraic decision diagram (ADD) to continuous variables—termed the extended ADD (XADD)—to represent arbitrary piecewise functions (nb, arbitrary pieces, not just hyper-rectangular) over discrete and continuous variables and show how to define and efficiently compute elementary arithmetic operations, integrals, and maximization for various restrictions of these functions. In the second part, I cover a wide range of novel applications where the XADD may be applied: (a) exact inference in expressive discrete and continuous variable graphical models, (b) factored, parameterized linear and quadratic optimization (a generalization of LP and QP solving), and© exact solutions to continuous state, action, and observation sequential decision-making problems.

This is joint work with Zahra Zamani & Ehsan Abbasnejad (Australian National University), Karina Valdivia Delgado & Leliane Nunes de Barros (University of Sao Paulo), and Simon Fang (M.I.T.).

This talk is part of the Microsoft Research Cambridge, public talks series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Data Structures for Efficient Inference and Optimization in Expressive Continuous Domains

📅 Download to calendar (vCal)

⚠️ Important: This event may be recorded and made available internally or externally via http://research.microsoft.com. Microsoft will own the copyright of any recordings made. If you do not wish to have your image/voice recorded please consider this before attending

👤 Speaker: Scott Sanner, NICTA and the Australian National University
📅 Date & Time: Friday 26 July 2013, 10:00 - 11:00
📍 Venue: Microsoft Research Ltd, 21 Station Road, Cambridge, CB1 2FB

Questions? Contact Microsoft Research Cambridge Talks Admins

Abstract

This is joint work with Zahra Zamani & Ehsan Abbasnejad (Australian National University), Karina Valdivia Delgado & Leliane Nunes de Barros (University of Sao Paulo), and Simon Fang (M.I.T.).

Series This talk is part of the Microsoft Research Cambridge, public talks series.

Included in Lists

Note: Ex-directory lists are not shown.

Log in

🔐 Log In

Information on

ℹ️ Information

Data Structures for Efficient Inference and Optimization in Expressive Continuous Domains

This talk is included in these lists:

Data Structures for Efficient Inference and Optimization in Expressive Continuous Domains

Abstract

Included in Lists

Log in

🔐 Log In

Information on

ℹ️ Information

Data Structures for Efficient Inference and Optimization in Expressive Continuous Domains

This talk is included in these lists:

Other lists

Other talks

Data Structures for Efficient Inference and Optimization in Expressive Continuous Domains

Abstract

Included in Lists