Skip to main content

Entropy Transformation Measures for Computational Capacity

  • Conference paper
  • First Online:
Unconventional Computation and Natural Computation (UCNC 2024)

Abstract

Kernel Rank and Generalization Rank are common measures used to characterise reservoir computing systems. However, there are some common issues in literature that make comparisons of these measures difficult, as well as both measures ideally requiring access to the reservoir state. Further, Generalization Rank has an inherent level of arbitrariness in its definition, as well as requiring a separate experiment to compute. This paper introduces the Relative Utilization and Comparative Generalization Measures, as part of the family of Entropy Transformation Measures, which address these issues while capturing similar information.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

Notes

  1. 1.

    A reservoir implementing the identity function would also have a high KR.

References

  1. Allwood, D.A., et al.: A perspective on physical reservoir computing with nanomagnetic devices. Appl. Phys. Lett. 122(4), 040501 (2023)

    Article  Google Scholar 

  2. Büsing, L., Schrauwen, B., Legenstein, R.: Connectivity, dynamics, and memory in reservoir computing with binary and analog neurons. Neural Comput. 22(5), 1272–1311 (2010)

    Article  MathSciNet  Google Scholar 

  3. Dale, M., Miller, J.F., Stepney, S., Trefzer, M.A.: A substrate-independent framework to characterize reservoir computers. Proc. Roy. Soc. A 475(2226), 20180723 (2019)

    Article  MathSciNet  Google Scholar 

  4. Griffin, D.: Pycharc: Python characterisation of reservoir computers framework (2023). https://github.com/dgdguk/pycharc/

  5. Jaeger, H.: Short term memory in echo state networks. Technical report 152, GMD (2002)

    Google Scholar 

  6. Jaeger, H., Haas, H.: Harnessing nonlinearity: predicting chaotic systems and saving energy in wireless communication. Science 304(5667), 78–80 (2004)

    Article  Google Scholar 

  7. Kullback, S., Leibler, R.A.: On information and sufficiency. Ann. Math. Stat. 22(1), 79–86 (1951)

    Article  MathSciNet  Google Scholar 

  8. Love, J., Mulkers, J., Bourianoff, G., Leliaert, J., Everschor-Sitte, K.: Task agnostic metrics for reservoir computing. arXiv:2108.01512v1 [cs.LG] (2021)

  9. Maass, W.: Networks of spiking neurons: the third generation of neural network models. Neural Netw. 10(9), 1659–1671 (1997)

    Article  Google Scholar 

  10. Roy, O., Vetterli, M.: The effective rank: a measure of effective dimensionality. In: 15th European Signal Processing Conference, pp. 606–610. IEEE (2007)

    Google Scholar 

  11. Shannon, C.E.: A mathematical theory of communication. Bell Syst. Tech. J. 27(3), 379–423 (1948)

    Article  MathSciNet  Google Scholar 

  12. Spearman, C.: The proof and measurement of association between two things. Am. J. Psychol. 15(1), 72–101 (1904). http://www.jstor.org/stable/1412159

  13. Stewart, G.W.: On the early history of the singular value decomposition. SIAM Rev. 35(4), 551–566 (1993)

    Article  MathSciNet  Google Scholar 

  14. Vidamour, I.T., et al.: Quantifying the computational capability of a nanomagnetic reservoir computing platform with emergent magnetisation dynamics. Nanotechnology 33(48), 48520 (2022)

    Article  Google Scholar 

Download references

Acknowledgments

The authors acknowledge funding from the MARCH project, EPSRC grant numbers EP/V006029/1 and EP/V006339/1. The authors would like to thank Ian Vidamour for providing details on his implementation of Generalisation Rank.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to David Griffin .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2024 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Griffin, D., Stepney, S. (2024). Entropy Transformation Measures for Computational Capacity. In: Cho, DJ., Kim, J. (eds) Unconventional Computation and Natural Computation. UCNC 2024. Lecture Notes in Computer Science, vol 14776. Springer, Cham. https://doi.org/10.1007/978-3-031-63742-1_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-63742-1_9

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-63741-4

  • Online ISBN: 978-3-031-63742-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics