arXiv Machine Learning

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 AI
Sep 2

Geometry-aware Latent Autoregressive Generative Model for PDEs in Complex Domains

The paper introduces GeoLAMP, a Geometry-aware Latent Autoregressive generative Model designed to solve multiphysics partial differential equations in highly irregular, micro‑scale tortuous geometries. GeoLAMP employs a dual‑encoder graph architecture to capture both global topology and fine‑scale geometry, transforms real‑space fields into compact latent representations, and uses a causal self‑attention transformer with flow matching for stable, scalable block‑wise autoregressive prediction. The model is evaluated on three benchmark datasets—reactive flow, heat convection, and elasticity—showing consistently low errors across the entire rollout horizon.

By Zi Wang, Minghui Xu, Tapan Mukerji
arXiv Computer Vision
Sep 23

Latent Dataset Distillation for Human Motion Prediction

The paper introduces a latent dataset distillation framework for human motion prediction, addressing the limitations of traditional gradient matching by incorporating a learned motion prior. Motions are compressed using a residual‑quantized variational autoencoder, and distillation updates only a latent bank while keeping the decoder frozen, ensuring synthetic motions remain plausible. Experiments on Human3.6M, CMU, and 3DPW datasets demonstrate that this method outperforms direct gradient matching in most settings and yields more realistic synthetic motions.

By Ge Tian, Guang Li, Takahiro Ogawa, Miki Haseyama
arXiv Machine Learning
Sep 14

Nonlinear Dimensionality Reduction Techniques for Bayesian Optimization

The paper investigates nonlinear dimensionality reduction for Bayesian optimisation (BO) by transforming high‑dimensional black‑box optimisation problems into a sequence of low‑dimensional latent‑space BO (LSBO) tasks. It extends earlier linear embedding approaches by using variational autoencoders (VAEs), deep metric loss, and adaptive retraining to better capture nonlinear structure, and couples LSBO with sequential domain reduction (SDR‑LSBO) to progressively narrow search domains. Experiments on GPU‑accelerated BoTorch with Matérn‑5/2 Gaussian‑process surrogates show that VAE‑based LSBO outperforms adaptive linear embeddings, and the authors provide a theoretical analysis of latent‑space error versus representation gap under PAC‑Bayes conditions.

By Luo Long, Coralia Cartis, Paz Fink Shustin