COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. |
University of Cambridge > Talks.cam > Applied and Computational Analysis > Multiply accelerated value iteration for affine fixed point problems and application to Markov decision processes
Multiply accelerated value iteration for affine fixed point problems and application to Markov decision processesAdd to your list(s) Download to your calendar using vCal
If you have a question about this talk, please contact Hamza Fawzi. We analyze a modified version of Nesterov accelerated gradient algorithm, which applies to affine fixed point problems with non self-adjoint matrices, such as the ones appearing in the theory of Markov decision processes with discounted or mean payoff criteria. We characterize the spectra of matrices for which this algorithm does converge with an accelerated asymptotic rate. We also introduce a dth-order algorithm, and show that it yields a multiply accelerated rate under more demanding conditions on the spectrum. We subsequently apply these methods to develop accelerated schemes for non-linear fixed point problems arising from Markov decision processes. This talk is part of the Applied and Computational Analysis series. This talk is included in these lists:
Note that ex-directory lists are not shown. |
Other listsDepartment of Public Health and Primary Care Heritage Research Group Annual Fair techhOther talksGroup Work Life and death of cells a mystery solved through biomechanics Medicine workers in the mountains: upland gatherers in the Min River Valley and China's natural medicinal products trade, 1890–1960 Excited states, symmetry breaking, and multiple solutions in electronic structure theory The Mars 2020 Perseverance Rover and the search for life on ancient Mars Fire, Culture, and Society: Excavations at the MIS 11 site of Barnham, Suffolk |