A Mean Field Games model for finite mixtures of Bernoulli distributions

Finite mixture models are an important tool in the statistical analysis of data, for example in data clustering. The optimal parameters of a mixture model are usually computed by maximizing the log-likelihood functional via the Expectation-Maximization algorithm. We propose an alternative approach based on the theory of Mean Field Games, a class of differential games with an infinite number of agents. We show that the solution of a finite state space multi-population Mean Field Games system characterizes the critical points of the log-likelihood functional for a Bernoulli mixture. The approach is then generalized to mixture models of categorical distributions. Hence, the Mean Field Games approach provides a method to compute the parameters of the mixture model, and we show its application to some standard examples in cluster analysis.

[1]  Radford M. Neal Pattern Recognition and Machine Learning , 2007, Technometrics.

[2]  P. Deb Finite Mixture Models , 2008 .

[3]  M. C. Jones,et al.  Model-Free Curve Estimation , 1993 .

[4]  P. Lions,et al.  Mean field games , 2007 .

[5]  M. Wedel,et al.  Market Segmentation: Conceptual and Methodological Foundations , 1997 .

[6]  A. F. Smith,et al.  Statistical analysis of finite mixture distributions , 1986 .

[7]  Bruno Sinopoli,et al.  Unsupervised learning of finite mixture models using mean field games , 2011, 2011 49th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[8]  Mathieu Laurière,et al.  Convergence Analysis of Machine Learning Algorithms for the Numerical Solution of Mean Field Control and Games: I - The Ergodic Case , 2019, The Annals of Applied Probability.

[9]  Simone Cacace,et al.  A Mean Field Games Approach to Cluster Analysis , 2019, Applied Mathematics & Optimization.

[10]  Jean-Luc Coron Quelques exemples de jeux à champ moyen , 2017 .

[11]  Mérouane Debbah,et al.  Transmit Strategies for Massive Machine-Type Communications based on Mean Field Games , 2018, 2018 15th International Symposium on Wireless Communication Systems (ISWCS).

[12]  D. Gomes,et al.  Discrete Time, Finite State Space Mean Field Games , 2010 .

[13]  Mathieu Lauriere,et al.  Convergence Analysis of Machine Learning Algorithms for the Numerical Solution of Mean Field Control and Games I: The Ergodic Case , 2019, SIAM J. Numer. Anal..

[14]  K. Pearson Contributions to the Mathematical Theory of Evolution , 1894 .

[15]  Peter E. Caines,et al.  Large population stochastic dynamic games: closed-loop McKean-Vlasov systems and the Nash certainty equivalence principle , 2006, Commun. Inf. Syst..

[16]  Diogo A. Gomes,et al.  Mean Field Games Models—A Brief Survey , 2013, Dynamic Games and Applications.

[17]  Jeff A. Bilmes,et al.  A gentle tutorial of the em algorithm and its application to parameter estimation for Gaussian mixture and hidden Markov models , 1998 .

[18]  Robert M. Wharton Model-Free Curve Estimation , 1995 .

[19]  E Weinan,et al.  A mean-field optimal control formulation of deep learning , 2018, Research in the Mathematical Sciences.