A Bayesian machine scientist to aid in the solution of challenging scientific problems
Open accessThe DOI matches its Crossref record; 44 of the 44 references it cites were found in a registry or an index.
Abstract
A Bayesian machine scientist uncovers closed-form mathematical models from data.
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
Figures

![Fig. 2 The prior probability distribution generates plausible expressions. (A) We extracted 4080 mathematical expressions from Wikipedia pages listed under the category “List of scientific equations named after people”, for example, the page devoted to “Newton’s law of universal gravitation” (see also table S2). (B) After parsing each expression (Materials and Methods), we counted the number of each operation in the expression and the square of these numbers. In Newton’s law of gravitation, we counted two products, one division, and one square. The complete list of operations is listed in table S1. Then, we parametrized the prior distributions p(fi) and fit the parameters so as to generate expressions that have realistic numbers (and squares) of each operation (Materials and Methods). (C to H) We ran the MCMC to draw sets of 4080 synthetic expressions from the prior distribution. We compared these sets of 4080 synthetic expressions with the 4080 empirical expressions obtained from Wikipedia. In particular, for each set of 4080 expressions, we counted the mean number 〈no〉 of each operation o per expression [(C) sine, (D) logarithm, (E) sum], or the mean 〈no²〉 of the square of those numbers (F to H) and plot their probability density function (PDF; pink). The red vertical line indicates the mean of the distribution, which is close to the empirical observation, represented by a dashed black line. The empirical value is always well within the expected ranges of the expressions generated by the MCMC. The results in the figure correspond to expressions with up to five variables and eight parameters.](https://figures.cochat.ai/paper-figures/d0f994b87cbe4b6f8c9b956669cd6462/a-bayesian-machine-scientist-to-aid-in-the-solution-of-challenging-scientific-figure-2.jpg)
![Fig. 3 Recovery of an arbitrary expression from synthetic data. We drew an expression with two variables (x1 and x2) and two parameters (θ1 and θ2) from the prior distribution p(fi); the drawn function is F(x1,x2; θ1,θ2) = x1(θ1 + x2) cos (x1)/[θ2 log (θ2)], with θ1 = −1.19 and θ2 = 0.29. With this function, we generated 400 synthetic points y^k=F(x1^k,x2^k;θ1,θ2)+ε^k, with (x1^k,x2^k) uniformly chosen in [−2,2]2, and ε ∼ N(0,1) normally distributed [points in (A) and (D) to (G); the color of the points corresponds to the value of y as indicated by the color bar]. We fed these synthetic data to the Bayesian machine scientist and run 2500 steps of the MCMC algorithm. (A) After 2500 steps, the most plausible model identified (blue surface) is f(x1, x2; θ1, θ2) = x1(c1 + c2x2) cos x1, which coincides with the correct model up to indeterminacies in the dependency on the parameters that cannot be resolved without varying their values (see movie S1 for the complete evolution of the MCMC). (B) The blue line indicates the evolution of the description length L during the MCMC (up to an irrelevant additive constant that comes from the prior normalization and therefore affects all points equally). Lower description lengths correspond to more plausible models. The MCMC starts from an expression with high description length, but after 1000 to 1500 steps, it equilibrates and samples from the stationary distribution p(fi∣D). (C) The blue line indicates the evolution of the mean absolute error of each model sampled by the MCMC with respect to the true model. The error is calculated over a grid in [−2,2]2, that is, not at the observed points. (D to G) The MCMC is prone to getting trapped in local maxima of the plausibility (local minima of the description length). To explore the expression space more efficiently, we used parallel tempering (38), a technique used in statistical physics to study disordered systems with rugged energy landscapes (Materials and Methods). Besides the main MCMC in (A), parallel tempering keeps a number of parallel MCMCs that sample the distributions p(fi,Tk) ∝ exp [−B(fi)/2Tk + log p(fi)] parametrized by “temperatures” Tk (Materials and Methods). In our case, higher temperatures correspond to simpler expressions. At each MCMC step, we attempted a swap of expressions at contiguous Tk using Metropolis’ rule. The evolution of the description length and the mean absolute error of the parallel MCMCs are represented in (B) and (C) with the same colors as in (D) to (G).](https://figures.cochat.ai/paper-figures/a3232a7e475f43718cd71b76083be883/a-bayesian-machine-scientist-to-aid-in-the-solution-of-challenging-scientific-figure-3.jpg)
![Fig. 4 Recovery of the differential equations governing the Rössler system. (A) We generated synthetic data for the Rössler system (equations shown in the panels) with a = b = 0.2 and c = 5.7. We assume that (x, y, z) are measured without error, but the functions that we aim to recover (x.,y.,z.) are measured with two levels of Gaussian noise [e.g., x.^k=F(x^k,y^k,z^k)+ε^k with εk ∼ N(0, σε)]: orange, σε = 1; blue, σε = 5. (B) Trajectories in velocity space (x.,y.,z.) for the levels of noise that we considered. (C to J) For each level of noise, we sampled 10,000 models for x. using the machine scientist and the same for y. and z.. (C and G), For each level of noise, we plot the most plausible model obtained. (D to F and H to J) We plot the distribution of description lengths (up to an irrelevant additive constant) for the models sampled. (D to F) For low noise, the most plausible model among those sampled always coincides with the true model, as indicated by the dashed vertical line. (H to J) For high noise, x. was recovered exactly, whereas for y. and z., the most plausible models corresponded to regularized versions of the true models, in which terms that are comparatively small because of the factor 0.2 are dropped. In all cases, the true model (dashed vertical line) is, at least, among the most plausible ones.](https://figures.cochat.ai/paper-figures/149444b9563248999b73ff6060385d75/a-bayesian-machine-scientist-to-aid-in-the-solution-of-challenging-scientific-figure-4.jpg)
![Fig. 5 The machine scientist gives accurate closed-form models and out-of-sample predictions for the Nikuradse dataset. The dataset contains measurements of the turbulent friction λ in rough pipes as a function of the Reynolds number xR and the inverse of the relative roughness xD. (A and B) We fed the machine scientist with the Nikuradse dataset (gray) and sample more than 18,000 models using MCMC as described in the text. The two graphs show the fit of two of the most plausible models (red), indicated at the top of each panel. For comparison, we show the best models identified by alternative machine scientists Eureqa (green) and EFS (orange). The inset in each graph shows the mean absolute error (MAE) of the machine scientist (MS), Eureqa (EU), and EFS (EF) (Materials and Methods), and error bars indicate the 95% confidence interval for the mean. (C and D) We fed the machine scientist with the data points in gray and sample 20,000 models using MCMC. We made predictions (red) for the unobserved data (black) using the median predictive model (see text). For comparison, we show the predictions of Eureqa, EFS, and Gaussian processes (GP) (Materials and Methods). The inset in each graph shows the mean absolute error for all approaches. (E) We considered, again, the models obtained from the whole data as in (A) and (B) but asked what the median predictive model predicts in the fully turbulent regime, well above the highest observed Reynold number (31). Despite the fact that individual sampled models have different behaviors in this region (fig. S5), the median predictive model [obtained as in (C) and (D)] predicts that turbulent friction stays constant at large Reynolds numbers, in agreement with theory (31–33). (F) The machine scientist also predicts the correct scaling (D/r)−1/3 for the turbulent friction in this regime (dashed line). (G) Scaling of the Nikuradse dataset proposed by Prandtl (with ks⁺(Re,r/D)=Re×√(λ/32)×D/r) (30, 33) and most plausible model identified by the machine scientist for the universal scaling function. (H) When unscaled, this simple universal function provides a good description of all the data.](https://figures.cochat.ai/paper-figures/77eb2836ac0a4d58b2cce7d719a210b1/a-bayesian-machine-scientist-to-aid-in-the-solution-of-challenging-scientific-figure-5.jpg)
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.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“Both “machine scientists” (96, 97) and large language models hold the promise to help encapsulate the knowledge in the scientific literature for the use of scientists and the lay public.”
From The entities enabling scientific fraud at scale are large, resilient, and growing rapidly (2025) · cites this paper as [97]
Experimental — accuracy not yet measured
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
Scikit-learn: Machine Learning in Python
Pedregosa, F., Varoquaux, G., Gramfort, A., Michel, V., Thirion, B., Grisel, O., Blondel, M., Müller, A., Nothman, J., Louppe, G., et al. (2012) · arXiv · doi:10.48550/arxiv.1201.0490 · Cited by 71,016
Estimating the Dimension of a Model
Schwarz, G. (1978) · The Annals of Statistics · doi:10.1214/aos/1176344136 · Cited by 47,033 · cited 3×
“where B( fi) is the Bayesian information criterion (BIC) of expression fi and can be readily calculated from the data (Supplementary text S1) (11, 17).”
BackgroundEquation of State Calculations by Fast Computing Machines
Metropolis, N., Rosenbluth, A. W., Rosenbluth, M. N., Teller, A. H., & Teller, E. (1953) · The Journal of Chemical Physics · doi:10.1063/1.1699114 · Cited by 37,192
Information theory and statistical mechanics
Jaynes, E. T. (1957) · Physical Review · doi:10.1103/physrev.106.620 · Cited by 12,931 · cited 3×
“In particular, we choose a prior that generates expressions with the same average number of each type of operation [and their squares (23, 24)] as in the empirical corpus and, given this constraint, satisfies the maximum entropy principle (14, 23) (Materials and Methods; Supplementary text S2, fig.”
MethodNWChem: A comprehensive and scalable open-source solution for large scale molecular simulations
Valiev, M., Bylaska, E. J., Govind, N., Kowalski, K., Straatsma, T. P., Van Dam, H. J. J., Wang, D., Nieplocha, J., Apra, E., Windus, T. L., et al. (2010) · Computer Physics Communications · doi:10.1016/j.cpc.2010.04.018 · Cited by 5,779
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 · cited 2×
“This approach is particularlysuited to learn differential equations ( 8 – 11 ), whose form often follows the assumption of linearity on relatively simple basis functions.”
BackgroundResultProbability theory the logic of science
Jaynes, E. T., & Bretthorst, G. L. (2003) · Cited by 4,654
Hoeting, J. A., Madigan, D., Raftery, A. E., & Volinsky, C. T. (1999) · Statistical Science · doi:10.1214/ss/1009212519 · Cited by 4,118
Probability Theory: The Logic of Science
Jaynes, E. T. (2003) · doi:10.1017/cbo9780511790423 · Cited by 4,045
An equation for continuous chaos
Rössler, O. E. (1976) · Physics Letters A · doi:10.1016/0375-9601(76)90101-8 · Cited by 4,012 · cited 1×
“Next, we investigate whether the machine is able to recover the differential equations that govern the Rössler system (25), andwhat is the effect of increasing observational noise in the equation discovery process.”
Background
Research works printed but not linked: 3
- W. La Cava L. Spector K. Danai Proceedings of the Genetic and Evolutionary Computation Conference 2016 GECCO ‘16 (ACM 2016) pp. 741–748.
- I. Arnaldo K. Krawiec U.-M. O’Reilly Proceedings of the 2014 Annual Conference on Genetic and Evolutionary Computation GECCO ‘14 (ACM 2014) pp. 879–886.
- J. A. Hoeting, D. Madigan, A. E. Raftery, C. T. Volinsky, Bayesian model averaging: A tutorial. Stat. Sci. 14, 382417 (1999).
Cited by
Scientific discovery in the age of artificial intelligence.
Wang, H., Fu, T., Du, Y., Gao, W., Huang, K., Liu, Z., Chandak, P., Liu, S., Van Katwyk, P., Deac, A., et al. (2023) · Nature · doi:10.1038/s41586-023-06221-2 · Cited by 1,823
Discovering Symbolic Models from Deep Learning with Inductive Biases
Cranmer, M., Sánchez‐González, Á., Battaglia, P., Xu, R., Cranmer, K. S., Spergel, D. N., & Ho, S. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2006.11287 · Cited by 250
“Other community packages such as [26, 27, 28, 29, 30, 31, 32, 33, 34], could likely also be used and achieve similar results (although [30] appears to not fit constants in equations, so could not be used here).”
Discovering causal relations and equations from data
Camps‐Valls, G., Gerhardus, A., Ninad, U., Varando, G., Martius, G., Balaguer‐Ballester, E., Vinuesa, R., Díaz, E., Zanna, L., & Runge, J. (2023) · Physics Reports · doi:10.1016/j.physrep.2023.10.005 · Cited by 201
Tenachi, W., Ibata, R., & Diakogiannis, F. I. (2023) · The Astrophysical Journal · doi:10.3847/1538-4357/ad014c · Cited by 199
“One can exploit such prior knowledge by formulating it as an in situ prior ( Guimerà et al. 2020; Kim et al. 2021 ) or by learning on it in a supervised manner using transformer learning techniques ( Biggio et al. 2021; Kamienny et al. 2022; Vastl et al. 2022; Bendinelli et al. 2023; Kamienny et…”
Data, measurement and empirical methods in the science of science
Liu, L., Jones, B. F., Uzzi, B., & Wang, D. (2023) · Nature Human Behaviour · doi:10.1038/s41562-023-01562-4 · Cited by 181
“Indeed, predicting the direction of new discoveries represents one of the most promising avenues for machine learning models, with neural networks being applied widely to biology 208 , physics 209,210 , mathematics 211 , chemistry 212 , medicine 213 and clinical applications 214 .”
Background
Metadata
- Authors
- Guimerà, R., Reichardt, I., Aguilar-Mogas, A., Massucci, F. A., Miranda, M., Pallarès, J., & Sales-Pardo, M.
- Affiliations
- Institució Catalana de Recerca i Estudis Avançats (ES)
- Universitat Rovira i Virgili (ES)
- Department of Chemical Engineering, Universitat Rovira i Virgili, Tarragona 43007, Catalonia, Spain.
- SIRIS Academic (ES)
- Corresponding author
- Guimerà, Roger
- ORCID
- Venue
- Science Advances
- Published
- 2020-01-31
- Volume
- 6
- Issue
- 5
- Pages
- eaav6971-eaav6971
- ISSN
- 2375-2548 (ISSN-L)
- PMC
- PMC6994216
- OpenAlex
- W3003690504
- Cited by
- 136
- References
- 44
- Citations by year
- 2026: 17 · 2025: 24 · 2024: 32 · 2023: 31 · 2022: 15 · 2021: 13 · 2020: 4
- FWCI
- 11.11
- Type
- journal article
- Language
- en
- Open access
- gold
- doi.org
- Licence
- cc-by-nc
- Locations
- Science Advances (publishedVersion, cc-by-nc)
- Europe PMC (PubMed Central) (publishedVersion, cc-by-nc)
- PubMed Central (publishedVersion, cc-by-nc)
- PubMed (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- Rovira & Virgili repository (submittedVersion, cc-by)
- The Scholarship East Carolina University's Institutional Repository (East Carolina University) (submittedVersion)
- arXiv (Cornell University)
- Funders
- Ministerio de Economía y Competitividad, Gobierno de España (FIS2015-71563-ERC, FIS2016-78904-C3-P-1, DPI2016-75791-C2-1-P)
- Topics
- Physical Sciences › Mathematics › Statistics and Probability › Markov Chains and Monte Carlo Methods
- Physical Sciences › Computer Science › Artificial Intelligence › Gaussian Processes and Bayesian Inference
- Physical Sciences › Computer Science › Artificial Intelligence › Evolutionary Algorithms and Applications
- Keywords
- out-of-sample forecasting, interpretable models
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: A Bayesian machine scientist to aid in the solution of challenging scientific problems. https://app.cochat.ai/papers/10.1126/sciadv.aav6971
- The paper
- Guimerà, R., Reichardt, I., Aguilar-Mogas, A., Massucci, F. A., Miranda, M., Pallarès, J., & Sales-Pardo, M. (2020). A Bayesian machine scientist to aid in the solution of challenging scientific problems. Science Advances. https://doi.org/10.1126/sciadv.aav6971
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.