Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,657 papers · 148 categories

Trend · papers per month

3617221,0821,443 · Jun 202019922001200920172026
48 results for Latent diffusion models

LADD models improve discrete diffusion for faster language generation.

problem Practical discrete diffusion models ignore cross-token dependencies, degrading performance.
method Introduces a learnable auxiliary latent channel, diffusing over the joint (token, latent) space.
result LADD models yield improvements on unconditional generation metrics.

A new TTS method uses diffusion and VAE for better speech synthesis.

problem Improving text-to-speech synthesis for better speech quality and robustness.
method Combines diffusion probabilistic model and variational autoencoder for latent variable conversion.
result The method is robust to poor orthography and alignment errors.

DDVI uses diffusion models for variational inference, improving latent variable model performance.

problem Improving variational inference in latent variable models.
method Introduces diffusion-based variational posteriors trained with a regularized ELBO.
result Outperforms alternative variational posteriors on various benchmarks and a biology task.

Paper introduces a new generative learning model using Schrödinger bridge diffusion in latent space.

problem Learning distributions from divergent data distributions.
method Pre-training with large-scale models, Schrödinger bridge diffusion model in latent space.
result Effective control of second-order Wasserstein distance between generated and target distributions.

Proposes LDIDPs for efficient sequential data generation from latent dynamical models.

problem Challenges in generating high-fidelity sequential samples from latent dynamical models.
method Utilizes implicit diffusion processes to sample from latent dynamical processes.
result Demonstrates accurate learning of dynamics and efficient generation of high-quality sequential data.

Paper analyzes latent space geometry in generative models using Fisher information.

problem Understanding the structure of latent spaces in generative models.
method Reconstructs Fisher information metric from generated samples and posterior distribution.
result Reveals fractal structure and abrupt changes in Fisher metric at phase boundaries.

Pixel-space diffusion models outperform latent models on high-resolution image synthesis.

problem Efficiency and quality trade-off in high-resolution image synthesis.
method Sigmoid loss-weighting, simplified architecture, and resolution scaling.
result Achieved 1.5 FID on ImageNet512, new SOTA results on other datasets.

We solve continuous-time latent SDE identifiability using diffusion shifts.

problem Identifiability of latent SDEs in continuous-time time series.
method Environment-induced shifts in diffusion covariance for additive-noise latent SDEs.
result Two diagonal diffusion regimes with distinct variance ratios identify latent coordinates up to permutation and scaling.

Study on reliability of latent reuse in diffusion models under distribution shift.

problem When can latent spaces from a source dataset be reused for a target dataset with different distributions?
method Considered a source-target setting with approximately low-dimensional datasets near different subspaces. Analyzed the target-domain score error due to principal-angle misalignment and target ambient noise.
result Latent reuse is reliable only if the source and target subspaces are close and the target ambient noise is not too amplified.

New algorithm trains latent diffusion models using interacting particles.

problem Training latent diffusion models efficiently and accurately.
method Reformulate training as minimizing a free energy functional, then approximate with interacting particles.
result The new algorithm outperforms previous methods in experiments.

CADD improves generative quality by augmenting discrete diffusion with continuous latent space.

problem Loss of semantic information between denoising steps in discrete diffusion models.
method Introduces a framework that augments discrete state space with a continuous latent space, allowing for graded, informative masked tokens.
result CADD improves generative quality across text generation, image synthesis, and code modeling.

Co-Diffusion predicts drug-target affinity by learning latent manifolds and diffusion, improving generalization.

problem Cold-start regimes in drug-target affinity prediction due to label scarcity and domain shifts.
method Two-stage framework: latent manifold alignment and latent diffusion regularization.
result Significantly outperforms state-of-the-art baselines, especially in zero-shot generalization.

Early stopping improves sample quality in latent diffusion models.

problem Latent diffusion models degrade sample quality with conventional early stopping.
method Analyzed the interaction between latent dimension and stopping time under Gaussian framework.
result Lower-dimensional representations benefit from earlier termination, higher-dimensional spaces require later stopping.

This paper proposes a method to improve VAEs by extracting latent spaces from pre-trained diffusion models.

problem VAEs struggle with generating high-quality images due to unrealistic Gaussian assumptions.
method Optimizes an encoder to maximize marginal data log-likelihood and derives a decoder analytically.
result The method enhances VAE performance by discarding Gaussian assumptions and training a separate decoder network.

LSSDM improves imputation of multivariate time series data.

problem Imputation of multivariate time series data without labels.
method LSSDM projects observed data into latent space, reconstructs missing values without labels, and uses a conditional diffusion model for precise imputation.
result LSSDM achieves superior imputation performance and uncertainty analysis.

New method uses Diffusion Maps for latent space modeling of dynamical systems.

problem Building reduced dynamical models from time series data.
method Two rounds of Diffusion Maps on latent coordinates, with lifting back to ambient space.
result Approximation of full state functions in reduced coordinates.

VISION-XL improves HD video quality using latent image diffusion models.

problem Improving high-definition video quality and resolution.
method Latent image diffusion models and pseudo-batch consistent sampling.
result State-of-the-art video reconstruction across various inverse problems.

CSDM integrates compressed sensing into diffusion models for faster data generation.

problem Efficiently generating synthetic data in high-dimensional spaces.
method Integrating compressed sensing into diffusion models (CSDM) to reduce dimensionality and accelerate inference.
result Achieves provably faster convergence and better latent space dimension selection.

New model generates realistic single-cell gene expression data.

problem Generating realistic single-cell gene expression profiles is challenging.
method scLDM, a latent diffusion model using Diffusion Transformers and linear interpolants.
result Superior performance in generating realistic single-cell gene expression data.

Paper introduces Latent-CLIP for efficient text-image comparison in latent space.

problem Efficiently compare text and images in latent space without costly decoding.
method Trains CLIP model in latent space, uses Latent-CLIP rewards for noise optimization, and guides generation away from harmful content.
result Latent-CLIP matches CLIP performance on text-image classification and harmful content detection.

KIPLMC methods improve statistical inference in latent variable models.

problem Statistical inference in latent variable models.
method Joint diffusion process in parameter and latent variable spaces, with two explicit discretizations.
result KIPLMC methods achieve accelerated convergence rates in Wasserstein-2 distance.

Latent Block-Diffusion Temporal Point Processes (LBDTPP) is a semi-autoregressive framework for generating asynchronous event sequences.

problem Generating asynchronous event sequences
method Latent Block-Diffusion Temporal Point Processes
result Outperforms state-of-the-art TPP baselines in both unconditional and conditional generation tasks

LION generates high-quality 3D shapes using hierarchical latent diffusion models.

problem Creating high-quality 3D shapes for digital artists.
method Hierarchical Latent Point Diffusion Model (LION) with a global shape latent and point-structured latent space.
result LION achieves state-of-the-art generation performance on ShapeNet benchmarks.

DCM uses diffusion models to answer causal queries from observational data.

problem Answering causal queries from observational data alone.
method Diffusion models to learn causal mechanisms and generate latent encodings.
result Significant improvements over existing methods for causal query answering.

This paper tackles sampling issues in latent space EBMs by introducing diffusion-based amortization.

problem Degenerate MCMC sampling quality hinders latent space EBM learning and generation quality.
method Introduces diffusion-based amortization for long-run MCMC sampling.
result The learned amortization of MCMC is a valid long-run MCMC sampler.

Enhances OOD detection using latent diffusion for more robust and efficient training.

problem Improving reliability of machine learning models in real-world scenarios.
method Proposes Outlier-Aware Learning (OAL) framework that generates synthetic OOD data in latent space and uses MICL and KD modules.
result Demonstrates superior performance on benchmark datasets.

A new model designs molecular latent vectors for drug discovery.

problem Designing effective molecular descriptors from molecular structures.
method Proposes a denoising diffusion probabilistic model (DDPM) for variational autoencoding molecular graphs.
result Demonstrates superior prediction performance and robustness compared to existing approaches.

GLAD improves latent graph generation by quantizing discrete latent space.

problem Latent space graph generative models lack performance and make unnatural assumptions.
method Adapting diffusion bridges to a discrete latent space, avoiding data space decompositions.
result GLAD achieves competitive performance on graph benchmark datasets.

Data assimilation for subsurface flow using latent diffusion models shows that ensemble Kalman methods may overestimate posterior uncertainty, while Monte Carlo sampling is more reliable.

problem Data assimilation for subsurface flow
method Ensemble Kalman smoother and Markov chain Monte Carlo sampling
result Monte Carlo sampling is more reliable than ensemble Kalman methods

Proposes a model to generate high-dimensional financial returns using latent factor structure.

problem Challenges in financial scenario simulation, especially in high-dimensional and small data settings.
method Integrates latent factor structure into generative diffusion processes, decomposing the score function using time-varying orthogonal projections.
result Establishes rigorous statistical guarantees for score estimation and generated distribution, surpassing dimension-dependent limits.