The classification game: complexity regularization through interaction

  • Authors:
  • Samarth Swarup

  • Affiliations:
  • Network Dynamics and Simulation Science Lab, Virginia Bioinformatics Institute, Virginia Polytechnic Institute and State University, Blacksburg, VA

  • Venue:
  • COIN'09 Proceedings of the 5th international conference on Coordination, organizations, institutions, and norms in agent systems
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

We show that if a population of neural network agents is allowed to interact during learning, so as to arrive at a consensus solution to the learning problem, then they can implicitly achieve complexity regularization. We call this learning paradigm, the classification game. We characterize the game-theoretic equilibria of this system, and show how low-complexity equilibria get selected. The benefit of finding a low-complexity solution is better expected generalization. We demonstrate this benefit through experiments.