Nash Equilibrium as a Solution in Supervised Classification

  • Conference paper
  • First Online:
Parallel Problem Solving from Nature – PPSN XVI (PPSN 2020)

Abstract

The supervised classification problem offers numerous challenges to algorithm designers, most of them stemming from the size and type of the data. While dealing with large data-sets has been the focus of many studies, the task of uncovering subtle relationships within data remains an important challenge, for which new solutions concepts have to be explored. In this paper, we propose a general framework for the supervised classification problem based on game theory and the Nash equilibrium concept. The framework is used to estimate parameters of probabilistic classification models to approximate the equilibrium of a game as the optimum of a function. CMA-ES is adapted to compute such model parameters; a noise mechanism is used to enhance the diversity of the search. To illustrate the approach we use Probit regression; numerical experiments indicate that the game-theoretic approach may provide a better insight into data than other models.

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

Access this chapter

Subscribe and save

Springer+ Basic
EUR 32.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
EUR 29.95
Price includes VAT (Germany)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
EUR 74.89
Price includes VAT (Germany)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
EUR 96.29
Price includes VAT (Germany)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free ship** worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

Notes

  1. 1.

    UCI Machine Learning Repository https://archive.ics.uci.edu/ml/index.php, accessed January 2020.

  2. 2.

    Version 0.21.1.

References

  1. Czerniak, J., Zarzycki, H.: Application of rough sets in the presumptive diagnosis of urinary system diseases. In: Sołdek, J., Drobiazgiewicz, L. (eds.) Artificial Intelligence and Security in Computing Systems, vol. 752, pp. 41–51. Springer, Boston (2003). https://doi.org/10.1007/978-1-4419-9226-0_5

    Chapter  Google Scholar 

  2. Gast, N., Ioannidis, S., Loiseau, P., Roussillon, B.: Linear regression from strategic data sources. ar**v:1309.7824 [cs, math, stat], July 2019

  3. Hansen, N., Akimoto, Y., Baudis, P.: CMA-ES/pycma on Github. Zenodo, February 2019. https://doi.org/10.5281/zenodo.2559634

  4. Hansen, N., Ostermeier, A.: Completely derandomized self-adaptation in evolution strategies. Evol. Comput. 9(2), 159–195 (2001). https://doi.org/10.1162/106365601750190398

    Article  Google Scholar 

  5. Hastie, T., Tibshirani, R., Friedman, J.: The Elements of Statistical Learning. Springer Series in Statistics. Springer, New York (2001). https://doi.org/10.1007/978-0-387-21606-5

    Book  MATH  Google Scholar 

  6. Hastie, T., Tibshirani, R., Friedman, J.: The Elements of Statistical Learning: Data Mining, Inference and Prediction. Springer, Heidelberg (2009). https://doi.org/10.1007/978-0-387-84858-7. http://www-stat.stanford.edu/~tibs/ElemStatLearn/

    Book  MATH  Google Scholar 

  7. Lundberg, S.M., Lee, S.I.: A unified approach to interpreting model predictions. In: Guyon, I., Luxburg, U.V., Bengio, S., Wallach, H., Fergus, R., Vishwanathan, S., Garnett, R. (eds.) Advances in Neural Information Processing Systems, vol. 30, pp. 4765–4774. Curran Associates, Inc. (2017). http://papers.nips.cc/paper/7062-a-unified-approach-to-interpreting-model-predictions.pdf

  8. McKelvey, R.D., McLennan, A.: Chapter 2 Computation of equilibria in finite games. In: Handbook of Computational Economics, vol. 1, pp. 87–142. Elsevier (1996). https://doi.org/10.1016/S1574-0021(96)01004-0. http://www.sciencedirect.com/science/article/pii/S1574002196010040

  9. Pedregosa, F., et al.: Scikit-learn: machine learning in Python. J. Mach. Learn. Res. 12, 2825–2830 (2011)

    MathSciNet  MATH  Google Scholar 

  10. Rosset, S.: Model selection via the AUC. In: Proceedings of the Twenty-First International Conference on Machine Learning, ICML 2004. p. 89. Association for Computing Machinery, New York (2004). https://doi.org/10.1145/1015330.1015400

  11. Schuurmans, D., Zinkevich, M.A.: Deep learning games. In: Lee, D.D., Sugiyama, M., Luxburg, U.V., Guyon, I., Garnett, R. (eds.) Advances in Neural Information Processing Systems, vol. 29, pp. 1678–1686. Curran Associates, Inc. (2016). http://papers.nips.cc/paper/6315-deep-learning-games.pdf

  12. Strumbelj, E., Kononenko, I.: An efficient explanation of individual classifications using game theory. J. Mach. Learn. Res. 11, 1–18 (2010)

    MathSciNet  MATH  Google Scholar 

  13. Tan, P.N., Steinbach, M., Karpatne, A., Kumar, V.: Introduction to Data Mining, 2nd edn. Pearson, London (2018)

    Google Scholar 

Download references

Acknowledgments

The first author would like to acknowledge the financial support provided for this research by Babe-Bolyai University grant GTC 31379/2020.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Rodica Ioana Lung .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Suciu, MA., Lung, R.I. (2020). Nash Equilibrium as a Solution in Supervised Classification. In: Bäck, T., et al. Parallel Problem Solving from Nature – PPSN XVI. PPSN 2020. Lecture Notes in Computer Science(), vol 12269. Springer, Cham. https://doi.org/10.1007/978-3-030-58112-1_37

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-58112-1_37

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-58111-4

  • Online ISBN: 978-3-030-58112-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Navigation