activity
20112026
most citedOptimal Transport for structured data with application on graphs

136 citations · 329 across the 14 of their papers we have counts for

collaborators

16 papers

stat.ML2026

Fast Gradient-Based Approximation of Continuous Dynamic Time Warping

Pierre Houedry, Romain Tavenard, Nicolas Courty +1

Dynamic Time Warping (DTW) is a common choice for measuring the discrepancy between time series. It proceeds by finding an optimal warping between timestamps through dynamic progra…

cs.CV2026★ 11 cited

Online Handwriting Trajectory Reconstruction from Kinematic Sensors using Temporal Convolutional Network

Wassim Swaileh, Florent Imbert, Yann Soullard +2

Handwriting with digital pens is a common way to facilitate human-computer interaction through the use of Online Handwriting (OH) trajectory reconstruction. In this work, we focus…

cs.CV2026

Layer by layer, module by module: Choose both for optimal OOD probing of ViT

Ambroise Odonnat, Vasilii Feofanov, Laetitia Chapel +2

Recent studies have observed that intermediate layers of foundation models often yield more discriminative representations than the final layer. While initially attributed to autor…

cs.LG2026

Vision Transformer Finetuning Benefits from Non-Smooth Components

Ambroise Odonnat, Laetitia Chapel, Romain Tavenard +1

The smoothness of the transformer architecture has been extensively studied in the context of generalization, training stability, and adversarial robustness. However, its role in t…

cs.LG2025

Differentiable Generalized Sliced Wasserstein Plans

Laetitia Chapel, Romain Tavenard, Samuel Vaiter

Optimal Transport (OT) has attracted significant interest in the machine learning community, not only for its ability to define meaningful distances between probability distributio…

cs.LG2023

Match-And-Deform: Time Series Domain Adaptation through Optimal Transport and Temporal Alignment

François Painblanc, Laetitia Chapel, Nicolas Courty +3

While large volumes of unlabeled data are usually available, associated labels are often scarce. The unsupervised domain adaptation problem aims at exploiting labels from a source…