arXiv Machine Learning

Partially Linear Autoencoders for Manifold Learning and Dimensionality Reduction

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.

By Tomoki Koike, Prakash Mohan, Marc T. Henry de Frahan, Elizabeth Qian, Julie Bessac
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.

By Tushar Das
arXiv Machine Learning
Sep 24

On the Diffusibility of High-Dimensional Latents

The paper investigates how fine‑tuning pretrained visual encoders for faithful image reconstruction affects diffusion models that operate in the resulting latent space. It finds that such fine‑tuning reduces the effective dimensionality of the latent representation, causing standard velocity‑prediction flow‑matching to fit noise outside the low‑dimensional signal manifold and making optimization inefficient. Consequently, the authors propose using a clean‑data ($oldsymbol{x}_{0}$) parameterization, which focuses learning on the signal manifold and consistently improves text‑to‑image generation across multiple strong‑reconstruction encoders.

By Chao Feng, Zhiyang Xu, Bowei Chen, Yuanjun Xiong, Xiyao Wang, Jui-Hsien Wang, Richard Zhang, Zhe Lin, Andrew Owens, Yijun Li
arXiv Machine Learning
Oct 21

LocaLeJEPA: Maximum Entropy Representations under Geometric Priors

LocaLeJEPA extends Joint-Embedding Predictive Architectures (JEPA) by introducing a manifold-theoretic reformulation that aligns representation learning with non‑Euclidean geometric priors. It incorporates a locally Euclidean distribution‑matching regularizer, LocaLeReg, to stabilize training and scale to large models. Experiments on ImageNet‑1K show that LocaLeJEPA outperforms the original LeJEPA across both hyperbolic and Euclidean backbones, improving linear and k‑NN classification as well as downstream tasks.

By Kartik Tandon, Alessio Borgi, Pavel Snopov, In\'es Garc\'ia-Redondo, Davide D'Ascenzo, Sebastiano Cultrera di Montesano, Fabrizio Silvestri, Pietro Li\`o, Francesca Dominici, Randall Balestriero, Claudio Battiloro