From Optima to Equilibria: Game-theoretic Modelsof Pattern Analysis and Recognition.
Since its introduction by John von Neumann in the 1940s, game theory has provided a powerful mathematical language for modeling systems of interacting agents with potentially conflicting objectives. Unlike classical optimization, which relies on a single global objective function, game theory shifts the focus to equilibrium as a fundamental organizing principle for complex systems. In this talk, I will present a long-standing research program developed over the past two decades that explores a game-theoretic perspective on machine learning and pattern recognition. The central idea is to interpret data elements—such as points, labels, or features—as interacting agents, whose relationships are encoded through payoff functions, and whose collective behavior is described in terms of equilibrium configurations. This viewpoint leads to principled formulations of clustering, semi-supervised learning, graph matching, and contextual classification, and reveals deep connections between evolutionary dynamics, quadratic optimization, and graph-based learning. Beyond offering a unifying conceptual framework, equilibrium-based modeling provides natural support for soft assignments, robustness to noise, and distributed computational schemes with well-defined stability properties. Applications to computer vision illustrate how equilibrium thinking can complement, and in some cases reshape, traditional optimization-based approaches in modern AI.
Date and Time
Location
Hosts
Registration
Speakers
Marcello Pelillo
From Optima to Equilibria: Game-theoretic Modelsof Pattern Analysis and Recognition.
Since its introduction by John von Neumann in the 1940s, game theory has provided a powerful mathematical language for modeling systems of interacting agents with potentially conflicting objectives. Unlike classical optimization, which relies on a single global objective function, game theory shifts the focus to equilibrium as a fundamental organizing principle for complex systems. In this talk, I will present a long-standing research program developed over the past two decades that explores a game-theoretic perspective on machine learning and pattern recognition. The central idea is to interpret data elements—such as points, labels, or features—as interacting agents, whose relationships are encoded through payoff functions, and whose collective behavior is described in terms of equilibrium configurations. This viewpoint leads to principled formulations of clustering, semi-supervised learning, graph matching, and contextual classification, and reveals deep connections between evolutionary dynamics, quadratic optimization, and graph-based learning. Beyond offering a unifying conceptual framework, equilibrium-based modeling provides natural support for soft assignments, robustness to noise, and distributed computational schemes with well-defined stability properties. Applications to computer vision illustrate how equilibrium thinking can complement, and in some cases reshape, traditional optimization-based approaches in modern AI.
Biography:
Media
| Meeting Record Photo | 308.61 KiB | |
| Meeting Record Photo | 174.49 KiB |
Add Event to Calendar