Abstract
We explore an application from the author’s work in neuroscience. A code used to investigate neural development modeled 100 neurons with all-to-all excitatory connectivity. We used a simple ordinary differential equation system to model each neuron, and this 100-neuron model was used to produce a paper published in the Journal of Neurophysiology. Later a colleague used our code to continue this work, and found he could not reproduce our results. This lead us to thoroughly investigate this code and we discovered that it offered many different ways to thwart reproducibility that could be explained by round-off error arising from floating-point arithmetic.
Numerical reproducibility is considered a task that directly follows from the determinism in computations. However, reproducibility has become an intense concern and issue for research. We will show how this particular code provides a lack of reproducibility from the following three mechanisms: (i) the introduction of floating-point errors in an inner product; (ii) introduction of floating-point errors at each an increasing number of time steps during temporal refinement (ii); and (iii) differences in the output of library mathematical functions at the level of round-off error. This code’s sensitivity makes it a very powerful tool to explore many different manifestations of numerical reproducibility. However, this code is by no means exceptional, as in neuroscience these types of models are used extensively to gain insights on the functioning of the nervous system. In addition, these types of models are widely used in many other fields of study as they just nonlinear evolution equations.
I wish to thank Wilfredo Blanco Figuerola from the Universidade do Estado do Rio Grande do Norte, Brazil, who brought the behavior of this code to my attention.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Gustafson, J.L.: The End of Error: Unum Computing. Taylor & Francis, Abingdon (2015)
Kulisch, U.W.: Computer Arithmetic and Validity. Theory, Implementation, and Applications. De Gruyter, Berlin (2013)
Kulisch, U.W., Miranker, W.L.: Computer Arithmetic in Theory and Practice. Computer Science and Applied Mathematics. Academic Press, Cambridge (1981)
Ogita, T., Rump, S.M., Oishi, S.: Accurate sum and dot product. SIAM J. Sci. Comput. 26(6), 1955–1988 (2005). https://doi.org/10.1137/030601818. http://dx.doi.org/10.1137/030601818
Riedy, E.J., Demmel, J.: Augmented arithmetic operations proposed for IEEE-754 2018. In: 25th IEEE Symposium on Computer Arithmetic, ARITH 2018, Amherst, MA, USA, 25–27 June 2018, pp. 45–52. IEEE (2018). https://doi.org/10.1109/ARITH.2018.8464813
Tabak, J., Mascagni, M., Bertram, R.: Mechanism for the universal pattern of activity in developing neuronal networks. J. Neurophysiol. 103(4), 2208–2221 (2010)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 This is a U.S. government work and not under copyright protection in the United States; foreign copyright protection may apply
About this paper
Cite this paper
Mascagni, M. (2019). Three Numerical Reproducibility Issues That Can Be Explained as Round-Off Error. In: Weiland, M., Juckeland, G., Alam, S., Jagode, H. (eds) High Performance Computing. ISC High Performance 2019. Lecture Notes in Computer Science(), vol 11887. Springer, Cham. https://doi.org/10.1007/978-3-030-34356-9_34
Download citation
DOI: https://doi.org/10.1007/978-3-030-34356-9_34
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-34355-2
Online ISBN: 978-3-030-34356-9
eBook Packages: Computer ScienceComputer Science (R0)