Research Explorer
Papers
Conferences
Authors
Topics
Keywords
Trends
Achievements
Explore
← Applications
Reinforcement Learning
›
Applications
›
Value Iteration
306 directly classified papers
Papers per year
2002: 3
2005: 3
2007: 1
2008: 1
2009: 2
2010: 1
2011: 1
2012: 5
2013: 4
2014: 3
2015: 7
2016: 10
2017: 9
2018: 20
2019: 33
2020: 47
2021: 39
2022: 37
2023: 42
2024: 23
2025: 13
2026: 2
Papers
Answers Unite! Unsupervised Metrics for Reinforced Summarization Models
EMNLP 2019
An Entity-Driven Framework for Abstractive Summarization
EMNLP 2019
Tight Regret Bounds for Model-Based Reinforcement Learning with Greedy Policies
NIPS 2019
Explicit Planning for Efficient Exploration in Reinforcement Learning
NIPS 2019
Value Function in Frequency Domain and the Characteristic Value Iteration Algorithm
NIPS 2019
Budgeted Reinforcement Learning in Continuous State Space
NIPS 2019
Privacy-Preserving Q-Learning with Functional Noise in Continuous Spaces
NIPS 2019
Planning in entropy-regularized Markov decision processes and games
NIPS 2019
Off-Policy Deep Reinforcement Learning by Bootstrapping the Covariate Shift
AAAI 2019
From Complexity to Simplicity: Adaptive ES-Active Subspaces for Blackbox Optimization
NIPS 2019
Sampling Networks and Aggregate Simulation for Online POMDP Planning
NIPS 2019
Policy and Value Transfer in Lifelong Reinforcement Learning
ICML 2018
Finite Sample Analysis of LSTD with Random Projections and Eligibility Traces
IJCAI 2018
Scalable Bilinear Pi Learning Using State and Action Features
ICML 2018
Efficient Bias-Span-Constrained Exploration-Exploitation in Reinforcement Learning
ICML 2018
Optimal Multi-robot Task Planning: from Synthesis to Execution (and Back)
IJCAI 2018
Learning to search with MCTSnets
ICML 2018
Temporal Regularization for Markov Decision Process
NIPS 2018
Fighting Boredom in Recommender Systems with Linear Reinforcement Learning
NIPS 2018
Planning and Learning with Stochastic Action Sets
IJCAI 2018
Computational Approaches for Stochastic Shortest Path on Succinct MDPs
IJCAI 2018
rho-POMDPs have Lipschitz-Continuous epsilon-Optimal Value Functions
NIPS 2018
Goal-HSVI: Heuristic Search Value Iteration for Goal POMDPs
IJCAI 2018
Organizing Experience: a Deeper Look at Replay Mechanisms for Sample-Based Planning in Continuous State Domains
IJCAI 2018
Dynamic Resource Routing using Real-Time Dynamic Programming
IJCAI 2018
<
1
…
9
10
11
12
13
>