n sets of vectors, where each set
k vectors in
R^d. I know there is some unknown linear transformation
W under which the distance matrix
kxk matrix) is approximately "the same" (i.e. has a low variance) among all sets
To illustrate, it might be the case that for each vector in each
S_i, the first
k/2 numbers are random noise, and the latter
k/2 are the same for each
i. In this case,
W would recover the last
k/2 elements from each vector. But in practice the structure of the vectors may be more complex than in this toy example.
Is there a method to learn
W - either using direct linear algebra methods, or through learning (e.g. by optimizing a specific loss on the distance matrices), without finding the naive solution of
W being the zero mapping, or other mapping that maps all vectors to the same vector?
A possible appraoch I was considering is applying a variant of Canonical correlation analysis (CCA) on the distance matrices. CCA projects two "views" of the same data to a shared subspace that maximizes the total correlation between the views; is there a variant of CCA in which the views are not pairs of vectors, but rather sets of vectors that each has some internal structure (as expressed by the distance matrices)? while in CCA we maximize the correlation between the pairs, here I'd like to maximize the correlation between the distance matrices of the different sets.