Pages that link to "Item:Q1345144"

The following pages link to An upper bound on the loss from approximate optimal-value functions (Q1345144):

Displaying 8 items.

• Minimax PAC bounds on the sample complexity of reinforcement learning with a generative model (Q399890) (← links)
• Knows what it knows: a framework for self-aware learning (Q413843) (← links)
• Solving factored MDPs using non-homogeneous partitions (Q814475) (← links)
• Reinforcement learning algorithms with function approximation: recent advances and applications (Q903601) (← links)
• The loss from imperfect value functions in exceptation-based and minimax-based tasks (Q1911345) (← links)
• Restricted gradient-descent algorithm for value-function approximation in reinforcement learning (Q2389624) (← links)
• Target Network and Truncation Overcome the Deadly Triad in \(\boldsymbol{Q}\)-Learning (Q6148353) (← links)
• Optimality guarantees for particle belief approximation of POMDPs (Q6488812) (← links)