BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Information-Theoretic Bounded Rationality   -  Pedro Ortega\, Univ
 ersity of Pennsylvania
DTSTART:20160322T101500Z
DTEND:20160322T111500Z
UID:TALK65219@talks.cam.ac.uk
CONTACT:Microsoft Research Cambridge Talks Admins
DESCRIPTION:In this talk I provide an overview of information-theoretic bo
 unded-rationality for planning in sequential decision problems. I show how
  to ground the theory on a stochastic computation model for large-scale ch
 oice spaces and then derive the free energy functional as the associated v
 ibrational 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 behav
 iourally indistinguishable decision problems\; and they possess natural st
 ochastic choice algorithms. I will discuss a general class of bounded-rati
 onal sequential planning problems that encompasses some well- known classi
 cal 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.  
LOCATION:Auditorium\, Microsoft Research Ltd\, 21 Station Road\, Cambridge
 \, CB1 2FB
END:VEVENT
END:VCALENDAR