A Generalized EigenGame with Extensions to Multiview Representation Learning
James Chapman, Ana Lawry Aguila, Lennie Wells

TL;DR
This paper introduces a novel game-theoretic approach to solving generalized eigenvalue problems, enabling scalable deep multiview representation learning with state-of-the-art results on Deep CCA.
Contribution
It develops a stochastic GEP solver inspired by Hebbian algorithms and game theory, extending to neural networks for deep multiview learning.
Findings
Achieves state-of-the-art performance on Deep CCA
Enables scalable stochastic GEP solutions with neural networks
Demonstrates effectiveness on canonical multiview datasets
Abstract
Generalized Eigenvalue Problems (GEPs) encompass a range of interesting dimensionality reduction methods. Development of efficient stochastic approaches to these problems would allow them to scale to larger datasets. Canonical Correlation Analysis (CCA) is one example of a GEP for dimensionality reduction which has found extensive use in problems with two or more views of the data. Deep learning extensions of CCA require large mini-batch sizes, and therefore large memory consumption, in the stochastic setting to achieve good performance and this has limited its application in practice. Inspired by the Generalized Hebbian Algorithm, we develop an approach to solving stochastic GEPs in which all constraints are softly enforced by Lagrange multipliers. Then by considering the integral of this Lagrangian function, its pseudo-utility, and inspired by recent formulations of Principal…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsStatistical Mechanics and Entropy · Bayesian Methods and Mixture Models · Bayesian Modeling and Causal Inference
