Ingimar Tomasson

dblp:421/0393 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2025
—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
Optimization for machine learning · 50% Deep learning architectures and training · 50%

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

TopicWeightPapersLastEvidence papers
Machine learning › Deep learning architectures and training › neural operator
fourier neural operator
0.912025
Universal Neural Optimal Transport · ICML 2025
Machine learning › Deep learning architectures and training
neural operator
0.912025
Universal Neural Optimal Transport · ICML 2025
Machine learning › Optimization for machine learning › optimal transport
neural optimal transport
0.912025
Universal Neural Optimal Transport · ICML 2025
Machine learning › Optimization for machine learning
optimal transport
0.912025
Universal Neural Optimal Transport · ICML 2025

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

sinkhorn algorithm · 0.9self-supervised bootstrapping · 0.9adversarial training · 0.9
YearPublicationVenuePosition
2025 Universal Neural Optimal Transport
abstract
Optimal Transport (OT) problems are a cornerstone of many applications, but solving them is computationally expensive. To address this problem, we propose UNOT (Universal Neural Optimal Transport), a novel framework capable of accurately predicting (entropic) OT distances and plans between discrete measures of variable resolution for a given cost function. UNOT builds on Fourier Neural Operators, a universal class of neural networks that map between function spaces and that are discretization-invariant, which enables our network to process measures of varying sizes. The network is trained adversarially using a second, generating network and a self-supervised bootstrapping loss. We theoretically justify the use of FNOs, prove that our generator is universal, and that minimizing the bootstrapping loss provably minimizes the ground truth loss. Through extensive experiments, we show that our network not only accurately predicts optimal transport distances and plans across a wide range of datasets, but also captures the geometry of the Wasserstein space correctly. Furthermore, we show that our network can be used as a state-of-the-art initialization for the Sinkhorn algorithm, significantly outperforming existing approaches.
Jonathan Geuter, Gregor Kornhardt, Ingimar Tomasson, Vaios Laschos
ICML3