The Number of Trials Matters in Infinite-Horizon General-Utility Markov Decision Processes
Not on the map. Why?
Abstract (arXiv)
The general-utility Markov decision processes (GUMDPs) framework generalizes the MDPs framework by considering objective functions that depend on the frequency of visitation of state-action 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.
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 10 of its 41 references that are in the map. First posted on arXiv 23 Sep 2024.
Builds on
10 of 41 references.
References · 10
- 2015Continuous control with deep reinforcement learningcited by 3,279
- 2013Playing Atari with Deep Reinforcement Learningcited by 3,211
- 2018Diversity is All You Need: Learning Skills without a Reward Functioncited by 734
- 2018An Algorithmic Perspective on Imitation Learningcited by 455
- 2018Provably Efficient Maximum Entropy Explorationcited by 240
- 2020Exploration-Exploitation in Constrained MDPscited by 146
- 2018Variational Option Discovery Algorithmscited by 121
- 2020Variational Policy Gradient Method for Reinforcement Learning with General Utilitiescited by 108
- 2021Reward is enough for convex MDPscited by 82
- 2021Concave Utility Reinforcement Learning: the Mean-Field Game Viewpointcited by 54
Built on by
Citing papers per year: 2025: 1; 2026: 2.
3 papers.
- 2026Active Inference as a Convex Markov Decision Process22 Jul 2026
- 2026Global Optimality for Constrained Exploration via Penalty Regularization30 Apr 2026
- 2025The Geometry of Nonlinear Reinforcement Learning1 Sep 2025