Foundations of Coupled Nonlinear Dimensionality Reduction
Mehryar Mohri, Afshin Rostamizadeh, Dmitry Storcheus

TL;DR
This paper introduces the concept of coupled nonlinear dimensionality reduction, providing new generalization bounds and an algorithm, with theoretical guarantees applicable to various kernel-based learning scenarios.
Contribution
It presents the first learning guarantees for coupled dimensionality reduction, analyzing Rademacher complexity and proposing a structural risk minimization algorithm.
Findings
Established upper bounds on Rademacher complexity involving Ky-Fan r-norm
Provided both upper and lower bounds justified by the hypothesis set
Developed an algorithm based on theoretical analysis for coupled manifold and separation function fitting
Abstract
In this paper we introduce and analyze the learning scenario of \emph{coupled nonlinear dimensionality reduction}, which combines two major steps of machine learning pipeline: projection onto a manifold and subsequent supervised learning. First, we present new generalization bounds for this scenario and, second, we introduce an algorithm that follows from these bounds. The generalization error bound is based on a careful analysis of the empirical Rademacher complexity of the relevant hypothesis set. In particular, we show an upper bound on the Rademacher complexity that is in , where is the sample size and the upper bound on the Ky-Fan -norm of the associated kernel matrix. We give both upper and lower bound guarantees in terms of that Ky-Fan -norm, which strongly justifies the definition of our hypothesis set. To the best…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsSparse and Compressive Sensing Techniques · Face and Expression Recognition · Machine Learning and Algorithms
