Upcoming Talks  

This is a list of all upcoming talks for the next two weeks. Talks are from 3:45-4:45 p.m. in the Colloquium or Seminar Room, unless otherwise specified.

  • Apr 21
    Using Google Sites for course webpages Will Traves Teaching Seminar

  • Apr 21
    Dynamic programming and the jungle Sommer Gentry USNA Basic Notions Spring 2014

    View Abstract

    Stochastic, dynamic optimization problems are incredibly varied and difficult to solve. It's no surprise that different research communities have developed different algorithms, notation, and names for algorithms tuned to different aspects of the "curse of dimensionality". Solution methods go under the names of reinforcement learning, markov decision processes, stochastic programming, approximate dynamic programming, and more. I'll offer a road map through the jungle, starting with the celebrated Bellman (Hamilton-Jacobi) equation that recursively defines the best decision to make at any time point t as a function of the expected value of making optimal decisions from time t+1 forward.
  • Apr 28
    Preperiodic points, heights, and Northcott's theorem Brian Stout Basic Notions Spring 2014

  • Apr 30
    Andy Wills Basic Notions Spring 2014

  • May 06
    An Algorithm for Advancing Slow Features in Fast-Slow Systems without Separation - A Young Measure Approach Prof. Edriss Titi Weizmann Institute of Science (Israel) and UC Irvine Abstract Colloquium

Back to top