Pages that link to "Item:Q3186525"
From MaRDI portal
The following pages link to Improved and Generalized Upper Bounds on the Complexity of Policy Iteration (Q3186525):
Displaying 11 items.
- A polynomial time bound for Howard's policy improvement algorithm (Q1079511) (← links)
- Reduced complexity dynamic programming based on policy iteration (Q1206904) (← links)
- On high-order differentiability of the policy function (Q1341453) (← links)
- Modified policy iteration algorithms are not strongly polynomial for discounted dynamic programming (Q1785275) (← links)
- Improved bound on the worst case complexity of policy iteration (Q1785761) (← links)
- A complexity analysis of policy iteration through combinatorial matrices arising from unique sink orientations (Q2363352) (← links)
- Complexity bounds for approximately solving discounted MDPs by value iterations (Q2661516) (← links)
- On linear and super-linear convergence of natural policy gradient algorithm (Q2670744) (← links)
- On the reduction of total‐cost and average‐cost MDPs to discounted MDPs (Q3120606) (← links)
- (Q3730373) (← links)
- (Q5715663) (← links)