Finite Time Analysis of Risk-Sensitive RL via Noisy Power Iteration
Finite-time stochastic-approximation guarantees are established for finite-time bounds on the recovered eigenvector and eigenvalue with $\tilde{O}(\epsilon^{-2})$ sample complexity up to problem-dependent constants for risk-sensitive average-cost reinforcement learning with exponential utility.