Jan. 17, 2022, 2:10 a.m. | Leying Guan

stat.ML updates on arXiv.org arxiv.org

Multi-block CCA constructs linear relationships explaining coherent
variations across multiple blocks of data. We view the multi-block CCA problem
as finding leading generalized eigenvectors and propose to solve it via a
proximal gradient descent algorithm with $\ell_1$ constraint for high
dimensional data. In particular, we use a decaying sequence of constraints over
proximal iterations, and show that the resulting estimate is rate-optimal under
suitable assumptions. Although several previous works have demonstrated such
optimality for the $\ell_0$ constrained problem using iterative …

analysis arxiv correlation gradient

Senior Marketing Data Analyst

@ Amazon.com | Amsterdam, North Holland, NLD

Senior Data Analyst

@ MoneyLion | Kuala Lumpur, Kuala Lumpur, Malaysia

Data Management Specialist - Office of the CDO - Chase- Associate

@ JPMorgan Chase & Co. | LONDON, LONDON, United Kingdom

BI Data Analyst

@ Nedbank | Johannesburg, ZA

Head of Data Science and Artificial Intelligence (m/f/d)

@ Project A Ventures | Munich, Germany

Senior Data Scientist - GenAI

@ Roche | Hyderabad RSS