We lifted 9 functions out of this paper's own repositories and ran 9 of them in a sandbox. "Ran" means the function executed on a synthesized input and returned a value. It is not a reproduction of the paper's results.
| Repository | Role | Ran |
|---|---|---|
| jameschapman19/cca_zoo | pwc_unofficial | 9 of 9 |
| Function | Status | Where it lives |
|---|---|---|
| ey_cross_covariance | Ran | jameschapman19/cca_zoo/cca_zoo/_utils/_ey.py code served (permissive licence) · get_code("3393b769827b0aa7") |
| ey_loss | Ran | jameschapman19/cca_zoo/cca_zoo/_utils/_ey.py code served (permissive licence) · get_code("1665525b2f463810") |
| gevp | Ran | jameschapman19/cca_zoo/cca_zoo/_utils/_linalg.py code served (permissive licence) · get_code("2482d8594a6697e8") |
| perview_parameter | Ran | jameschapman19/cca_zoo/cca_zoo/_utils/_validation.py code served (permissive licence) · get_code("a8305f3ef2d757e2") |
| procrustes_rotation | Ran | jameschapman19/cca_zoo/cca_zoo/model_selection/_significance.py code served (permissive licence) · get_code("6d626058314ed66b") |
| soft_threshold | Ran | jameschapman19/cca_zoo/cca_zoo/_utils/_linalg.py code served (permissive licence) · get_code("21818c213b2a1315") |
| svd_whiten | Ran | jameschapman19/cca_zoo/cca_zoo/_utils/_linalg.py code served (permissive licence) · get_code("530564192d143f96") |
| validate_views | Ran | jameschapman19/cca_zoo/cca_zoo/_utils/_validation.py code served (permissive licence) · get_code("9d12d25978185086") |
| weight_gram_mean | Ran | jameschapman19/cca_zoo/cca_zoo/_utils/_ey.py code served (permissive licence) · get_code("910ca463740e6918") |
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
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 Components Analysis and GEPs as games with differentiable utilities, we develop a game-theory inspired approach to solving GEPs. We show that our approaches share much of the theoretical grounding of the previous Hebbian and game theoretic approaches for the linear case but our method permits extension to general function approximators like neural networks for certain GEPs for dimensionality reduction including CCA which means our method can be used for deep multiview representation learning. We demonstrate the effectiveness of our method for solving GEPs in the stochastic setting using canonical multiview datasets and demonstrate state-of-the-art performance for optimizing Deep CCA.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2211.11323")
get_code_for_paper("2211.11323")
have("2211.11323")
Connect an agent — have() is free.