Skip to content
conftrace_

Value Iteration

383 papers

3
5
8
52
23
'5
'10
'15
'20
'25

Papers

Proper Value Equivalence NeurIPS 2021 Queue-Learning: A Reinforcement Learning Approach for Providing Quality of Service AAAI 2021 Reconciling Rewards with Predictive State Representations IJCAI 2021 Reinforcement Learning for Route Optimization with Robustness Guarantees IJCAI 2021 Reinforcement Learning with a Disentangled Universal Value Function for Item Recommendation AAAI 2021 Reward is enough for convex MDPs NeurIPS 2021 Robust Value Iteration for Continuous Control Tasks RSS 2021 Rough Terrain Navigation Using Divergence Constrained Model-Based Reinforcement Learning CoRL 2021 Self-Consistent Models and Values NeurIPS 2021 Self-Paced Context Evaluation for Contextual Reinforcement Learning ICML 2021 Temporally Abstract Partial Models NeurIPS 2021 Transfer Learning for Efficient Iterative Safety Validation AAAI 2021 Universal Off-Policy Evaluation NeurIPS 2021 Value Iteration in Continuous Actions, States and Time ICML 2021 When to stop value iteration: stability and near-optimality versus computation L4DC 2021 Approximate Inference in Discrete Distributions with Monte Carlo Tree Search and Value Functions AISTATS 2020 AsyncQVI: Asynchronous-Parallel Q-Value Iteration for Discounted Markov Decision Processes with Near-Optimal Sample Complexity AISTATS 2020 Bayesian Reinforcement Learning via Deep, Sparse Sampling AISTATS 2020 Breaking the Curse of Many Agents: Provable Mean Embedding Q-Iteration for Mean-Field Reinforcement Learning ICML 2020 Corpus-Level End-to-End Exploration for Interactive Systems AAAI 2020 Count-Based Exploration with the Successor Representation AAAI 2020 Data Valuation using Reinforcement Learning ICML 2020 Does the Markov Decision Process Fit the Data: Testing for the Markov Property in Sequential Decision Making ICML 2020 Efficiently Solving MDPs with Stochastic Mirror Descent ICML 2020 Efficient Planning in Large MDPs with Weak Linear Function Approximation NeurIPS 2020