Skip to yearly menu bar Skip to main content


Poster

Towards Practical Alternating Least-Squares for CCA

Zhiqiang Xu · Ping Li

East Exhibition Hall B + C #4

Keywords: [ Components Analysis (e.g., CCA, ICA, LDA, PCA) ] [ Unsupervised Learning ] [ Algorithms ]


Abstract:

Alternating least-squares (ALS) is a simple yet effective solver for canonical correlation analysis (CCA). In terms of ease of use, ALS is arguably practitioners' first choice. Despite recent provably guaranteed variants, the empirical performance often remains unsatisfactory. To promote the practical use of ALS for CCA, we propose truly alternating least-squares. Instead of approximately solving two independent linear systems, in each iteration, it simply solves two coupled linear systems of half the size. It turns out that this coupling procedure is able to bring significant performance improvements in practice. Inspired by accelerated power method, we further propose faster alternating least-squares, where momentum terms are introduced into the update equations. Both algorithms enjoy linear convergence. To make faster ALS even more practical, we put forward adaptive alternating least-squares to avoid tuning the momentum parameter, which is as easy to use as the plain ALS while retaining advantages of the fast version. Experiments on several datasets empirically demonstrate the superiority of the proposed algorithms to recent variants.

Live content is unavailable. Log in and register to view live content