The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
AI Feynman: A physics-inspired method for symbolic regression
Open accessAbstract
Our physics-inspired algorithm for symbolic regression is able to discover complex physics equations from mere tables of numbers.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Genetic Programming: On the Programming of Computers by Means of Natural Selection
Koza, J. R. (1992) · Medical Entomology and Zoology · Cited by 13,082
Discovering governing equations from data by sparse identification of nonlinear dynamical systems
Brunton, S. L., Proctor, J. L., & Kutz, J. N. (2016) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1517384113 · Cited by 4,796
Classical Electrodynamics, 3rd ed .
Jackson, J. D., & Fox, R. F. (1999) · American Journal of Physics · doi:10.1119/1.19136 · Cited by 3,073
Gravitation and Cosmology: Principles and Applications of the General Theory of Relativity
Weinberg, S., & Wagoner, R. V. (1973) · Physics Today · doi:10.1063/1.3128097 · Cited by 3,031
Distilling Free-Form Natural Laws from Experimental Data
Schmidt, M., & Lipson, H. (2009) · Science · doi:10.1126/science.1165893 · Cited by 2,890
Super-convergence: very fast training of neural networks using large learning rates
Smith, L. N., & Topin, N. (2019) · Artificial Intelligence and Machine Learning for Multi-Domain Operations Applications · doi:10.1117/12.2520589 · Cited by 1,335
Quantum Field Theory and the Standard Model
Schwartz, M. D. (2013) · doi:10.1017/9781139540940 · Cited by 1,256
Smith, L. N. (2018) · arXiv · doi:10.48550/arxiv.1803.09820 · Cited by 790
Why Does Deep and Cheap Learning Work So Well?
Lin, H. W., Tegmark, M., & Rolnick, D. (2017) · Journal of Statistical Physics · doi:10.1007/s10955-017-1836-5 · Cited by 393
Self-citationFFX: Fast, Scalable, Deterministic Symbolic Regression Technology
McConaghy, T. (2011) · Genetic and Evolutionary Computation · doi:10.1007/978-1-4614-1770-5_13 · Cited by 166
Sparse identification of nonlinear dynamics for rapid model recovery
Quade, M., Abel, M., Nathan Kutz, J., & Brunton, S. L. (2018) · Chaos: An Interdisciplinary Journal of Nonlinear Science · doi:10.1063/1.5027470 · Cited by 163
Automated refinement and inference of analytical models for metabolic networks
Schmidt, M. D., Vallabhajosyula, R. R., Jenkins, J. W., Hood, J. E., Soni, A. S., Wikswo, J. P., & Lipson, H. (2011) · Physical Biology · doi:10.1088/1478-3975/8/5/055011 · Cited by 143
Dubčáková, R. (2010) · Genetic Programming and Evolvable Machines · doi:10.1007/s10710-010-9124-z · Cited by 141
Using Genetic Algorithms to Learn Reactive Control Parameters for Autonomous Robotic Navigation
Ram, A., Boone, G., Arkin, R. C., & Pearce, M. (1994) · Adaptive Behavior · doi:10.1177/105971239400200303 · Cited by 112
Toward an artificial intelligence physicist for unsupervised learning
Wu, T., & Tegmark, M. (2019) · Physical Review E · doi:10.1103/physreve.100.033311 · Cited by 99 · cited 1×
“To mitigate this, we follow the prescription in (30) and define the winning function to be the one with rms fitting error ε < εb that has the smallest total description length”
MethodSelf-citationA genetic algorithms approach to growth phase forecasting of wireless subscribers
Venkatesan, R., & Kumar, V. (2002) · International Journal of Forecasting · doi:10.1016/s0169-2070(02)00070-5 · Cited by 76
Cited by
Hart, G. L. W., Mueller, T., Toher, C., & Curtarolo, S. (2021) · Nature Reviews Materials · doi:10.1038/s41578-021-00340-w · Cited by 703
The Computational Limits of Deep Learning
Thompson, N. C., Greenewald, K., Lee, K., & Manso, G. F. (2020) · arXiv · doi:10.48550/arxiv.2007.05558 · Cited by 538
Machine learning in materials science: From explainable predictions to autonomous design
Pilania, G. (2021) · Computational Materials Science · doi:10.1016/j.commatsci.2021.110360 · Cited by 281
Quantum optimization with a novel Gibbs objective function and ansatz architecture search
Li, L., Fan, M., Coram, M., Riley, P., & Leichenauer, S. (2020) · Physical Review Research · doi:10.1103/physrevresearch.2.023074 · Cited by 98
Machine learning conservation laws from differential equations
Liu, Z., Madhavan, V., & Tegmark, M. (2022) · Physical Review E · doi:10.1103/physreve.106.045307 · Cited by 77
Self-citation
Metadata
- Authors
- Udrescu, S.-M., & Tegmark, M.
- Venue
- Science Advances
- Published
- 2020-04-17
- Volume
- 6
- Issue
- 16
- Pages
- eaay2631-eaay2631
- ISSN
- 2375-2548 (ISSN-L)
- OpenAlex
- W2947630964
- Cited by
- 1,080
- References
- 16
- FWCI
- 45.64
- 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.