ML0074 Linear vs Non-Linear Reduction

What is the difference between linear and non-linear dimensionality reduction? Give examples of each.

Answer

Linear methods rotate and project: the low-dimensional representation is a linear function of the original features, as in PCA, LDA, or truncated SVD. Non-linear methods learn a curved mapping, so they can unroll manifolds that no flat projection can represent, as in t-SNE, UMAP, Isomap, and autoencoders. The price of curvature is weaker guarantees: a linear projection preserves global geometry as well as any linear map can and gives a reusable transform for new points, while neighbor-graph methods such as t-SNE and UMAP preserve local neighborhoods but distort global distances and produce no reusable mapping (autoencoders and parametric t-SNE are the exceptions).

(1) Linear Methods: closed-form, fast, invertible on the kept subspace, and out-of-sample points reuse the same projection matrix. Examples: PCA, LDA, truncated SVD.
(2) Non-Linear Methods: capture curved manifolds and cluster structure that projections cannot. Examples: t-SNE and UMAP (neighbor graphs), Isomap (geodesic distances), autoencoders (a learned parametric map).
(3) Choose by Purpose: preprocessing for a downstream model calls for a linear method; 2D visualization of clusters calls for a non-linear one. Production pipelines often chain them: 10x Genomics’ Cell Ranger reduces single-cell gene expression with PCA first, then computes t-SNE or UMAP projections on the top components for its Loupe Browser maps.

Three panels: a horseshoe-shaped manifold of points, its PCA projection collapsing the two ends together, and a non-linear unrolling that orders the points along the true intrinsic coordinate

Figure 1: Why curvature matters: the horseshoe’s two ends are close in ambient space but far apart along the manifold. PCA projects along a straight axis and collapses the ends together; a non-linear method unrolls the curve and keeps the true ordering.

Mathematical Formulation:
z_i = W^{\top} x_i \ \ (W \in \mathbb{R}^{d \times k},\ \text{linear})
z_i = g_{\phi}(x_i) \ \ (g\ \text{learned, non-linear})

Where:

  • W is an orthonormal projection matrix and z_i the k-dimensional representation of x_i.
  • g_{\phi} is a learned map such as an autoencoder’s encoder; its parameters \phi are fitted by gradient descent.
  • t-SNE and UMAP are transductive: they output the coordinates z_i directly without an explicit g, so new points need a parametric variant or a refit.
FeatureLinear (PCA, LDA, SVD)Non-Linear (t-SNE, UMAP, Autoencoder)
MappingFixed matrix WLearned or implicit g
Global GeometryPreserved as well as a linear map allowsDistorted: cluster sizes and distances not meaningful
New PointsApply the same WAutoencoder: yes; t-SNE/UMAP: refit or parametric variant
Failure ModeCurved manifolds collapseOver-read clusters; stochastic restarts differ
Best UsePreprocessing, compression, de-correlationVisualization, cluster discovery
Same clustered data embedded two ways: PCA projection with clusters overlapping, versus a UMAP-style embedding with clusters cleanly separated

Figure 2: The same clustered data through both lenses. PCA (left) keeps global spread but overlaps clusters that are not linearly separable; the non-linear embedding (right) separates the clusters, at the cost of making distances between them uninterpretable.


Login to view more content


Log in to track your progress

Comments

Leave a Reply

Your email address will not be published. Required fields are marked *