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.

169,051 papers · 148 categories

Trend · papers per month

326496128 · Jun 202019922001200920182026
48 results for Earth Mover's distance

Quantum Earth Mover's distance improves stability and efficiency in quantum learning.

problem Quantum learning's loss landscapes often lead to poor local minima and gradients.
method Introduced the quantum Earth Mover's (EM) distance and proposed a quantum Wasserstein generative adversarial network (qWGAN).
result The quantum EM distance makes quantum learning more stable and efficient.

PMD measures user distances using optimal transportation, improving recommendation accuracy.

problem Sparse data and lack of co-rated items in collaborative filtering.
method PMD is an Earth Mover's Distance-based user distance measure that utilizes all ratings.
result PMD achieves superior recommendation accuracy, especially in sparse data scenarios.

Study shows various pixel p-norm measures do not match human perception of adversarial attacks.

problem Understanding human perception of adversarial attacks on image classification systems.
method Performed a behavioral study comparing different p-norm measures and alternative metrics.
result Human perception of adversarial attacks does not align with pixel p-norm measures and other metrics.

A new method for graph node embeddings by discriminating similarity distributions.

problem Unsupervised learning of node embeddings in graphs.
method Maximizing the earth mover distance between distributions of similarities of similar and dissimilar nodes.
result Generates embeddings with state-of-the-art performance in link prediction.

Method selects optimal source domain for better cross-domain sentiment classification.

problem Improving sentiment classification on unseen domains with limited labeled data.
method Predictive measure based on distance functions between source and target domains.
result Significant improvement in cross-domain classification error compared to random selection.

Direct parallel algorithm for optimal transport with optimal runtime.

problem Computing the Wasserstein distance between two distributions efficiently.
method Primal-dual extragradient method for first-order iterations.
result Solves optimal transport to additive ε with O(1/ε) parallel depth.

This paper presents a unified framework for smooth convex regularization of discrete optimal transport problems. In this context, the regularized optimal transport turns out to be equivalent to a matrix nearness problem with respect to Bregman divergences. Our framework thus naturally generalizes a previously proposed …

2016-10-20abs ↗pdf ↗

This paper speeds up WMD computation for multiple queries efficiently.

problem Efficiently computing the semantic dissimilarity between text documents.
method Adapting the Sinkhorn-Knopp algorithm to compute WMD of one document against many targets in parallel.
result 67x speedup on 96 cores compared to sequential and naive parallel methods.

Estimates population parameters from limited trials per individual.

problem Estimating parameters from Bernoulli trials with limited data per individual.
method Maximum Likelihood Estimation (MLE) for optimally estimating the underlying distribution.
result MLE achieves optimal error bounds of O(1t)\mathcal{O}(\frac{1}{t}) for t<clogNt < c\log{N} and O(1tlogN)\mathcal{O}(\frac{1}{\sqrt{t\log N}}) for larger tt.

Wasserstein Generative Adversarial Networks (WGANs) provide a versatile class of models, which have attracted great attention in various applications. However, this framework has two main drawbacks: (i) Wasserstein-1 (or Earth-Mover) distance is restrictive such that WGANs cannot always fit data geometry well; (ii) It …

2017-05-19abs ↗pdf ↗

This paper analyzes and improves the effectiveness of BN techniques in controlling Internal Covariate Shift.

problem The effectiveness of BN techniques in reducing Internal Covariate Shift (ICS) is limited, especially for high-dimensional outputs and noise.
method The paper introduces a measure for ICS using the Earth Mover (EM) distance, derives bounds for this measure, and proposes a unitization algorithm to further bound ICS.
result The unitization algorithm effectively bounds ICS, especially for low-dimensional outputs and small noise, and can be tuned to control ICS.

Covariance and histogram image descriptors provide an effective way to capture information about images. Both excel when used in combination with special purpose distance metrics. For covariance descriptors these metrics measure the distance along the non-Euclidean Riemannian manifold of symmetric positive definite mat…

2014-12-04abs ↗pdf ↗

WME generates document embeddings from word embeddings, outperforming state-of-the-art techniques.

problem Lack of unsupervised document embeddings from pre-trained word embeddings.
method Word Mover's Embedding (WME) approach.
result WME consistently matches or outperforms state-of-the-art techniques on various text classification and similarity tasks.

Bayesian optimization with Gaussian processes speeds up searches for stationary points.

problem Accelerating searches for stationary points on potential energy surfaces.
method Unified Bayesian optimization view using Gaussian process regression with derivative observations, inverse-distance kernels, and active learning.
result Surrogates can reduce the number of expensive electronic structure evaluations by an order of magnitude.

Defense against Wasserstein adversarial attacks using randomized smoothing.

problem Certified robustness against Wasserstein adversarial attacks.
method Randomized smoothing applied to the space of flows between images, bounding Wasserstein distance by L_1 distance.
result Significantly improved accuracy under Wasserstein adversarial attacks compared to unprotected models.

Federated learning enables resource-constrained edge compute devices, such as mobile phones and IoT devices, to learn a shared model for prediction, while keeping the training data local. This decentralized approach to train models provides privacy, security, regulatory and economic benefits. In this work, we focus on …

2018-06-02abs ↗pdf ↗

This paper generalizes Sinkhorn algorithm for unbalanced optimal transport.

problem Handling distributions with different total mass and robustness to outliers.
method Alternates between standard Sinkhorn updates and pointwise application of a contractive function.
result Defines Sinkhorn divergences that are differentiable, positive, definite, convex, and robust.

Paper develops a new unsupervised scoring function for cross-lingual document alignment.

problem Aligning documents across different languages for NLP tasks.
method Uses cross-lingual sentence embeddings to compute semantic distances and guides document alignment.
result The proposed scoring function outperforms current methods by 7-22% on various language pairs.

Clust-PSI-PFL uses PSI to improve accuracy and fairness in federated learning.

problem Non-IID data biases federated learning performance.
method Clust-PSI-PFL uses clustering and PSI to form homogeneous groups of clients.
result Clust-PSI-PFL delivers up to 18% higher global accuracy and improves client fairness.

New graph kernel scales well with graph size and number, achieving state-of-the-art performance.

problem Graph kernels lose structure information when representing graphs.
method Proposes a positive-definite global alignment graph kernel using random features and random graph embeddings.
result Achieves quasi-linear scalability with respect to graph size and number.

A new method for measuring document similarity using hierarchical optimal transport.

problem Inability to measure semantic similarities and scalability issues in past document similarity measures.
method Model documents as distributions over topics, topics as distributions over words, solve optimal transport problem on topics.
result Hierarchical optimal transport provides better interpretability and scalability with comparable performance.

Earth observation embeddings can convert discrete biome maps into continuous representations that better capture ecological variation.

problem Biome maps impose categorical boundaries that compress continuous variation in biotic communities.
method Fit a linear classifier on Earth observation embeddings to predict biome labels.
result Continuous biome representation outperforms discrete biome labels for predicting species occurrence.

Challenge to separate Earth's magnetic field from vehicle's magnetic field for accurate navigation.

problem Separate Earth's magnetic field from vehicle's magnetic field for accurate magnetic navigation.
method Use machine learning (ML) and integrate physics of magnetic navigation (SciML) to remove aircraft magnetic field from total magnetic field.
result A model can be constructed to effectively remove aircraft magnetic field from the dataset.

The paper applies Gaussianization to analyze Earth data, simplifying complex multivariate distributions.

problem Challenges in accurately estimating information content in high-dimensional, heterogeneous Earth data.
method Multivariate Gaussianization for robust probability density estimation.
result Validates the method for estimating information-theoretic measures in Earth system data.

This study analyzes satellite communication latency using a stochastic geometry model.

problem Latency analysis of LEO satellite relay communication systems.
method Stochastic geometry framework with spherical BPP models, suboptimal satellite relay selection strategy.
result Derives distance distributions and analytical expressions for transmission delays.

A new method estimates time-varying parameters in earth system models using offline and online data assimilation.

problem Estimating time-varying parameters in complex earth system models.
method Hybrid Offline Online Parameter Estimation with Particle Filtering (HOOPE-PF)
result HOOPE-PF outperforms existing methods, especially with small ensemble sizes.

Starfield optimizes satellite links for LEO mega-constellations by aligning ISLs with regional traffic patterns.

problem Forming a stable satellite topology in LEO mega-constellations with limited ISLs and unstable acquisition.
method Starfield uses a demand-aware heuristic algorithm based on traffic flows and Riemannian geometry to assign satellite links.
result Starfield reduces hop count and improves stretch factor by up to 30% compared to existing methods.