arXiv Machine Learning By Zhiwei Han, Stefan Matthes, Hao Shen

Provable Subspace Identification of Nonlinear Multi-view CCA

Read the original on arXiv Machine Learning →

arXiv:2602. 23785v2 Announce Type: replace Abstract: We investigate the identifiability of nonlinear canonical correlation analysis (CCA) in a multi-view setup, in which each view is generated by applying an unknown nonlinear map to a linear mixture of shared latent variables plus view-private noise.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

arXiv Machine Learning
Jun 30

Nonlinear mixture model motivated subspace clustering

arXiv:2606. 29261v1 Announce Type: new Abstract: We derive the linear union-of-subspaces (UoS) model for subspace clustering (SC) from the nonlinear mixture model (NMM) used in blind source separation (BSS) to represent a D-dimensional observation vector as an unknown multivariate nonlinear mapping of C latent variables.

By Ivica Kopriva
arXiv Machine Learning
Aug 20

Fair Multi-View Determinantal Coresets via Adaptive NEPv

The paper introduces a method for selecting a small, diverse subset from a large pool by addressing multiple, potentially conflicting notions of diversity. It formulates a fair multi‑view determinant selection problem that maximizes the weakest per‑view log determinant of a size‑k subset, smooths and relaxes the objective to the Stiefel manifold, and derives an adaptive self‑consistent‑field solver with damping and level shifting. The solver operates using only feature‑map products for each view and includes a rounding step via leverage‑score screening followed by fair local refinement.

By Richard Yi Da Xu
arXiv Statistics ML
4d ago

Copula Active Subspaces I: A Score-Covariance Method for Reduced-Order Non-Gaussian Density Estimation

arXiv:2609. 36142v1 Announce Type: cross Abstract: In Bayesian inference problems with non-Gaussian observation noise, the posterior is only as accurate as the noise density, and gradient-based samplers need that density and its gradient evaluable pointwise, whether from an explicit expression or from code, and without an inner solve.

By Joshua Chen, Peter Jan van Leeuwen