The Number of Trials Matters in Infinite-Horizon General-Utility Markov Decision Processes
Pedro P. Santos, Alberto Sardinha, Francisco S. Melo
Abstract
The general-utility Markov decision processes (GUMDPs) framework generalizes the MDPs framework by considering objective functions that depend on the frequency of visitation of stateaction pairs induced by a given policy. In this work, we contribute with the first analysis on the impact of the number of trials, i.e., the number of randomly sampled trajectories, in infinite-horizon GUMDPs. We show that, as opposed to standard MDPs, the number of trials plays a key-role in infinite-horizon GUMDPs and the expected performance of a given policy depends, in general, on the number of trials. We consider both discounted and average GUMDPs, where the objective function depends, respectively, on discounted and average frequencies of visitation of state-action pairs. First, we study policy evaluation under discounted GUMDPs, proving lower and upper bounds on the mismatch between the finite and infinite trials formulations for GUMDPs. Second, we address average GUMDPs, studying how different classes of GUMDPs impact the mismatch between the finite and infinite trials formulations. Third, we provide a set of empirical results to support our claims, highlighting how the number of trajectories and the structure of the underlying GUMDP influence policy evaluation.
Ask Lune
Ask anything. The answer quotes the paper.
Lune reads all of it and the papers around it, then shows you the passages behind every answer.
Lune answers from
the full paper · 1 top-tier paper that cites it · related work
Free to start. No credit card required.
Cited by top-tier papers1
Builds on2
- Variational Policy Gradient Method for Reinforcement Learning with General UtilitiesJunyu Zhang, Alec Koppel, Amrit Singh Bedi, Csaba Szepesvári et al.NeurIPS 2020 · 170 citations
- Reward is enough for convex MDPsTom Zahavy, Brendan O'Donoghue, Guillaume Desjardins, Satinder SinghNeurIPS 2021 · 96 citations
Related papers
- Beyond Average Return in Markov Decision ProcessesAlexandre Marthe, Aurélien Garivier, Claire VernadeNeurIPS 2023 · 15 citations
- Towards Tight Bounds on the Sample Complexity of Average-reward MDPsYujia Jin, Aaron SidfordICML 2021 · 45 citations
- Efficiently Solving MDPs with Stochastic Mirror DescentYujia Jin, Aaron SidfordICML 2020 · 83 citations
- Infinite-horizon Off-Policy Policy Evaluation with Multiple Behavior PoliciesXinyun Chen, Lu Wang, Yizhe Hang, Heng Ge et al.ICLR 2020 · 5 citations
- A Maximum-Entropy Approach to Off-Policy Evaluation in Average-Reward MDPsNevena Lazic, Dong Yin, Mehrdad Farajtabar, Nir Levine et al.NeurIPS 2020 · 13 citations
