On Efficient Sequential Decision Making in Structured Problems
author:
Adam Kalai,
Toyota Technological Institute
You might be experiencing some problems with Your Video player.
| Slides | |
| 0:00 | Efficient Sequential Decision-Making in Structured Problems |
| 0:55 | BANDITS AND REGRET |
| 3:14 | TWO APPROACHES |
| 5:55 | STRUCTURED COMB-OPT |
| 12:17 | STRUCTURED COMB-OPT |
| 15:00 | MAIN POINTS |
| 17:07 | MAIN RESULT |
| 20:39 | EXPLORE vs EXPLOIT |
| 24:49 | REMAINDER OF TALK |
| 25:25 | GOING TO d-DIMENSIONS |
| 27:33 | EXPLORATION BASIS |
| 31:35 | EXPLORE vs EXPLOIT |
| 32:16 | INSTABILITY |
| 35:36 | STABILITY ANALYSIS [KV03] |
| 38:50 | BANDIT CONVEX OPT. |
| 41:11 | MOTIVATING EXAMPLE |
| 42:18 | BACTERIAL ASCENT |
Lecture rating
| People found this lecture: | ||
| Worth seeing | ||
| because it is: | ||
| Valuable and informative | ||
| Well presented | ||
| Easily understandable | ||
| Acceptably recorded | ||
| You need to login to cast your vote. | ||
Report a problem or upload files
If you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
Related content
Visitors who watched this lecture also watched...
SEE ALSO:
Link this page
Would you like to put a link to this lecture on your homepage?Go ahead! Copy the HTML snippet !




