Model-Based or Model-Free, a Review of Approaches in Reinforcement Learning
The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Abstract
Reinforcement learning (RL) algorithms can successfully solve a wide range of problems that we faced. Because of the Alpha Go against KeJie in 2017, the topic of RL has reached the completed new level of public opinion. Usually, reinforcement learning includes two categories, model-based method and model-free method, each of which shows unique advantages. Model-free RL can successfully solve various tasks, which can play video games and solve robotic tasks, but requires many samples to realize good performance. Model-based RL can quickly obtain near-optimal control by learning the model in a rather limited class of dynamics. In this situation, knowledge about the environment can be acquired in an unsupervised setting, even in trajectories where no rewards are available. However, its disadvantages lie in that most modelbased algorithms learn local models over-fitting several samples by depending on simple functional approximators, usually one mini-batch. The main body of this paper is going to summarize the classic algorithms in RL. Also, in the discussion part, new approaches are discussed, to keep the strength in model-based and model-free algorithms.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Proximal Policy Optimization Algorithms
Schulman, J., Wolski, F., Dhariwal, P., Radford, A., & Klimov, O. (2017) · arXiv · doi:10.48550/arxiv.1707.06347 · Cited by 10,625
Some Studies in Machine Learning Using the Game of Checkers
Samuel, A. L. (1959) · IBM Journal of Research and Development · doi:10.1147/rd.33.0210 · Cited by 4,443
Distributional Reinforcement Learning With Quantile Regression
Dabney, W., Rowland, M., Bellemare, M., & Munos, R. (2018) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v32i1.11791 · Cited by 612
Cited by
Optimized glycemic control of type 2 diabetes with reinforcement learning: a proof-of-concept trial
Wang, G., Liu, X., Ying, Z., Yang, G., Chen, Z., Liu, Z., Zhang, M., Yan, H., Lu, Y., Gao, Y., et al. (2023) · Nature Medicine · doi:10.1038/s41591-023-02552-9 · Cited by 156
“As safety is a primary concern in complex or long-term treatment scenarios, model-based RL might offer potential in simulating diverse scenarios, thereby providing reliable forward planning at decision time 22 .”
BackgroundMotion Planning for Mobile Robots—Focusing on Deep Reinforcement Learning: A Systematic Review
Sun, H., Zhang, W., Yu, R., & Zhang, Y. (2021) · IEEE Access · doi:10.1109/access.2021.3076530 · Cited by 143
Chen, Q., & Heydari, B. (2022) · Journal of Mechanical Design · doi:10.1115/1.4055057 · Cited by 12
The Sos Conductor: Orchestrating Resources With Iterative Agent-Based Reinforcement Learning
Chen, Q., & Heydari, B. (2024) · Systems Engineering · doi:10.1002/sys.21747 · Cited by 5
General agents contain world models
Richens, J., Abel, D., Bellot, A., & Everitt, T. (2025) · arXiv · doi:10.48550/arxiv.2506.01622 · Cited by 30
Metadata
- Authors
- Huang, Q.
- Venue
- 2020 International Conference on Computing and Data Science (CDS)
- Publisher
- IEEE
- Published
- 2020-08
- Pages
- 219-221
- OpenAlex
- W3112291329
- Cited by
- 52
- References
- 3
- FWCI
- 1.41
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Model-Based or Model-Free, a Review of Approaches in Reinforcement Learning. https://app.cochat.ai/papers/10.1109/cds49703.2020.00051
- The paper
- Huang, Q. (2020). Model-Based or Model-Free, a Review of Approaches in Reinforcement Learning. 2020 International Conference on Computing and Data Science (CDS). https://doi.org/10.1109/cds49703.2020.00051
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.