Nonlinear System Identification Using Coevolution of Models and Tests
The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Abstract
We present a coevolutionary algorithm for inferring the topology and parameters of a wide range of hidden nonlinear systems with a minimum of experimentation on the target system. The algorithm synthesizes an explicit model directly from the observed data produced by intelligently generated tests. The algorithm is composed of two coevolving populations. One population evolves candidate models that estimate the structure of the hidden system. The second population evolves informative tests that either extract new information from the hidden system or elicit desirable behavior from it. The fitness of candidate models is their ability to explain behavior of the target system observed in response to all tests carried out so far; the fitness of candidate tests is their ability to make the models disagree in their predictions. We demonstrate the generality of this estimation-exploration algorithm by applying it to four different problems-grammar induction, gene network inference, evolutionary robotics, and robot damage recovery-and discuss how it overcomes several of the pathologies commonly found in other coevolutionary algorithms. We show that the algorithm is able to successfully infer and/or manipulate highly nonlinear hidden systems using very few tests, and that the benefit of this approach increases as the hidden systems possess more degrees of freedom, or become more biased or unobservable. The algorithm provides a systematic method for posing synthesis or analysis tasks to a coevolutionary system.
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
Co-evolving parasites improve simulated evolution as an optimization procedure
Hillis, W. D. (1990) · Physica D: Nonlinear Phenomena · doi:10.1016/0167-2789(90)90076-2 · Cited by 780 · cited 1×
“[58]), starting with the seminal work of Hillis [ 29 ] on sorting networks.”
BackgroundA connectionist model of development
Mjolsness, E., Sharp, D. H., & Reinitz, J. (1991) · Journal of Theoretical Biology · doi:10.1016/s0022-5193(05)80391-1 · Cited by 434
A test case of correlation metric construction of a reaction pathway from measurements
Arkin, A., Shen, P., & Ross, J. (1997) · Science · doi:10.1126/science.277.5330.1275 · Cited by 291
Evolutionary Techniques in Physical Robotics
Pollack, J. B., Lipson, H., Ficici, S., Funes, P., Hornby, G., & Watson, R. A. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-46406-9_18 · Cited by 71 · cited 1×
“comprising the physical system [26]; evolving directly on the physical system ([23], [47] and [59]); evolving first in simulation followed by further adaptation on the physical robot ([47], [51]); or implementing some neural plasticity that allows the”
BackgroundSelf-citation
Cited by
Automated reverse engineering of nonlinear dynamical systems
Bongard, J., & Lipson, H. (2007) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0609476104 · Cited by 792
Self-citationResilient Machines Through Continuous Self-Modeling
Bongard, J., Zykov, V., & Lipson, H. (2006) · Science · doi:10.1126/science.1133687 · Cited by 709
Self-citationPreference-Inspired Coevolutionary Algorithms for Many-Objective Optimization
Wang, R., Purshouse, R. C., & Fleming, P. J. (2013) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2012.2204264 · Cited by 406
Kell, D. B. (2010) · Archives of Toxicology · doi:10.1007/s00204-010-0577-x · Cited by 361
The Transferability Approach: Crossing the Reality Gap in Evolutionary Robotics
Koos, S., Mouret, J.-B., & Doncieux, S. (2013) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2012.2185849 · Cited by 272
Preparing for the unknown: Learning a universal policy with online system identification
Yu, W., Tan, J., Karen Liu, C., & Turk, G. (2017) · Robotics: Science and Systems XIII · doi:10.15607/rss.2017.xiii.048 · Cited by 237
Preparing for the Unknown: Learning a Universal Policy with Online System Identification
Yu, W., Tan, J., Liu, C. K., & Turk, G. (2017) · arXiv · doi:10.48550/arxiv.1702.02453 · Cited by 237
“In practice, system identification is often interleaved with control policy optimization to minimize the number of required realworld experiments [3, 9, 5].”
BackgroundNolfi, S., Bongard, J., Husbands, P., & Floreano, D. (2016) · Springer Handbooks · doi:10.1007/978-3-319-32552-1_76 · Cited by 68
Self-citation
Metadata
- Authors
- Bongard, J. C., & Lipson, H.
- Venue
- IEEE Transactions on Evolutionary Computation
- Published
- 2005-08
- Volume
- 9
- Issue
- 4
- Pages
- 361-384
- ISSN
- 1089-778X (ISSN-L)
- OpenAlex
- W2144315657
- Cited by
- 130
- References
- 4
- FWCI
- 10.65
- Type
- journal article
- 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
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.