Information-Theoretic Bounded Rationality
- đ¤ Speaker: Pedro Ortega, University of Pennsylvania
- đ Date & Time: Tuesday 22 March 2016, 10:15 - 11:15
- đ Venue: Auditorium, Microsoft Research Ltd, 21 Station Road, Cambridge, CB1 2FB
Abstract
In this talk I provide an overview of information-theoretic bounded-rationality for planning in sequential decision problems. I show how to ground the theory on a stochastic computation model for large-scale choice spaces and then derive the free energy functional as the associated vibrational principle for characterizing bounded-rational decisions. These decision processes have three important properties: they trade off utility and decision complexity; they give rise to an equivalence class of behaviourally indistinguishable decision problems; and they possess natural stochastic choice algorithms. I will discuss a general class of bounded-rational sequential planning problems that encompasses some well- known classical planning algorithms as limit cases (such as Expectimax and Minimax), as well as trust- and risk-sensitive planning. Finally, I will point out formal connections to Bayesian inference and to regret theory.
Series This talk is part of the Microsoft Research Cambridge, public talks series.
Included in Lists
- All Talks (aka the CURE list)
- Auditorium, Microsoft Research Ltd, 21 Station Road, Cambridge, CB1 2FB
- bld31
- Cambridge Centre for Data-Driven Discovery (C2D3)
- Cambridge talks
- Chris Davis' list
- Guy Emerson's list
- Interested Talks
- Microsoft Research Cambridge, public talks
- ndk22's list
- ob366-ai4er
- Optics for the Cloud
- personal list
- PMRFPS's
- rp587
- School of Technology
- Trust & Technology Initiative - interesting events
- yk449
Note: Ex-directory lists are not shown.
![[Talks.cam]](/static/images/talkslogosmall.gif)

Pedro Ortega, University of Pennsylvania
Tuesday 22 March 2016, 10:15-11:15