The following pages link to (Q3096132):
Displaying 19 items.
- Batch mode reinforcement learning based on the synthesis of artificial trajectories (Q378762) (← links)
- A convex optimization approach to dynamic programming in continuous state and action spaces (Q831365) (← links)
- Approximate dynamic programming with a fuzzy parameterization (Q980910) (← links)
- Adaptive-resolution reinforcement learning with polynomial exploration in deterministic domains (Q1959632) (← links)
- A linear programming methodology for approximate dynamic programming (Q2023646) (← links)
- Solving dynamic discrete choice models using smoothing and sieve methods (Q2043237) (← links)
- Multi-agent reinforcement learning: a selective overview of theories and algorithms (Q2094040) (← links)
- Toward theoretical understandings of robust Markov decision processes: sample complexity and asymptotics (Q2112808) (← links)
- Batch policy learning in average reward Markov decision processes (Q2112817) (← links)
- Recovery of simultaneous low rank and two-way sparse coefficient matrices, a nonconvex approach (Q2286374) (← links)
- Approximate dynamic programming for stochastic \(N\)-stage optimization with application to optimal consumption under uncertainty (Q2450902) (← links)
- Efficient approximate dynamic programming based on design and analysis of computer experiments for infinite-horizon optimization (Q2664400) (← links)
- Empirical Dynamic Programming (Q2806811) (← links)
- A review of stochastic algorithms with continuous value function approximation and some new approximate policy iteration algorithms for multidimensional continuous applications (Q2887630) (← links)
- Dynamic Programming Deconstructed: Transformations of the Bellman Equation and Computational Efficiency (Q5031647) (← links)
- Quadratic approximate dynamic programming for input‐affine systems (Q5409145) (← links)
- Analyzing Approximate Value Iteration Algorithms (Q5868951) (← links)
- Variational actor-critic algorithms, (Q6102338) (← links)
- Target Network and Truncation Overcome the Deadly Triad in \(\boldsymbol{Q}\)-Learning (Q6148353) (← links)
