Pages that link to "Item:Q1604816"

The following pages link to A sparse sampling algorithm for near-optimal planning in large Markov decision processes (Q1604816):

Displaying 19 items.

• Testing probabilistic equivalence through reinforcement learning (Q383369) (← links)
• Knows what it knows: a framework for self-aware learning (Q413843) (← links)
• An anytime multistep anticipatory algorithm for online stochastic combinatorial optimization (Q545555) (← links)
• A variable neighborhood search based algorithm for finite-horizon Markov decision processes (Q613296) (← links)
• Reducing reinforcement learning to KWIK online regression (Q616761) (← links)
• Solving factored MDPs using non-homogeneous partitions (Q814475) (← links)
• Safe learning for near-optimal scheduling (Q832074) (← links)
• APPSSAT: Approximate probabilistic planning using stochastic satisfiability (Q997058) (← links)
• Planning in hybrid relational MDPs (Q1699911) (← links)
• Learning and planning in partially observable environments without prior domain knowledge (Q2076979) (← links)
• Solving for Best Responses and Equilibria in Extensive-Form Games with Reinforcement Learning Methods (Q3299845) (← links)
• Variance Reduced Value Iteration and Faster Algorithms for Solving Markov Decision Processes (Q4607932) (← links)
• (Q4636970) (← links)
• Nonasymptotic Analysis of Monte Carlo Tree Search (Q5060499) (← links)
• (Q5089307) (← links)
• Provably Near-Optimal Approximation Schemes for Implicit Stochastic and Sample-Based Dynamic Programs (Q5148198) (← links)
• Simulation-based search (Q6198646) (← links)
• Optimality guarantees for particle belief approximation of POMDPs (Q6488812) (← links)
• The costs of overcrowding (and release): strategic discharges for isolated facilities during epidemiological outbreaks (Q6561221) (← links)