Paris A. Karakasis, Walid Saad · 2026 · Entropy
DOI: 10.3390/e28101161 · cited by 0 works (OpenAlex) · open-access PDF
Beaucoup de problèmes dans le traitement des signaux, l'apprentissage automatique et la neuroimagerie fournissent plusieurs mesures observées conjointement des parties d'un processus, chacun mélangeant un composant commun à tous avec un composant privé à lui-même, et nécessite que le composant commun soit récupéré sans surveillance. Ce problème a été étudié dans plusieurs communautés, en grande partie indépendamment. Les statisticiens ont proposé l'analyse de la corrélation canonique (CCA), introduite par Hotelling en 1936. Les théoriciens de l'information ont proposé deux notions d'informations communes, en raison de Gács et Körner et de Wyner. Les ingénieurs ont développé des méthodes de sous-espaces pour les ensembles de capteurs et les communications
Machine translation (Meta M2M100); the English original follows.
Many problems in signal processing, machine learning, and neuroimaging provide several jointly observed measurements of one process, each mixing a component common to all of them with a component private to itself, and require the common component to be recovered without supervision. This problem has been studied in several communities, largely independently. Statisticians proposed canonical correlation analysis (CCA), introduced by Hotelling in 1936. Information theorists proposed two notions of common information, due to Gács and Körner and to Wyner. Engineers developed subspace methods for sensor arrays and multiuser communications to design multiview receivers. This tutorial presents the main results and tools each community developed for this problem in a single exposition, and explains the connections that emerge where they meet, distinguishing exact equivalences from special cases and analogies. We develop the information-theoretic foundation from first principles. We then introduce CCA and its extension to several views, followed by the engineering thread from blind multiuser detection to CCA as a blind receiver. Next, we turn to nonlinear CCA, covering kernel, deep, and probabilistic formulations, the conditions under which the common factor is identifiable, and connections to self-supervised learning. We conclude with a discussion of further extensions and open directions. The exposition is self-contained, so that readers from each of these communities can follow the parts developed by the others.
Read in: English · Spanish · Chinese · Hindi · Arabic · Portuguese · French · German · Japanese · Russian · Korean · Indonesian · Vietnamese
Topics: Canonical correlation, Probabilistic logic, Computer science, Artificial intelligence, Bridging (networking), Subspace topology
GET https://store.agentexchange.work/gw/papers/verify?title=...&year=... (0.003 USD), fetch this record as JSON with /gw/papers/paper?id=2610.28978, or list what it cites with /gw/papers/references?id=.... Pay per call in USDC (x402) or with a 19 USD card key for 1,000 calls. Catalogue · llms.txtSources: OpenAlex (CC0), arXiv, Crossref. Agent Exchange