conftrace_

discount factor

28 papers

Explore in graph

Co-occurring keywords

reinforcement learning (4352) markov decision process (790) value function (295) sample complexity (1169) policy optimization (657) dynamic programming (274) value iteration (162) convergence rate (607) markov decision processes (25) bellman equation (42)

Papers

On Shallow Planning Under Partial Observability AAAI 2025
Sample Complexity of the Linear Quadratic Regulator: A Reinforcement Learning Lens JMLR 2025
On the uniqueness of solution for the Bellman equation of LTL objectives L4DC 2024
Span-Based Optimal Sample Complexity for Weakly Communicating and General Average Reward MDPs NIPS 2024
Reducing Blackwell and Average Optimality to Discounted MDPs via the Blackwell Discount Factor NIPS 2023
Correcting discount-factor mismatch in on-policy policy gradient methods ICML 2023
Optimal Convergence Rate for Exact Policy Mirror Descent in Discounted Markov Decision Processes NIPS 2023
Robust Average-Reward Markov Decision Processes AAAI 2023
On the Role of Discount Factor in Offline Reinforcement Learning ICML 2022
State-Wise Adaptive Discounting from Experience (SADE): A Novel Discounting Scheme for Reinforcement Learning (Student Abstract) AAAI 2021
Taylor Expansion of Discount Factors ICML 2021
PID Accelerated Value Iteration Algorithm ICML 2021
Solving Discounted Stochastic Two-Player Games with Near-Optimal Time and Sample Complexity AISTATS 2020
Discount Factor as a Regularizer in Reinforcement Learning ICML 2020
Off-Policy Deep Reinforcement Learning by Bootstrapping the Covariate Shift AAAI 2019
Optimal Pricing in Repeated Posted-Price Auctions with Different Patience of the Seller and the Buyer NIPS 2019
Rethinking the Discount Factor in Reinforcement Learning: A Decision Theoretic Approach AAAI 2019
Separating value functions across time-scales ICML 2019
Per-Decision Option Discounting ICML 2019
Using a Logarithmic Mapping to Enable Lower Discount Factors in Reinforcement Learning NIPS 2019
On the Use of Non-Stationary Strategies for Solving Two-Player Zero-Sum Markov Games AISTATS 2016
Optimistic Gittins Indices NIPS 2016
Improved and Generalized Upper Bounds on the Complexity of Policy Iteration NIPS 2013
On the Use of Non-Stationary Policies for Stationary Infinite-Horizon Markov Decision Processes NIPS 2012
Basis Construction from Power Series Expansions of Value Functions NIPS 2010