Tal Nawy

dblp:375/1671 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2024
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Deep learning architectures and training · 100%
Databases, data mining, and information retrieval
1 paper
Machine learning and data management · 100%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Bioinformatics and computational biology · 100%
Theoretical computer science
1 paper
Algorithms and data structures · 50% Computational geometry · 50%

Topics — the 7 heaviest of 7, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Deep learning architectures and training
autoencoder
0.812024
Wasserstein Wormhole: Scalable Optimal Transport Distance with Transformer · ICML 2024
Machine learning › Deep learning architectures and training › autoencoder
transformer autoencoder
0.812024
Wasserstein Wormhole: Scalable Optimal Transport Distance with Transformer · ICML 2024
Machine learning and data management
optimal transport
0.812024
Wasserstein Wormhole: Scalable Optimal Transport Distance with Transformer · ICML 2024
Bioinformatics and computational biology
single-cell analysis
0.212024
Wasserstein Wormhole: Scalable Optimal Transport Distance with Transformer · ICML 2024
Bioinformatics and computational biology
single-cell biology
0.212024
Wasserstein Wormhole: Scalable Optimal Transport Distance with Transformer · ICML 2024
Computational geometry › graph drawing › geometric embedding
distance-preserving embedding
0.212024
Wasserstein Wormhole: Scalable Optimal Transport Distance with Transformer · ICML 2024
Algorithms and data structures › numerical linear algebra › dimensionality reduction
multidimensional scaling
0.212024
Wasserstein Wormhole: Scalable Optimal Transport Distance with Transformer · ICML 2024

Methods — techniques the papers use, named apart from their topics

transformer · 3.0optimal transport · 3.0multidimensional scaling · 3.0
YearPublicationVenuePosition
2024 Wasserstein Wormhole: Scalable Optimal Transport Distance with Transformer
abstract
Optimal transport (OT) and the related Wasserstein metric ($W$) are powerful and ubiquitous tools for comparing distributions. However, computing pairwise Wasserstein distances rapidly becomes intractable as cohort size grows. An attractive alternative would be to find an embedding space in which pairwise Euclidean distances map to OT distances, akin to standard multidimensional scaling (MDS). We present Wasserstein Wormhole, a transformer-based autoencoder that embeds empirical distributions into a latent space wherein Euclidean distances approximate OT distances. Extending MDS theory, we show that our objective function implies a bound on the error incurred when embedding non-Euclidean distances. Empirically, distances between Wormhole embeddings closely match Wasserstein distances, enabling linear time computation of OT distances. Along with an encoder that maps distributions to embeddings, Wasserstein Wormhole includes a decoder that maps embeddings back to distributions, allowing for operations in the embedding space to generalize to OT spaces, such as Wasserstein barycenter estimation and OT interpolation. By lending scalability and interpretability to OT approaches, Wasserstein Wormhole unlocks new avenues for data analysis in the fields of computational geometry and single-cell biology.
Doron Haviv, Russell Z. Kunes, Thomas Dougherty, Cassandra Burdziak, Tal Nawy, Anna Gilbert 0001, Dana Pe'er
ICML5