20
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: found
      • Article: found
      Is Open Access

      Stochastic rounding and reduced-precision fixed-point arithmetic for solving neural ordinary differential equations

      research-article

      Read this article at

      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Abstract

          Although double-precision floating-point arithmetic currently dominates high-performance computing, there is increasing interest in smaller and simpler arithmetic types. The main reasons are potential improvements in energy efficiency and memory footprint and bandwidth. However, simply switching to lower-precision types typically results in increased numerical errors. We investigate approaches to improving the accuracy of reduced-precision fixed-point arithmetic types, using examples in an important domain for numerical computation in neuroscience: the solution of ordinary differential equations (ODEs). The Izhikevich neuron model is used to demonstrate that rounding has an important role in producing accurate spike timings from explicit ODE solution algorithms. In particular, fixed-point arithmetic with stochastic rounding consistently results in smaller errors compared to single-precision floating-point and fixed-point arithmetic with round-to-nearest across a range of neuron behaviours and ODE solvers. A computationally much cheaper alternative is also investigated, inspired by the concept of dither that is a widely understood mechanism for providing resolution below the least significant bit in digital signal processing. These results will have implications for the solution of ODEs in other subject areas, and should also be directly relevant to the huge range of practical problems that are represented by partial differential equations.

          This article is part of a discussion meeting issue ‘Numerical algorithms for high-performance computational science’.

          Related collections

          Most cited references13

          • Record: found
          • Abstract: found
          • Article: not found

          Simple model of spiking neurons.

          A model is presented that reproduces spiking and bursting behavior of known types of cortical neurons. The model combines the biologically plausibility of Hodgkin-Huxley-type dynamics and the computational efficiency of integrate-and-fire neurons. Using this model, one can simulate tens of thousands of spiking cortical neurons in real time (1 ms resolution) using a desktop PC.
            Bookmark
            • Record: found
            • Abstract: found
            • Article: not found

            Accuracy and Efficiency in Fixed-Point Neural ODE Solvers.

            Simulation of neural behavior on digital architectures often requires the solution of ordinary differential equations (ODEs) at each step of the simulation. For some neural models, this is a significant computational burden, so efficiency is important. Accuracy is also relevant because solutions can be sensitive to model parameterization and time step. These issues are emphasized on fixed-point processors like the ARM unit used in the SpiNNaker architecture. Using the Izhikevich neural model as an example, we explore some solution methods, showing how specific techniques can be used to find balanced solutions. We have investigated a number of important and related issues, such as introducing explicit solver reduction (ESR) for merging an explicit ODE solver and autonomous ODE into one algebraic formula, with benefits for both accuracy and speed; a simple, efficient mechanism for cancelling the cumulative lag in state variables caused by threshold crossing between time steps; an exact result for the membrane potential of the Izhikevich model with the other state variable held fixed. Parametric variations of the Izhikevich neuron show both similarities and differences in terms of algorithms and arithmetic types that perform well, making an overall best solution challenging to identify, but we show that particular cases can be improved significantly using the techniques described. Using a 1 ms simulation time step and 32-bit fixed-point arithmetic to promote real-time performance, one of the second-order Runge-Kutta methods looks to be the best compromise; Midpoint for speed or Trapezoid for accuracy. SpiNNaker offers an unusual combination of low energy use and real-time performance, so some compromises on accuracy might be expected. However, with a careful choice of approach, results comparable to those of general-purpose systems should be possible in many realistic cases.
              Bookmark
              • Record: found
              • Abstract: not found
              • Article: not found

              Modelling: Build imprecise supercomputers.

              Tim Palmer (2015)
                Bookmark

                Author and article information

                Journal
                Philos Trans A Math Phys Eng Sci
                Philos Trans A Math Phys Eng Sci
                RSTA
                roypta
                Philosophical transactions. Series A, Mathematical, physical, and engineering sciences
                The Royal Society Publishing
                1364-503X
                1471-2962
                6 March 2020
                20 January 2020
                20 January 2020
                : 378
                : 2166 , Discussion meeting issue ‘Numerical algorithms for high-performance computational science’ organised and edited by Jack Dongarra, Laura Grigori and Nicholas J. Higham
                : 20190052
                Affiliations
                APT research group, Department of Computer Science, The University of Manchester , Manchester, UK
                Author notes
                [†]

                These authors contributed equally to this study.

                One contribution of 15 to a discussion meeting issue ‘Numerical algorithms for high-performance computational science’.

                Author information
                http://orcid.org/0000-0002-6524-3367
                Article
                rsta20190052
                10.1098/rsta.2019.0052
                7015297
                31955687
                888ce15a-654e-4db0-9cc7-acd6275e135f
                © 2020 The Authors.

                Published by the Royal Society under the terms of the Creative Commons Attribution License http://creativecommons.org/licenses/by/4.0/, which permits unrestricted use, provided the original author and source are credited.

                History
                : 30 September 2019
                Funding
                Funded by: H2020 Future and Emerging Technologies, http://dx.doi.org/10.13039/100010664;
                Award ID: 785907
                Funded by: Engineering and Physical Sciences Research Council, http://dx.doi.org/10.13039/501100000266;
                Award ID: EP/D07908X/1
                Award ID: EP/G015740/1
                Categories
                1003
                7
                168
                1008
                59
                Articles
                Research Article
                Custom metadata
                March 6, 2020

                fixed-point arithmetic,stochastic rounding,izhikevich neuron model,ordinary differential equation,spinnaker,dither

                Comments

                Comment on this article