REVIEW 4 cited by
Agnostic System Identification for Model-Based Reinforcement Learning
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
Agnostic System Identification for Model-Based Reinforcement Learning
read the original abstract
A fundamental problem in control is to learn a model of a system from observations that is useful for controller synthesis. To provide good performance guarantees, existing methods must assume that the real system is in the class of models considered during learning. We present an iterative method with strong guarantees even in the agnostic case where the system is not in the class. In particular, we show that any no-regret online learning algorithm can be used to obtain a near-optimal policy, provided some model achieves low training error and access to a good exploration distribution. Our approach applies to both discrete and continuous domains. We demonstrate its efficacy and scalability on a challenging helicopter domain from the literature.
Forward citations
Cited by 4 Pith papers
-
Learning Interactive Real-World Simulators
UniSim learns a universal real-world simulator from orchestrated diverse datasets, enabling zero-shot deployment of policies trained purely in simulation.
-
Stationary Robust Mean-Field Games under Model Mismatches
Develops infinite-horizon stationary robust mean-field games incorporating distributional uncertainty, proves equilibrium existence via fixed-point on contractive Bellman operator, gives convergent algorithm, and deri...
-
Regularized Offline Policy Optimization with Posterior Hybrid Bayesian Belief
PhyB approximates Bayesian expectations in offline RL as convex combinations over dynamics model subsets with bounded discrepancy, enabling regularized policy optimization with monotonic improvement guarantees.
-
Regularized Offline Policy Optimization with Posterior Hybrid Bayesian Belief
PhyB averages over the k worst dynamics models with entropy-weighted coefficients and uses Bregman-regularized policy iteration; it claims bounded pessimism, monotonic improvement, and top D4RL scores.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.