activity
20182021
most citedAdversarial Computation of Optimal Transport Maps

15 citations · 15 across the 3 of their papers we have counts for

collaborators

5 papers

cs.CG2021

Algorithmic Reconstruction of the Fiber of Persistent Homology on Cell Complexes

Jacob Leygonie, Gregory Henselman-Petrusek

Let be a finite simplicial, cubical, delta or CW complex. The persistence map takes a filter as input and returns the barcodes $\math…

cs.CG2021

A Gradient Sampling Algorithm for Stratified Maps with Applications to Topological Data Analysis

Jacob Leygonie, Mathieu Carrière, Théo Lacombe +1

We introduce a novel gradient descent algorithm extending the well-known Gradient Sampling methodology to the class of stratifiably smooth objective functions, which are defined as…

cs.LG201915 cited

Adversarial Computation of Optimal Transport Maps

Jacob Leygonie, Jennifer She, Amjad Almahairi +2

Computing optimal transport maps between high-dimensional and continuous distributions is a challenging problem in optimal transport (OT). Generative adversarial networks (GANs) ar…

physics.gen-ph2018

Combining neural networks and signed particles to simulate quantum systems more efficiently, Part III

Jean Michel Sellier, Gaetan Marceau Caron, Jacob Leygonie

This work belongs to a series of articles which have been dedicated to the combination of signed particles and neural networks to speed up the time-dependent simulation of quantum…

physics.comp-ph2018

Combining neural networks and signed particles to simulate quantum systems more efficiently, Part II

Jean Michel Sellier, Jacob Leygonie, Gaetan Marceau Caron

Recently the use of neural networks has been introduced in the context of the signed particle formulation of quantum mechanics to rapidly and reliably compute the Wigner kernel of…