Robot Skill Learning: From Reinforcement Learning to Evolution Strategies
Open accessThe DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Abstract
Policy improvement methods seek to optimize the parameters of a policy with respect to a utility function. Owing to current trends involving searching in parameter space (rather than action space) and using reward-weighted averaging (rather than gradient estimation), reinforcement learning algorithms for policy improvement, e.g. PoWER and PI
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
Completely Derandomized Self-Adaptation in Evolution Strategies
Hansen, N., & Ostermeier, A. (2001) · Evolutionary Computation · doi:10.1162/106365601750190398 · Cited by 4,397
Reinforcement learning of motor skills with policy gradients
Peters, J., & Schaal, S. (2008) · Neural Networks · doi:10.1016/j.neunet.2008.02.003 · Cited by 831
Simple statistical gradient-following algorithms for connectionist reinforcement learning
Williams, R. J. (1992) · Machine Learning · doi:10.1023/a:1022672621406 · Cited by 817
Learning Stable Nonlinear Dynamical Systems With Gaussian Mixture Models
Khansari-Zadeh, S. M., & Billard, A. (2011) · IEEE Transactions on Robotics · doi:10.1109/tro.2011.2159412 · Cited by 771
Path integrals and symmetry breaking for optimal control theory
Kappen, H. J. (2005) · Journal of Statistical Mechanics Theory and Experiment · doi:10.1088/1742-5468/2005/11/p11011 · Cited by 309 · cited 1×
“We find it very striking that an algorithm that has been derived from stochastic optimal control with solution methods from quantum mechanics [13, 36] shares a common core with an older algorithm from the quite distinct field of evolution strategies.”
Background
Cited by
Meta-Learning in Neural Networks: A Survey
Hospedales, T., Antoniou, A., Micaelli, P., & Storkey, A. (2020) · arXiv · doi:10.48550/arxiv.2004.05439 · Cited by 886
“Many evolutionary algorithms have strong connections to reinforcement learning algorithms [194].”
Meta-Learning in Neural Networks: A Survey
Hospedales, T. M., Antoniou, A., Micaelli, P., & Storkey, A. J. (2021) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2021.3079209 · Cited by 886
State representation learning for control: An overview
Lesort, T., Díaz-Rodríguez, N., Goudou, J.-F., & Filliat, D. (2018) · Neural Networks · doi:10.1016/j.neunet.2018.07.006 · Cited by 301
Evolutionary Robotics: What, Why, and Where to
Doncieux, S., Bredeche, N., Mouret, J.-B., & Eiben, A. E. (. (2015) · Frontiers in Robotics and AI · doi:10.3389/frobt.2015.00004 · Cited by 275
Kernelized movement primitives
Huang, Y., Rozo, L., Silvério, J., & Caldwell, D. G. (2019) · The International Journal of Robotics Research · doi:10.1177/0278364919846363 · Cited by 261
Metadata
- Authors
- Stulp, F., & Sigaud, O.
- Venue
- Paladyn, Journal of Behavioral Robotics
- Publisher
- Walter de Gruyter GmbH
- Published
- 2013-01-01
- Volume
- 4
- Issue
- 1
- ISSN
- 2080-9778 (ISSN-L)
- 2081-4836
- OpenAlex
- W2085627234
- Cited by
- 132
- References
- 5
- FWCI
- 9.94
- Type
- journal article
- Language
- en
- Open access
- gold
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
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.