#dynamic-programming

Q-Value Iteration Finds Optimal Actions Faster Than Theory Predicts

Lee's switching system analysis reveals Q-VI reaches practical optimality in finite time, with convergence rates potentially faster than the classical discount factor bound.