Two-Manifold Problems

Details Two-Manifold Problems Two-Manifold Problems

2011-12-29

arxiv.org/abs/1112.6399v1

Computer Science

Learning

Scientific paper

Recently, there has been much interest in spectral approaches to learning manifolds---so-called kernel eigenmap methods. These methods have had some successes, but their applicability is limited because they are not robust to noise. To address this limitation, we look at two-manifold problems, in which we simultaneously reconstruct two related manifolds, each representing a different view of the same data. By solving these interconnected learning problems together and allowing information to flow between them, two-manifold algorithms are able to succeed where a non-integrated approach would fail: each view allows us to suppress noise in the other, reducing bias in the same way that an instrumental variable allows us to remove bias in a {linear} dimensionality reduction problem. We propose a class of algorithms for two-manifold problems, based on spectral decomposition of cross-covariance operators in Hilbert space. Finally, we discuss situations where two-manifold problems are useful, and demonstrate that solving a two-manifold problem can aid in learning a nonlinear dynamical system from limited data.

Affiliated with

Also associated with

No associations

Rating

Two-Manifold Problems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Two-Manifold Problems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Two-Manifold Problems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-728736