arXiv Machine Learning
Partially Linear Autoencoders for Manifold Learning and Dimensionality Reduction
Read the original on arXiv Machine Learning →The Flow has not summarised this story yet — read it at arXiv Machine Learning.
Related stories
arXiv Machine Learning
3d ago
Learning Through Energy Refinement and Manifold Projection: A Cooperative EBM-AE Framework
arXiv:2609.13917v1 Announce Type: new Abstract: Energy-Based Models (EBMs) provide a flexible framework for generative modeling by learning an energy landscape that assigns low energy values to reali...
arXiv Machine Learning
Jun 17
Variational autoencoders with latent high-dimensional steady geometric flows for dynamics
arXiv:2410. 10137v5 Announce Type: replace Abstract: We develop Riemannian approaches to variational autoencoders (VAEs) for PDE-type ambient data with regularizing geometric latent dynamics, which we refer to as VAE-DLM, or VAEs with dynamical latent manifolds.
arXiv Machine Learning
Jul 1
Sparse POD Mode Selection and Manifold Dimensionality Reduction with Neural Networks
arXiv:2605. 27756v2 Announce Type: replace-cross Abstract: Linear dimensionality reduction methods such as proper orthogonal decomposition (POD) make high-dimensional data amenable to analysis by identifying the principal components, or modes, that capture the most variance, or energy, in the data and constructing a low-dimensional representation in the subspace they span.
arXiv Machine Learning
Jun 4
Geometry-Preserving Encoder/Decoder in Latent Generative Models
arXiv:2501. 09876v3 Announce Type: replace-cross Abstract: Generative modeling aims to generate new data samples that resemble a given dataset.
arXiv Machine Learning
Jun 17
Geodesic Calculus on Implicitly Defined Latent Manifolds
arXiv:2510. 09468v3 Announce Type: replace Abstract: Latent manifolds of autoencoders provide low-dimensional representations of data, which can be studied from a geometric perspective.
arXiv Machine Learning
Sep 7
Nested Inductive Bias Framework for SPD Manifold Learning
The paper introduces a Nested Inductive Bias framework that uses a two‑stage diffeomorphic composition to pull back non‑Euclidean target geometries onto symmetric positive definite (SPD) manifolds. This approach allows the construction of curvature‑aligned Riemannian classifiers that respect both matrix constraints and the intrinsic relational geometry of data. Empirical results on kinematic, signal processing, and synthetic benchmarks show that class separability degrades when metric curvature does not match the data distribution, and the authors also propose the Rational Conformal Metric (RCM) for robust vectorized architectures.