Regularizers versus Losses for Nonlinear Dimensionality Reduction: A Factored View with New Convex Relaxations
Yaoliang Yu (University of Alberta), James Neufeld (University of, Alberta), Ryan Kiros (University of Alberta), Xinhua Zhang (University of, Alberta), Dale Schuurmans (University of Alberta)

TL;DR
This paper presents a unified view of nonlinear dimensionality reduction methods as regularized loss minimization with singular value truncation, introducing new convex regularizers for improved manifold unfolding.
Contribution
It offers a factored perspective distinguishing loss and regularizer roles, and derives novel convex regularizers combining distance maximization with rank reduction.
Findings
New convex regularizers for manifold unfolding
A unified framework for nonlinear dimensionality reduction methods
Identification of a useful new loss for manifold unfolding
Abstract
We demonstrate that almost all non-parametric dimensionality reduction methods can be expressed by a simple procedure: regularized loss minimization plus singular value truncation. By distinguishing the role of the loss and regularizer in such a process, we recover a factored perspective that reveals some gaps in the current literature. Beyond identifying a useful new loss for manifold unfolding, a key contribution is to derive new convex regularizers that combine distance maximization with rank reduction. These regularizers can be applied to any loss.
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 · Numerical methods in inverse problems · Image and Signal Denoising Methods
