Image de couverture de livre

Recovering Wasserstein Distance Matrices from Few Measurements

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Rana, Muhammad, Tasissa, Abiy, Cai, HanQin, Gavriyelov, Yakov, Hamm, Keaton
Format:	Preprint
Publié:	2025
Sujets:	Machine Learning
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Riemannian Optimization for Non-convex Euclidean Distance Geometry with Global Recovery Guarantees
par: Smith, Chandler, et autres
Publié: (2024)

Structured Sampling for Robust Euclidean Distance Geometry
par: Kundu, Chandra, et autres
Publié: (2024)

A Dual Basis Approach for Structured Robust Euclidean Distance Geometry
par: Kundu, Chandra, et autres
Publié: (2025)

Provable Non-Convex Euclidean Distance Matrix Completion: Geometry, Reconstruction, and Robustness
par: Smith, Chandler, et autres
Publié: (2025)

Neighbor Embeddings Using Unbalanced Optimal Transport Metrics
par: Rana, Muhammad, et autres
Publié: (2025)

Sample-Efficient Geometry Reconstruction from Euclidean Distances using Non-Convex Optimization
par: Ghosh, Ipsita, et autres
Publié: (2024)

On Wasserstein distances for affine transformations of random vectors
par: Hamm, Keaton, et autres
Publié: (2023)

Wasserstein approximation schemes based on Voronoi partitions
par: Hamm, Keaton, et autres
Publié: (2023)

RACH-Space: Reconstructing Adaptive Convex Hull Space with Applications in Weak Supervision
par: Na, Woojoo, et autres
Publié: (2023)

Localization from structured distance matrices via low-rank matrix recovery
par: Lichtenberg, Samuel, et autres
Publié: (2023)

A dual basis approach to multidimensional scaling
par: Lichtenberg, Samuel, et autres
Publié: (2023)

Shift-Invariant Feature Attribution in the Application of Wireless Electrocardiograms
par: Getnet, Yalemzerf, et autres
Publié: (2026)

Clustering Inductive Biases with Unrolled Networks
par: Huml, Jonathan, et autres
Publié: (2023)

Alternating minimization algorithm with initialization analysis for r-local and k-sparse unlabeled sensing
par: Abbasi, Ahmed, et autres
Publié: (2022)

Weighed l1 on the simplex: Compressive sensing meets locality
par: Tasissa, Abiy, et autres
Publié: (2021)

Locality Regularized Reconstruction: Structured Sparsity and Delaunay Triangulations
par: Mueller, Marshall, et autres
Publié: (2024)

Property Inheritance for Subtensors in Tensor Train Decompositions
par: Cai, HanQin, et autres
Publié: (2025)

Manifold learning in Wasserstein space
par: Hamm, Keaton, et autres
Publié: (2023)

Discriminative reconstruction via simultaneous dense and sparse coding
par: Tasissa, Abiy, et autres
Publié: (2020)

Guarantees of a Preconditioned Subgradient Algorithm for Overparameterized Asymmetric Low-rank Matrix Recovery
par: Giampouras, Paris, et autres
Publié: (2024)

K-Deep Simplex: Deep Manifold Learning via Local Dictionaries
par: Tankala, Pranay, et autres
Publié: (2020)

Memory Efficient Full-gradient Attacks (MEFA) Framework for Adversarial Defense Evaluations
par: Du, Yuan, et autres
Publié: (2026)

Matrix Completion with Cross-Concentrated Sampling: Bridging Uniform Sampling and CUR Sampling
par: Cai, HanQin, et autres
Publié: (2022)

TailedTS: Benchmark Dataset for Heavy-Tailed Time Series Prediction and Periodicity Quantification
par: Chen, Xinyu, et autres
Publié: (2026)

Correlating Time Series with Interpretable Convolutional Kernels
par: Chen, Xinyu, et autres
Publié: (2024)

Guaranteed Sampling Flexibility for Low-tubal-rank Tensor Completion
par: Su, Bowen, et autres
Publié: (2024)

On the Robustness of Cross-Concentrated Sampling for Matrix Completion
par: Cai, HanQin, et autres
Publié: (2024)

Laplacian Convolutional Representation for Traffic Time Series Imputation
par: Chen, Xinyu, et autres
Publié: (2022)

Robust Node Localization for Rough and Extreme Deployment Environments
par: Tasissa, Abiy, et autres
Publié: (2025)

Fast Estimation of Wasserstein Distances via Regression on Sliced Wasserstein Distances
par: Nguyen, Khai, et autres
Publié: (2025)

Measuring Time-Series Dataset Similarity using Wasserstein Distance
par: Chen, Hongjie, et autres
Publié: (2025)

LOTFormer: Doubly-Stochastic Linear Attention via Low-Rank Optimal Transport
par: Shahbazi, Ashkan, et autres
Publié: (2025)

Distance-Matrix Wasserstein Statistics for Scalable Gromov--Wasserstein Learning
par: Xu, Ao, et autres
Publié: (2026)

Explainable Adversarial Attacks on Coarse-to-Fine Classifiers
par: Heidarizadeh, Akram, et autres
Publié: (2025)

Private Wasserstein Distance
par: Li, Wenqian, et autres
Publié: (2024)

The Observable Wasserstein Distance
par: Santos, Edivaldo Lopes dos, et autres
Publié: (2026)

Constrained Gaussian Wasserstein Optimal Transport with Commutative Covariance Matrices
par: Chen, Jun, et autres
Publié: (2025)

An Empirical Study of Self-supervised Learning with Wasserstein Distance
par: Yamada, Makoto, et autres
Publié: (2023)

Persistent Classification: A New Approach to Stability of Data and Adversarial Examples
par: Bell, Brian, et autres
Publié: (2024)

Feature Selection Based on Wasserstein Distance
par: Li, Fuwei
Publié: (2024)