conftrace_

Marco Cuturi

69 papers · 2005–2025 · 6 conferences · across top CS/AI conferences

Achievements

Jump to papers ↓
+17 more ↓ ๐Ÿ—บ๏ธ Taxonomy Completionist (19) ๐Ÿงญ Keyword Pioneer ๐ŸŒ‰ Interdisciplinary Bridge ๐ŸŒˆ Renaissance Researcher (5) ๐Ÿฃ Hot Topic Early Bird
๐Ÿฃ Hot Topic Early Bird ๐ŸŒ‰ Interdisciplinary Bridge ๐Ÿงญ Keyword Pioneer ๐ŸŒŸ Keyword Trendsetter Combo (7) ๐Ÿ  Conference Loyalist (23) ๐Ÿ† Keyword Champion (12) ๐Ÿ”ฌ Deep Specialist (12) ๐Ÿค Dynamic Duo (11) ๐Ÿ‘‘ Triple Crown ๐ŸŒฑ Topic Pioneer ๐Ÿงฌ Topic Evolution ๐Ÿš€ Conference Pioneer ๐Ÿ“ˆ Trend Setter ๐Ÿ—ƒ๏ธ Keyword Collector (67) โšก Prolific Year (8) ๐Ÿ’Ž Century Club (69) ๐Ÿ”ฅ Unstoppable (13)

Conferences

ICML (23) NIPS (23) AISTATS (15) ICLR (4) JMLR (3) ACML (1)

Research topics

Papers

Scaling Laws for Forgetting during Finetuning with Pretraining Data Injection ICML 2025 Controlling Language and Diffusion Models by Transporting Activations ICLR 2025 Simple ReFlow: Improved Techniques for Fast Flow Models ICLR 2025 Disentangled Representation Learning with the Gromov-Monge Gap ICLR 2025 Addressing Misspecification in Simulation-based Inference through Data-driven Calibration ICML 2025 Shielded Diffusion: Generating Novel and Diverse Images using Sparse Repellency ICML 2025 Contrasting Multiple Representations with the Multi-Marginal Matching Gap ICML 2024 Progressive Entropic Optimal Transport Solvers NIPS 2024 GENOT: Entropic (Gromov) Wasserstein Flow Matching with Applications to Single-Cell Genomics NIPS 2024 Learning Elastic Costs to Shape Monge Displacements NIPS 2024 On a Neural Implementation of Brenierโ€™s Polar Factorization ICML 2024 Careful with that Scalpel: Improving Gradient Surgery with an EMA ICML 2024 Structured Transforms Across Spaces with Cost-Regularized Optimal Transport AISTATS 2024 A Specialized Semismooth Newton Method for Kernel-Based Optimal Transport AISTATS 2024 The Monge Gap: A Regularizer to Learn All Transport Maps ICML 2023 Monge, Bregman and Occam: Interpretable Optimal Transport in High-Dimensions with Feature-Sparse Maps ICML 2023 Rethinking Initialization of the Sinkhorn Algorithm AISTATS 2023 The Schrรถdinger Bridge between Gaussian Measures has a Closed Form AISTATS 2023 Unbalanced Low-rank Optimal Transport Solvers NIPS 2023 On the Complexity of Approximating Multimarginal Optimal Transport JMLR 2022 Efficient and Modular Implicit Differentiation NIPS 2022 Low-rank Optimal Transport: Approximation, Statistics and Debiasing NIPS 2022 Supervised Training of Conditional Monge Maps NIPS 2022 Randomized Stochastic Gradient Descent Ascent AISTATS 2022 Proximal Optimal Transport Modeling of Population Dynamics AISTATS 2022 Debiaser Beware: Pitfalls of Centering Regularized Transport Maps ICML 2022 Linear-Time Gromov Wasserstein Distances using Low Rank Couplings and Costs ICML 2022 Low-Rank Sinkhorn Factorization ICML 2021 On Projection Robust Optimal Transport: Sample Complexity and Model Misspecification AISTATS 2021 Equitable and Optimal Transport with Multiple Agents AISTATS 2021 Supervised Quantile Normalization for Low Rank Matrix Factorization ICML 2020 Regularized Optimal Transport is Ground Cost Adversarial ICML 2020 Linear Time Sinkhorn Divergences using Positive Features NIPS 2020 Entropic Optimal Transport between Unbalanced Gaussian Measures has a Closed Form NIPS 2020 Learning with Differentiable Pertubed Optimizers NIPS 2020 Projection Robust Wasserstein Distance and Riemannian Optimization NIPS 2020 Regularity as Regularization: Smooth and Strongly Convex Brenier Potentials in Optimal Transport AISTATS 2020 Fixed-Support Wasserstein Barycenters: Computational Hardness and Fast Algorithm NIPS 2020 Precision-Recall Curves Using Information Divergence Frontiers AISTATS 2020 Spatio-temporal alignments: Optimal transport through space and time AISTATS 2020 Missing Data Imputation using Optimal Transport ICML 2020 Debiased Sinkhorn barycenters ICML 2020 Tree-Sliced Variants of Wasserstein Distances NIPS 2019 Unsupervised Hyper-alignment for Multilingual Word Embeddings ICLR 2019 Subspace Detours: Building Transport Plans that are Optimal on Subspace Projections NIPS 2019 Differentiable Ranking and Sorting using Optimal Transport NIPS 2019 Stochastic Deep Networks ICML 2019 Subspace Robust Wasserstein Distances ICML 2019 Sample Complexity of Sinkhorn Divergences AISTATS 2019 Wasserstein regularization for sparse multi-task regression AISTATS 2019 Learning Generative Models with Sinkhorn Divergences AISTATS 2018 Large Scale computation of Means and Clusters for Persistence Diagrams using Optimal Transport NIPS 2018 Generalizing Point Embeddings using the Wasserstein Space of Elliptical Distributions NIPS 2018 Soft-DTW: a Differentiable Loss Function for Time-Series ICML 2017 Sliced Wasserstein Kernel for Persistence Diagrams ICML 2017 Fast Dictionary Learning with a Smoothed Wasserstein Loss AISTATS 2016 Wasserstein Training of Restricted Boltzmann Machines NIPS 2016 Stochastic Optimization for Large-scale Optimal Transport NIPS 2016 Gromov-Wasserstein Averaging of Kernel and Distance Matrices ICML 2016 Unsupervised Riemannian Metric Learning for Histograms Using Aitchison Transformations ICML 2015 Principal Geodesic Analysis for Probability Measures under the Optimal Transport Metric NIPS 2015 Fast Computation of Wasserstein Barycenters ICML 2014 Ground Metric Learning JMLR 2014 Generalized Aitchison Embeddings for Histograms ACML 2013 Sinkhorn Distances: Lightspeed Computation of Optimal Transport NIPS 2013 Mean Reversion with a Variance Threshold ICML 2013 White Functionals for Anomaly Detection in Dynamical Systems NIPS 2009 Kernels on Structured Objects Through Nested Histograms NIPS 2006 Semigroup Kernels on Measures JMLR 2005