Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Nemo Fournier

dblp:312/3644 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
2since 2021 · last 2023
0009-0004-7839-4086ORCID · reported

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

Artificial intelligence and machine learning · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author · 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 · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Optimization for machine learning
optimal transport
0.512021
POT: Python Optimal Transport · J. Mach. Learn. Res. 2021
Machine learning › Optimization for machine learning › optimal transport
sinkhorn algorithm
0.512021
POT: Python Optimal Transport · J. Mach. Learn. Res. 2021
Machine learning › Optimization for machine learning › optimal transport
wasserstein barycenter
0.512021
POT: Python Optimal Transport · J. Mach. Learn. Res. 2021

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

linear programming solver · 0.5entropic regularization · 0.5
YearPublicationVenuePosition
2023 A Multimodal Disease Progression Model for Genetic Associations with Disease Dynamics
Nemo Fournier, Stanley Durrleman
MICCAI (5)1
2021 POT: Python Optimal Transport
abstract
Optimal transport has recently been reintroduced to the machine learning community thanks in part to novel efficient optimization procedures allowing for medium to large scale applications. We propose a Python toolbox that implements several key optimal transport ideas for the machine learning community. The toolbox contains implementations of a number of founding works of OT for machine learning such as Sinkhorn algorithm and Wasserstein barycenters, but also provides generic solvers that can be used for conducting novel fundamental research. This toolbox, named POT for Python Optimal Transport, is open source with an MIT license.
Rémi Flamary, Nicolas Courty, Alexandre Gramfort, Mokhtar Z. Alaya, Aurelie Boisbunon, Stanislas Chambon, Laetitia Chapel, Adrien Corenflos, Kilian Fatras, Nemo Fournier, Léo Gautheron, Nathalie T. H. Gayraud, Hicham Janati, Alain Rakotomamonjy, Ievgen Redko, Antoine Rolet, Antony Schutz, Vivien Seguy, Danica J. Sutherland, Romain Tavenard, Alexander Tong 0001, Titouan Vayer
J. Mach. Learn. Res.10