Wasserstein-2 distance
PulseAugur coverage of Wasserstein-2 distance — every cluster mentioning Wasserstein-2 distance across labs, papers, and developer communities, ranked by signal.
3 day(s) with sentiment data
-
New SG-TULA algorithm offers improved sampling for complex AI models
Researchers have developed the Subgradient Tamed Unadjusted Langevin Algorithm (SG-TULA), a novel method for sampling from complex distributions that are non-smooth, non-convex, and have superlinear gradient growth. Thi…
-
New research explores advanced diffusion models for generation, robustness, and speed
Researchers are developing advanced diffusion models for various applications, including image generation, time-series synthesis, and natural language processing. New methods like Simplax aim to improve categorical gene…
-
New HMC algorithms tackle bias and accelerate sampling times · 7 sources tracked
Researchers have developed new methods to address bias and improve efficiency in Hamiltonian Monte Carlo (HMC) algorithms. One study extends the concept of bias delocalization to unadjusted HMC and underdamped Langevin …
-
New paper explores uniform-in-time propagation-of-chaos for SVGD
Researchers have published a paper detailing uniform-in-time propagation-of-chaos for Stein Variational Gradient Descent (SVGD). The study introduces a cutoff strategy for broad distributional metrics, yielding propagat…
-
New Theory Guarantees Convergence for Decentralized Diffusion Models
Researchers have established a theoretical convergence guarantee for decentralized diffusion models using ODE-based sampling. This work provides the first Wasserstein-2 distance convergence result for such architectures…
-
New Langevin Dynamics Methods Enhance Sampling for Complex Distributions
Two new arXiv papers explore advanced Langevin dynamics for improved sampling in machine learning. The first paper introduces TIPreL, a novel time- and position-dependent preconditioner designed to simultaneously addres…