Timezone: »

 
Poster
An Online Riemannian PCA for Stochastic Canonical Correlation Analysis
Zihang Meng · Rudrasis Chakraborty · Vikas Singh

Thu Dec 09 08:30 AM -- 10:00 AM (PST) @
in Poster Session 6 »
We present an efficient stochastic algorithm (RSG+) for canonical correlation analysis (CCA) using a reparametrization of the projection matrices. We show how this reparametrization (into structured matrices), simple in hindsight, directly presents an opportunity to repurpose/adjust mature techniques for numerical optimization on Riemannian manifolds. Our developments nicely complement existing methods for this problem which either require $O(d^3)$ time complexity per iteration with $O(\frac{1}{\sqrt{t}})$ convergence rate (where $d$ is the dimensionality) or only extract the top $1$ component with $O(\frac{1}{t})$ convergence rate. In contrast, our algorithm offers a strict improvement for this classical problem: it achieves $O(d^2k)$ runtime complexity per iteration for extracting the top $k$ canonical components with $O(\frac{1}{t})$ convergence rate. While the paper primarily focuses on the formulation and technical analysis of its properties, our experiments show that the empirical behavior on common datasets is quite promising, We also explore a potential application in training fair models where the label of protected attribute is missing or otherwise unavailable.
Keywords: Optimization · Fairness

Author Information

Zihang Meng (University of Wisconsin, Madison)
Rudrasis Chakraborty (University of Florida)
Vikas Singh (UW-Madison)

More from the Same Authors