Wasserstein metric
PulseAugur coverage of Wasserstein metric — every cluster mentioning Wasserstein metric across labs, papers, and developer communities, ranked by signal.
- instance of ScienceCast 90%
- instance of optimal transport 90%
- used by Gaussian function 90%
- used by alphaXiv 70%
- instance of alphaXiv 70%
- instance of Gotit.pub 70%
- instance of DagsHub 70%
- used by optimal transport 70%
- used by Gotit.pub 70%
- instance of CatalyzeX 70%
- instance of Gaussian function 70%
- used by CatalyzeX 70%
4 day(s) with sentiment data
-
New technique analyzes Q-learning convergence and bias in stochastic approximation
Researchers have developed a new technique for analyzing nonsmooth contractive stochastic approximation (SA) dynamics, particularly relevant to Q-learning. The study establishes weak convergence of iterates to a station…
-
New Gaussian Approximation Bounds for Markov Chains Developed
Researchers have developed new Gaussian approximation bounds for sums of multivariate martingale differences derived from uniformly ergodic Markov chains. These bounds, expressed in higher-order Wasserstein distance, ac…
-
Quantum algorithms promise speedups for sampling and optimization
Researchers have developed new quantum algorithms that offer speedups for sampling from complex probability distributions and for non-convex optimization tasks. These algorithms enhance classical methods like Langevin M…
-
Bayesian Experimental Design: KL Divergence vs. Wasserstein Distance
A new paper published on arXiv explores the use of Bayesian experimental design (BED) for calibrating model discrepancies. The research compares Kullback-Leibler (KL) divergence and Wasserstein distance as utility funct…
-
AI models in pathology gain robustness through new benchmarking and artifact generation techniques
Two new research papers explore methods for improving the reliability and robustness of AI models in computational pathology. The first paper, "Reliable Benchmarking of Artifact Detection in Computational Pathology," pr…
-
Review paper details optimal transport for network comparison in ML
A new review paper explores the application of optimal transport methods for comparing networks, particularly in machine learning contexts. The paper details three primary distances: Wasserstein, Gromov-Wasserstein, and…
-
New Bayesian online learning framework preserves fast regret with approximations
Researchers have developed a new framework for Bayesian online learning that preserves fast predictive regret guarantees even with approximate posterior computations. The study demonstrates that the accuracy of the appr…
-
New Fréchet regression method uses nonparanormal transport for multivariate distributions
Researchers have developed a new regression approach for multivariate distributional responses, which models distributions within the semiparametric nonparanormal family. This method incorporates the nonparanormal trans…
-
New Observable Wasserstein Distance Framework for Non-Euclidean Datasets
Researchers have introduced the observable Wasserstein distance, a novel framework designed to provide lower bounds for the Wasserstein distance between probability measures. This method is particularly useful for large…
-
New theoretical bounds improve Langevin sampling for complex distributions
Researchers have developed new theoretical bounds for the Moreau--Yosida unadjusted Langevin algorithm (MYULA), a method used for sampling from complex probability distributions. The study focuses on nonsmooth composite…
-
New control framework uses sliced optimal transport for distribution steering
Researchers have developed a new control framework for distribution steering, a method that guides the state law of a dynamical system between specified initial and terminal distributions. This framework leverages slice…
-
AI accelerates Large Hadron Collider detector simulations with Normalizing Flows
Researchers have developed a new method using fine-tuned Normalizing Flows (NFs) to speed up the simulation of particle detector responses at the Large Hadron Collider. This approach addresses the computational expense …
-
New clustered alpha-smoothing enhances prediction robustness
Researchers have developed a new framework called clustered alpha-smoothing to improve the robustness of stochastic prediction functions, particularly in safety-critical applications. This method addresses limitations o…
-
New Causal Variational Deep Embedding framework tackles confounded image generation
Researchers have introduced CauVaDE (Causal Variational Deep Embedding), a novel framework designed to address challenges in deep generative models that inherit spurious associations from training data due to unobserved…
-
New Gromov-Wasserstein quantization method extends k-means clustering
A new paper introduces Gromov-Wasserstein (GW) quantization as an extension of traditional k-means clustering. This method not only clusters data points but also considers the ambient geometry of the space, offering new…
-
New research explores robust distribution learning with Wasserstein metrics · 3 sources tracked
Three new research papers explore advanced methods for robust distribution learning and online optimization using Wasserstein metrics. The first paper introduces Wasserstein Filtering (WF) to identify and remove contami…
-
New Bayesian method improves derivative estimation for infinite-dimensional models
A new research paper published on arXiv details advancements in Bayesian derivative estimation for infinite-dimensional exponential families. The study introduces a novel approach using the Wasserstein distance, buildin…
-
Gromov-Wasserstein Quantization Extends K-Means for Geometry-Aware Clustering
This paper introduces Gromov-Wasserstein (GW) quantization as an extension of traditional k-means clustering. Unlike standard Wasserstein quantization which clusters points within a space, GW quantization also considers…
-
Synthetic data boosts AI cowpea detection accuracy
Researchers have developed a method to improve the generalization capabilities of AI models used for detecting cowpea flowers and pods. These models often struggle with accuracy when applied to new environments or genet…
-
New research unifies GNN expressivity and geometry, explores random features
Two new arXiv papers explore the theoretical underpinnings of Graph Neural Networks (GNNs). The first paper introduces a framework using empirical Rademacher complexity to unify GNN expressivity and geometry, offering t…