BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//talks.cam.ac.uk//v3//EN
BEGIN:VTIMEZONE
TZID:Europe/London
BEGIN:DAYLIGHT
TZOFFSETFROM:+0000
TZOFFSETTO:+0100
TZNAME:BST
DTSTART:19700329T010000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=-1SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0100
TZOFFSETTO:+0000
TZNAME:GMT
DTSTART:19701025T020000
RRULE:FREQ=YEARLY;BYMONTH=10;BYDAY=-1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
CATEGORIES:Microsoft Research Cambridge\, public talks
SUMMARY:Information-Theoretic Bounded Rationality - Ped
ro Ortega\, University of Pennsylvania
DTSTART;TZID=Europe/London:20160322T101500
DTEND;TZID=Europe/London:20160322T111500
UID:TALK65219AThttp://talks.cam.ac.uk
URL:http://talks.cam.ac.uk/talk/index/65219
DESCRIPTION:In this talk I provide an overview of information-
theoretic bounded-rationality for planning in sequ
ential decision problems. I show how to ground the
theory on a stochastic computation model for larg
e-scale choice spaces and then derive the free ene
rgy functional as the associated vibrational princ
iple for characterizing bounded-rational decisions
. These decision processes have three important pr
operties: they trade off utility and decision comp
lexity\; they give rise to an equivalence class of
behaviourally indistinguishable decision problems
\; and they possess natural stochastic choice algo
rithms. I will discuss a general class of bounded-
rational sequential planning problems that encompa
sses some well- known classical planning algorithm
s as limit cases (such as Expectimax and Minimax)\
, as well as trust- and risk-sensitive planning. F
inally\, I will point out formal connections to Ba
yesian inference and to regret theory.
LOCATION:Auditorium\, Microsoft Research Ltd\, 21 Station R
oad\, Cambridge\, CB1 2FB
CONTACT:Microsoft Research Cambridge Talks Admins
END:VEVENT
END:VCALENDAR