Fetching the paper…
Reading the bibliography…
Symbolic Regression (SR) algorithms attempt to learn analytic expressions which fit data accurately and in a highly interpretable manner.
A. M. Turing, “I.—COMPUTING MACHINERY AND INTELLIGENCE,” Mind , vol. LIX, no. 236, pp. 433–460, 10 1950. [Online]. Available: https://doi.org/10.1093/mind/LIX.236.433
1950
Earlier work this paper cites.
C. S. Wallace and D. M. Boulton, “An Information Measure for Classification,” The Computer Journal , vol. 11, no. 2, pp. 185–194, 08 1968. [Online]. Available: https://doi.org/10.1093/comjnl/11.2.185
1968
Earlier work this paper cites.
C. G. BROYDEN, “The Convergence of a Class of Double-rank Minimization Algorithms 1. General Considerations,” IMA Journal of Applied Mathematics , vol. 6, no. 1, pp. 76–90, 03 1970. [Online]. Available: https://doi.org/10.1093/imamat/6.1.76
1970
Earlier work this paper cites.
R. Fletcher, “A new approach to variable metric algorithms,” The Computer Journal , vol. 13, no. 3, pp. 317–322, 01 1970. [Online]. Available: https://doi.org/10.1093/comjnl/13.3.317
1970
Earlier work this paper cites.
R. A. Sunyaev and Y. B. Zeldovich, “The Observations of Relic Radiation as a Test of the Nature of X-Ray Radiation from the Clusters of Galaxies,” Comments on Astrophysics and Space Physics , vol. 4, p. 173, Nov. 1972
1972
Earlier work this paper cites.
J. Rissanen, “Modeling by shortest data description,” Automatica , vol. 14, no. 5, pp. 465–471, 1978. [Online]. Available: https://www.sciencedirect.com/science/article/pii/0005109878900055
1978
Earlier work this paper cites.
J. Rissanen, “A Universal Prior for Integers and Estimation by Minimum Description Length,” The Annals of Statistics , vol. 11, no. 2, pp. 416 – 431, 1983. [Online]. Available: https://doi.org/10.1214/aos/1176346150
1983
Earlier work this paper cites.
E. David, Genetic Algorithms in Search, Optimization and Machine Learning . Addison-Wesley, 1989
1989
Earlier work this paper cites.
T. M. Cover and J. A. Thomas, Elements of Information Theory , 2nd ed. Wiley, 1991
1991
Earlier work this paper cites.
H. Iba, H. De Garis, and T. Sato, “Genetic programming using a minimum description length principle,” Advances in genetic programming , vol. 1, pp. 265–284, 1994
1994
Earlier work this paper cites.
J. F. Navarro, C. S. Frenk, and S. D. M. White, “A Universal Density Profile from Hierarchical Clustering,” \apj
1997
Earlier work this paper cites.
D. Wolpert and W. Macready, “No free lunch theorems for optimization,” IEEE Transactions on Evolutionary Computation , vol. 1, no. 1, pp. 67–82, 1997
1997
Earlier work this paper cites.
A. G. Riess et al. , “Observational Evidence from Supernovae for an Accelerating Universe and a Cosmological Constant,” \aj
1998
Earlier work this paper cites.
S. Perlmutter et al. , “Measurements of Ω \Omega and Λ \Lambda from 42 High-Redshift Supernovae,” \apj
1999
Earlier work this paper cites.
A. D. Lanterman, “Schwarz, wallace, and rissanen: Intertwining themes in theories of model selection,” International Statistical Review , vol. 69, no. 2, pp. 185–212, 2001. [Online]. Available: https://onlinelibrary.wiley.com/doi/abs/10.1111/j.1751-5823.2001.tb00456.x
2001
Earlier work this paper cites.
R. Jimenez and A. Loeb, “Constraining Cosmological Parameters Based on Relative Galaxy Ages,” \apj
2002
Earlier work this paper cites.
R. Haupt and S. Haupt, Practical genetic algorithms , 2nd ed. Wyley, 2004
2004
Earlier work this paper cites.
J. Simon, L. Verde, and R. Jimenez, “Constraints on the redshift dependence of the dark energy potential,” \prd
2005
Earlier work this paper cites.
G. F. Smits and M. Kotanchek, Pareto-Front Exploitation in Symbolic Regression . Boston, MA: Springer US, 2005, pp. 283–299. [Online]. Available: https://doi.org/10.1007/0-387-23254-0_17
2005
Earlier work this paper cites.
P. Grunwald, The Minimum Description Length Principle . MIT Press, 2007
2007
Earlier work this paper cites.
J. D. Hunter, “Matplotlib: A 2d graphics environment,” Computing in Science & Engineering , vol. 9, no. 3, pp. 90–95, 2007
2007
Earlier work this paper cites.
A. A. Hagberg, D. A. Schult, and P. J. Swart, “Exploring network structure, dynamics, and function using networkx,” in Proceedings of the 7th Python in Science Conference , G. Varoquaux, T. Vaught, and J. Millman, Eds., Pasadena, CA USA, 2008, pp. 11 – 15
2008
Earlier work this paper cites.
C. Bogdanos and S. Nesseris, “Genetic algorithms and supernovae type Ia analysis,” \jcap
2009
Earlier work this paper cites.
E. J. Vladislavleva, G. F. Smits, and D. den Hertog, “Order of nonlinearity as a complexity measure for models generated by symbolic regression via pareto genetic programming,” IEEE Transactions on Evolutionary Computation , vol. 13, no. 2, pp. 333–349, 2009
2009
Earlier work this paper cites.
S. Nesseris and A. Shafieloo, “A model-independent null test on the cosmological constant,” \mnras
2010
Earlier work this paper cites.
D. Stern, R. Jimenez, L. Verde, M. Kamionkowski, and S. A. Stanford, “Cosmic chronometers: constraining the equation of state of dark energy. I: H(z) measurements,” \jcap
2010
Earlier work this paper cites.
Wes McKinney, “Data Structures for Statistical Computing in Python,” in Proceedings of the 9th Python in Science Conference , Stéfan van der Walt and Jarrod Millman, Eds., 2010, pp. 56 – 61
2010
Earlier work this paper cites.
T. McConaghy, FFX: Fast, Scalable, Deterministic Symbolic Regression Technology . New York, NY: Springer New York, 2011, pp. 235–260. [Online]. Available: https://doi.org/10.1007/978-1-4614-1770-5_13
2011
Cited alongside, same era.
S. Nesseris and J. García-Bellido, “A new perspective on dark energy modeling via genetic algorithms,” \jcap
2012
Cited alongside, same era.
M. Moresco et al. , “Improved constraints on the expansion rate of the Universe up to z ~
2012
Cited alongside, same era.
T. Worm and K. Chiu, “Prioritized grammar enumeration: Symbolic regression by dynamic programming,” in Proceedings of the 15th Annual Conference on Genetic and Evolutionary Computation , ser. GECCO ’13. New York, NY, USA: Association for Computing Machinery, 2013, p. 1021–1028. [Online]. Available: https://doi.org/10.1145/2463372.2463486
2013
Cited alongside, same era.
P. Collaboration, “Planck 2018 results. VI. Cosmological parameters,” \aap
2020
Later among the works it cites.
C. R. Harris et al. , “Array programming with NumPy,” Nature , vol. 585, no. 7825, pp. 357–362, Sep. 2020. [Online]. Available: https://doi.org/10.1038/s41586-020-2649-2
2020
Later among the works it cites.
T. pandas development team, “pandas-dev/pandas: Pandas,” Feb. 2020. [Online]. Available: https://doi.org/10.5281/zenodo.3509134
2020
Later among the works it cites.
P. Virtanen et al. , “SciPy 1.0: Fundamental Algorithms for Scientific Computing in Python,” Nature Methods , vol. 17, pp. 261–272, 2020
2020
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
F. Johansson et al. , mpmath: a Python library for arbitrary-precision floating-point arithmetic (version 0.18) , December 2013, http://mpmath.org/
2013
Cited alongside, same era.
D. Sapone, E. Majerotto, and S. Nesseris, “Curvature versus distances: Testing the FLRW cosmology,” \prd
2014
Cited alongside, same era.
C. Zhang, H. Zhang, S. Yuan, S. Liu, T.-J. Zhang, and Y.-C. Sun, “Four new observational H(z) data from luminous red galaxies in the Sloan Digital Sky Survey data release seven,” Research in Astronomy and Astrophysics , vol. 14, no. 10, pp. 1221–1233, Oct. 2014
2014
Cited alongside, same era.
P. A. Brodtkorb and J. D’Errico, “numdifftools 0.9.11,” https://github.com/pbrod/numdifftools , Aug. 2015
2015
Cited alongside, same era.
M. Moresco, “Raising the bar: new constraints on the Hubble parameter with cosmic chronometers at z ~
2015
Cited alongside, same era.
M. Moresco, L. Pozzetti, A. Cimatti, R. Jimenez, C. Maraston, L. Verde, D. Thomas, A. Citro, R. Tojeiro, and D. Wilkinson, “A 6% measurement of the Hubble parameter at z ~
2016
Cited alongside, same era.
A. Meurer et al. , “Sympy: symbolic computing in python,” PeerJ Computer Science , vol. 3, p. e103, Jan. 2017. [Online]. Available: https://doi.org/10.7717/peerj-cs.103
2017
Cited alongside, same era.
A. L. Ratsimbazafy, S. I. Loubser, S. M. Crawford, C. M. Cress, B. A. Bassett, R. C. Nichol, and P. Väisänen, “Age-dating luminous red galaxies observed with the Southern African Large Telescope,” \mnras
2017
Cited alongside, same era.
2021
Later among the works it cites.
2021
Later among the works it cites.
2021
Later among the works it cites.
2021
Later among the works it cites.
2021
Later among the works it cites.
Evolved Analytics LLC. Data Modeler 9.5.1. Evolved analytics LLC. URL: www.evolved-analytics.com ; 2021
2021
Later among the works it cites.
2021
Later among the works it cites.
2021
Later among the works it cites.
L. Dalcin and Y.-L. L. Fang, “mpi4py: Status update after 12 years of development,” Computing in Science & Engineering , vol. 23, no. 4, pp. 47–54, 2021
2021
Later among the works it cites.
2022
Closest in time.
2022
Closest in time.
A. M. Delgado, D. Wadekar, B. Hadzhiyska, S. Bose, L. Hernquist, and S. Ho, “Modelling the galaxy-halo connection with machine learning,” \mnras
2022
Closest in time.
F. Miniati and G. Gregori, “Learning transport processes with machine intelligence,” Scientific Reports , vol. 12, p. 11709, Jul. 2022
2022
Closest in time.
D. J. Bartlett, H. Desmond, and P. G. Ferreira, “Exhaustive symbolic regression function sets,” Nov. 2022. [Online]. Available: https://doi.org/10.5281/zenodo.7339113
2022
Closest in time.
2022
Closest in time.
N. Borghi, M. Moresco, and A. Cimatti, “Toward a Better Understanding of Cosmic Chronometers: A New Measurement of H(z) at z 0.7,” \apjl
2022
Closest in time.
——, “Unveiling the Universe with emerging cosmological probes,” Living Reviews in Relativity , vol. 25, no. 1, p. 6, Dec. 2022
2022
Closest in time.
A. G. Riess et al. , “A Comprehensive Measurement of the Local Value of the Hubble Constant with 1 km s -1
2022
Closest in time.
2022
Closest in time.
Q. Chen, B. Xue, and M. Zhang, “Rademacher complexity for enhancing the generalization of genetic programming for symbolic regression,” IEEE Transactions on Cybernetics , vol. 52, no. 4, pp. 2382–2395, 2022
2022
Closest in time.
G. F. Bomarito, P. E. Leser, N. C. M. Strauss, K. M. Garbrecht, and J. D. Hochhalter, “Bayesian model selection for reducing bloat and overfitting in genetic programming for symbolic regression,” in Proceedings of the Genetic and Evolutionary Computation Conference Companion , ser. GECCO ’22. New York, NY, USA: Association for Computing Machinery, 2022, p. 526–529. [Online]. Available: https://doi.org/10.1145/3520304.3528899
2022
Closest in time.