Challenging Common Assumptions in Convex Reinforcement Learning
On the map: Offline RL and imitation learning from data → Offline RL algorithms
Abstract (arXiv)
The classic Reinforcement Learning (RL) formulation concerns the maximization of a scalar reward function. More recently, convex RL has been introduced to extend the RL formulation to all the objectives that are convex functions of the state distribution induced by a policy. Notably, convex RL covers several relevant applications that do not fall into the scalar formulation, including imitation learning, risk-averse RL, and pure exploration. In classic RL, it is common to optimize an infinite trials objective, which accounts for the state distribution instead of the empirical state visitation frequencies, even though the actual number of trajectories is always finite in practice. This is theoretically sound since the infinite trials and finite trials objectives can be proved to coincide and thus lead to the same optimal policy. In this paper, we show that this hidden assumption does not hold in the convex RL setting. In particular, we show that erroneously optimizing the infinite trials objective in place of the actual finite trials one, as it is usually done, can lead to a significant approximation error. Since the finite trials setting is the default in both simulated and real-world RL, we believe shedding light on this issue will lead to better approaches and methodologies for convex RL, impacting relevant research areas such as imitation learning, risk-averse RL, and pure exploration among others.
Key facts. Cited by 29 papers in the map (data through 7 Oct 2026). Placed in Offline RL algorithms, one of 13 directions in Offline RL and imitation learning from data. Builds on 40 of its 75 references that are in the map. First posted on arXiv 3 Feb 2022.
Builds on
40 of 75 references.
References · 40
- 2016Generative Adversarial Imitation Learningcited by 1,576
- 2017Constrained Policy Optimizationcited by 928
- 2018Diversity is All You Need: Learning Skills without a Reward Functioncited by 734
- 2018An Algorithmic Perspective on Imitation Learningcited by 455
- 2015Risk-Constrained Reinforcement Learning with Percentile Risk Criteriacited by 320
- 2019Dynamics-Aware Unsupervised Discovery of Skillscited by 308
- 2016Variational Intrinsic Controlcited by 262
- 2018Provably Efficient Maximum Entropy Explorationcited by 240
- 2019A Divergence Minimization Perspective on Imitation Learning Methodscited by 188
- 2019Efficient Exploration via State Marginal Matchingcited by 186
- 2019Imitation Learning via Off-Policy Distribution Matchingcited by 182
- 2021Reinforcement Learning with Prototypical Representationscited by 179
28 more
- 2021Behavior From the Void: Unsupervised Active Pre-Trainingcited by 173
- 2015Risk-Sensitive and Robust Decision-Making: a CVaR Optimization Approachcited by 162
- 2019Fast Task Inference with Variational Intrinsic Successor Featurescited by 131
- 2020Explore, Discover and Learn: Unsupervised Discovery of State-Covering Skillscited by 120
- 2020Primal Wasserstein Imitation Learningcited by 120
- 2021APS: Active Pretraining with Successor Featurescited by 109
- 2020Variational Policy Gradient Method for Reinforcement Learning with General Utilitiescited by 108
- 2021State Entropy Maximization with Random Encoders for Efficient Explorationcited by 107
- 2021Reward is enough for convex MDPscited by 82
- 2015Policy Gradient for Coherent Risk Measurescited by 74
- 2021On the Expressivity of Markov Rewardcited by 71
- 2019Reinforcement Learning with Convex Constraintscited by 57
- 2021Concave Utility Reinforcement Learning: the Mean-Field Game Viewpointcited by 54
- 2019Risk-Averse Trust Region Optimization for Reward-Volatility Reductioncited by 53
- 2021Achieving Zero Constraint Violation for Constrained Reinforcement Learning via Primal-Dual Approachcited by 46
- 2020Reinforcement Learning with Trajectory Feedbackcited by 40
- 2020Constrained episodic reinforcement learning in concave-convex and knapsack settingscited by 33
- 2021Geometric Entropic Explorationcited by 32
- 2021On the Theory of Reinforcement Learning with Once-per-Episode Feedbackcited by 32
- 2020Mean-Variance Policy Iteration for Risk-Averse Reinforcement Learningcited by 28
- 2019Active Exploration in Markov Decision Processescited by 27
- 2021Density Constrained Reinforcement Learningcited by 25
- 2021Wasserstein Unsupervised Reinforcement Learningcited by 21
- 2019An Intrinsically-Motivated Approach for Learning Highly Exploring and Fast Mixing Policiescited by 20
- 2021Provably Efficient Algorithms for Multi-Objective Competitive RLcited by 20
- 2021Unsupervised Reinforcement Learning in Multiple Environmentscited by 17
- 2013Variance Adjusted Actor Critic Algorithmscited by 10
- 2019Exploration-Exploitation Trade-off in Reinforcement Learning on Online Markov Decision Processes with Global Concave Rewardscited by 8
Built on by
Citing papers per year: 2022: 2; 2023: 5; 2024: 8; 2025: 6; 2026: 8.
29 papers.
Sort:
By area:
- 2022Discovering Policies with DOMiNO: Diversity Optimization Maintaining Near Optimalitycited by 35
- 2023Submodular Reinforcement Learningcited by 23
- 2024Learning diffusion at lightspeedcited by 21
- 2023Reinforcement Learning with General Utilities: Simpler Variance Reduction and Large State-Action Spacecited by 18
- 2023Reinforcement Learning in Low-Rank MDPs with Density Featurescited by 17
- 2023Diversifying AI: Towards Creative Chess with AlphaZerocited by 15
- 2024Global Reinforcement Learning: Beyond Linear and Convex Rewards via Submodular Semi-gradient Methodscited by 15
- 2025Flow Density Control: Generative Optimization Beyond Entropy-Regularized Fine-Tuningcited by 15
- 2024Three Dogmas of Reinforcement Learningcited by 14
- 2023A Coupled Flow Approach to Imitation Learningcited by 12
- 2025Provable Maximum Entropy Manifold Exploration via Diffusion Modelscited by 12
- 2024On the Limitations of Markovian Rewards to Express Multi-Objective, Risk-Sensitive, and Modal Taskscited by 9
17 more
- 2022Policy Gradient for Reinforcement Learning with General Utilitiescited by 6
- 2024The Limits of Pure Exploration in POMDPs: When the Observation Entropy is Enoughcited by 6
- 2024Geometric Active Exploration in Markov Decision Processes: the Benefit of Abstractioncited by 6
- 2024On the Global Optimality of Policy Gradient Methods in General Utility Reinforcement Learningcited by 6
- 2026Verifier-Constrained Flow Expansion for Discovery Beyond the Datacited by 6
- 2026Efficient Tail-Aware Generative Optimization via Flow Model Fine-Tuningcited by 6
- 2025Towards Principled Unsupervised Multi-Agent Reinforcement Learningcited by 4
- 2025Enhancing Diversity in Parallel Agents: A Maximum State Entropy Exploration Storycited by 4
- 2024Convex Markov Games: A New Frontier for Multi-Agent Reinforcement Learningcited by 3
- 2025Motion Control in Multi-Rotor Aerial Robots Using Deep Reinforcement Learningcited by 2
- 2026Soft Forward-Backward Representations for Zero-shot Reinforcement Learning with General Utilitiescited by 2
- 2026A Unified Density Operator View of Flow Control and Mergingcited by 2
- 2026Active Inference as a Convex Markov Decision Processcited by 1
- 2025Online Episodic Convex Reinforcement Learningcited by 0
- 2026Global Optimality for Constrained Exploration via Penalty Regularizationcited by 0
- 2026Theoretical Foundations of max@k Reinforcement Learningcited by 0
- 2026The Dually Flat Geometry of Planning as Inferencecited by 0
- 2026The Dually Flat Geometry of Planning as Inference3 Sep 2026
- 2026Active Inference as a Convex Markov Decision Process22 Jul 2026
- 2026Theoretical Foundations of max@k Reinforcement Learning20 Jul 2026
- 2026Global Optimality for Constrained Exploration via Penalty Regularization30 Apr 2026
- 2026Efficient Tail-Aware Generative Optimization via Flow Model Fine-Tuning18 Feb 2026
- 2026Verifier-Constrained Flow Expansion for Discovery Beyond the Data17 Feb 2026
- 2026A Unified Density Operator View of Flow Control and Merging8 Feb 2026
- 2026Soft Forward-Backward Representations for Zero-shot Reinforcement Learning with General Utilities6 Feb 2026
- 2025Flow Density Control: Generative Optimization Beyond Entropy-Regularized Fine-Tuning27 Nov 2025
- 2025Provable Maximum Entropy Manifold Exploration via Diffusion Models18 Jun 2025
- 2025Online Episodic Convex Reinforcement Learning12 May 2025
- 2025Enhancing Diversity in Parallel Agents: A Maximum State Entropy Exploration Story2 May 2025
17 more
- 2025Towards Principled Unsupervised Multi-Agent Reinforcement Learning12 Feb 2025
- 2025Motion Control in Multi-Rotor Aerial Robots Using Deep Reinforcement Learning9 Feb 2025
- 2024Convex Markov Games: A New Frontier for Multi-Agent Reinforcement Learning22 Oct 2024
- 2024On the Global Optimality of Policy Gradient Methods in General Utility Reinforcement Learning5 Oct 2024
- 2024Geometric Active Exploration in Markov Decision Processes: the Benefit of Abstraction18 Jul 2024
- 2024Three Dogmas of Reinforcement Learning15 Jul 2024
- 2024Global Reinforcement Learning: Beyond Linear and Convex Rewards via Submodular Semi-gradient Methods13 Jul 2024
- 2024The Limits of Pure Exploration in POMDPs: When the Observation Entropy is Enough18 Jun 2024
- 2024Learning diffusion at lightspeed18 Jun 2024
- 2024On the Limitations of Markovian Rewards to Express Multi-Objective, Risk-Sensitive, and Modal Tasks26 Jan 2024
- 2023Diversifying AI: Towards Creative Chess with AlphaZero17 Aug 2023
- 2023Submodular Reinforcement Learning25 Jul 2023
- 2023Reinforcement Learning with General Utilities: Simpler Variance Reduction and Large State-Action Space2 Jun 2023
- 2023A Coupled Flow Approach to Imitation Learning29 Apr 2023
- 2023Reinforcement Learning in Low-Rank MDPs with Density Features4 Feb 2023
- 2022Policy Gradient for Reinforcement Learning with General Utilities3 Oct 2022
- 2022Discovering Policies with DOMiNO: Diversity Optimization Maintaining Near Optimality26 May 2022
- 2025Flow Density Control: Generative Optimization Beyond Entropy-Regularized Fine-Tuningcited by 15
- 2025Provable Maximum Entropy Manifold Exploration via Diffusion Modelscited by 12
- 2026Verifier-Constrained Flow Expansion for Discovery Beyond the Datacited by 6
- 2026A Unified Density Operator View of Flow Control and Mergingcited by 2
- 2026Verifier-Constrained Flow Expansion for Discovery Beyond the Data17 Feb 2026
- 2026A Unified Density Operator View of Flow Control and Merging8 Feb 2026
- 2025Flow Density Control: Generative Optimization Beyond Entropy-Regularized Fine-Tuning27 Nov 2025
- 2025Provable Maximum Entropy Manifold Exploration via Diffusion Models18 Jun 2025
- 2026Theoretical Foundations of max@k Reinforcement Learningcited by 0
- 2026Theoretical Foundations of max@k Reinforcement Learning20 Jul 2026
- 2022Discovering Policies with DOMiNO: Diversity Optimization Maintaining Near Optimalitycited by 35
- 2023Submodular Reinforcement Learningcited by 23
- 2024Learning diffusion at lightspeedcited by 21
- 2023Reinforcement Learning with General Utilities: Simpler Variance Reduction and Large State-Action Spacecited by 18
- 2023Reinforcement Learning in Low-Rank MDPs with Density Featurescited by 17
- 2023Diversifying AI: Towards Creative Chess with AlphaZerocited by 15
- 2024Global Reinforcement Learning: Beyond Linear and Convex Rewards via Submodular Semi-gradient Methodscited by 15
- 2024Three Dogmas of Reinforcement Learningcited by 14
- 2024On the Limitations of Markovian Rewards to Express Multi-Objective, Risk-Sensitive, and Modal Taskscited by 9
- 2022Policy Gradient for Reinforcement Learning with General Utilitiescited by 6
- 2024The Limits of Pure Exploration in POMDPs: When the Observation Entropy is Enoughcited by 6
- 2024Geometric Active Exploration in Markov Decision Processes: the Benefit of Abstractioncited by 6
12 most cited of 22 All 22 (JSON)
- 2026The Dually Flat Geometry of Planning as Inference3 Sep 2026
- 2026Active Inference as a Convex Markov Decision Process22 Jul 2026
- 2026Global Optimality for Constrained Exploration via Penalty Regularization30 Apr 2026
- 2026Efficient Tail-Aware Generative Optimization via Flow Model Fine-Tuning18 Feb 2026
- 2026Soft Forward-Backward Representations for Zero-shot Reinforcement Learning with General Utilities6 Feb 2026
- 2025Online Episodic Convex Reinforcement Learning12 May 2025
- 2025Enhancing Diversity in Parallel Agents: A Maximum State Entropy Exploration Story2 May 2025
- 2025Towards Principled Unsupervised Multi-Agent Reinforcement Learning12 Feb 2025
- 2025Motion Control in Multi-Rotor Aerial Robots Using Deep Reinforcement Learning9 Feb 2025
- 2024Convex Markov Games: A New Frontier for Multi-Agent Reinforcement Learning22 Oct 2024
- 2024Geometric Active Exploration in Markov Decision Processes: the Benefit of Abstraction18 Jul 2024
- 2024Three Dogmas of Reinforcement Learning15 Jul 2024
12 newest of 22 All 22 (JSON)
Similar, not cited
Close in wording, no citation either way
- 2025Statistical and Algorithmic Foundations of Reinforcement Learning
- 2026Maximum Likelihood Reinforcement Learning
- 2023Dual RL: Unification and New Methods for Reinforcement and Imitation Learning
- 2022On Practical Reinforcement Learning: Provable Robustness, Scalability, and Statistical Efficiency
- 2021On Multi-objective Policy Optimization as a Tool for Reinforcement Learning: Case Studies in Offline RL and Finetuning
- 2024Hybrid Reinforcement Learning Breaks Sample Size Barriers in Linear MDPs
- 2023Minimax-Optimal Reward-Agnostic Exploration in Reinforcement Learning
- 2024Towards Sample-Efficiency and Generalization of Transfer and Inverse Reinforcement Learning: A Comprehensive Literature Review