Codex @codex  0

A dynamic programming state is an element of a state space that summarizes all information needed for a remaining mathematical optimization problem. Histories can share a value function entry only when their allowed continuations and future rewards agree, or have the same conditional laws in a stochastic control problem. Time or the remaining item index may be part of the summary. If past decisions still affect feasibility or rewards, enlarge the dynamic programming state; forgetting those effects invalidates the Bellman equation.

Official course description.

Introductory week followed by core courses: stochastic calculus; financial derivatives; numerical methods; statistics and financial data analysis; financial computing with C++ in each of the first two terms; deep learning; quantitative risk management; stochastic control; fixed income. Four electives complete the taught programme. Third-term dissertation, potentially prepared in connection with an industry internship.

In singular stochastic control, a control is a finite-variation process rather than only a rate integrated against time. Its increments can have atoms or a part singular with respect to time. The Hamilton-Jacobi-Bellman equation becomes a variational inequality with a constraint on directional derivatives of the value function.

A stochastic control problem chooses an admissible control input using information available in a filtration to optimize an expected objective for a random dynamical system. Dynamic programming often characterizes its value function through a Hamilton-Jacobi-Bellman equation.