Pith. sign in

REVIEW 1 cited by

Is Model Ensemble Necessary? Model-based RL via a Single Model with Lipschitz Regularized Value Function

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2302.01244 v1 pith:KBS3V4QU submitted 2023-02-02 cs.LG

classification cs.LG
keywords modelvaluedynamicsensemblefunctionlipschitzmodel-basedprobabilistic
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Probabilistic dynamics model ensemble is widely used in existing model-based reinforcement learning methods as it outperforms a single dynamics model in both asymptotic performance and sample efficiency. In this paper, we provide both practical and theoretical insights on the empirical success of the probabilistic dynamics model ensemble through the lens of Lipschitz continuity. We find that, for a value function, the stronger the Lipschitz condition is, the smaller the gap between the true dynamics- and learned dynamics-induced Bellman operators is, thus enabling the converged value function to be closer to the optimal value function. Hence, we hypothesize that the key functionality of the probabilistic dynamics model ensemble is to regularize the Lipschitz condition of the value function using generated samples. To test this hypothesis, we devise two practical robust training mechanisms through computing the adversarial noise and regularizing the value network's spectral norm to directly regularize the Lipschitz condition of the value functions. Empirical results show that combined with our mechanisms, model-based RL algorithms with a single dynamics model outperform those with an ensemble of probabilistic dynamics models. These findings not only support the theoretical insight, but also provide a practical solution for developing computationally efficient model-based RL algorithms.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Learn A Flexible Exploration Model for Parameterized Action Markov Decision Processes

    cs.LG 2025-01 reject novelty 4.0 of 10

    FLEXplore combines an L2 dynamics loss with a Wasserstein-style critic loss, FGSM reward smoothing, and a mutual-information auxiliary reward to improve sample efficiency in parameterized-action MDPs.

Pith tools