Proximal algorithms and temporal difference methods for solving fixed point problems

Recommendations

Proximal gradient temporal difference learning: stable reinforcement learning with polynomial sample complexity
On the existence of fixed points for approximate value iteration and temporal-difference learning
Linear least-squares algorithms for temporal difference learning
Publication:3035147
On the convergence of temporal-difference learning with linear function approximation

Cites work

scientific article; zbMATH DE number 3129777 (Why is no real title available?)
scientific article; zbMATH DE number 3846795 (Why is no real title available?)
scientific article; zbMATH DE number 3914081 (Why is no real title available?)
scientific article; zbMATH DE number 1321699 (Why is no real title available?)
scientific article; zbMATH DE number 3341597 (Why is no real title available?)
scientific article; zbMATH DE number 3365771 (Why is no real title available?)
scientific article; zbMATH DE number 6542806 (Why is no real title available?)
10.1162/1532443041827907
A Retrospective and Prospective Survey of the Monte Carlo Method
A note on the behavior of the randomized Kaczmarz algorithm of Strohmer and Vershynin
A randomized Kaczmarz algorithm with exponential convergence
Abstract dynamic programming
Algorithms for reinforcement learning.
An Analysis of Stochastic Shortest Path Problems
An analysis of temporal-difference learning with function approximation
Applications of a Splitting Algorithm to Decomposition in Convex Programming and Variational Inequalities
Approximate Dynamic Programming
Approximate dynamic programming with a fuzzy parameterization
Approximate policy iteration: a survey and some new methods
Convergence Results for Some Temporal Difference Methods Based on Least Squares
Convex analysis and monotone operator theory in Hilbert spaces
Convex optimization algorithms
Dynamic programming and optimal control. Vol. 2
Error bounds for approximations from projected linear equations
Fast Monte Carlo Algorithms for Matrices I: Approximating Matrix Multiplication
Fast Monte Carlo Algorithms for Matrices II: Computing a Low-Rank Approximation to a Matrix
Faster least squares approximation
Finite-Dimensional Variational Inequalities and Complementarity Problems
Gradient-based algorithms with applications to signal-recovery problems
Incremental constraint projection methods for variational inequalities
Least squares policy evaluation algorithms with linear function approximation
Least squares temporal difference methods: An analysis under general conditions
Linear least-squares algorithms for temporal difference learning
Monotone Operators and the Proximal Point Algorithm
Near-optimal column-based matrix reconstruction
On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
On the method of multipliers for convex programming
Optimal adaptive control and differential games by reinforcement learning principles
Performance bounds for $\lambda $ policy iteration and application to the game of Tetris
Projected equation methods for approximate solution of large linear systems
Q-learning and enhanced policy iteration in discounted dynamic programming
Q-learning and policy iteration algorithms for stochastic shortest path problems
Randomized methods for linear constraints: convergence rates and conditioning
Relative-Error $CUR$ Matrix Decompositions
Sampling algorithms for $l_2$ regression and applications
Splitting Algorithms for the Sum of Two Nonlinear Operators
Stabilization of stochastic iterative methods for singular and nearly singular linear systems
Technical update: Least-squares temporal difference learning
Temporal Difference Methods for General Projected Equations

Cited in

(5)

Proximal gradient temporal difference learning: stable reinforcement learning with polynomial sample complexity
The prox-Tikhonov-like forward-backward method and applications
Extension of $\lambda$-PIR for weakly contractive operators via fixed point theory
On the existence of fixed points for approximate value iteration and temporal-difference learning
A proximal algorithm with quasi distance. Application to habit's formation

Describes a project that uses

Uses Software

Approxrl

This page was built for publication: Proximal algorithms and temporal difference methods for solving fixed point problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q721950)