default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAude Genevay
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2019
[b1]Aude Genevay:
Entropy-Regularized Optimal Transport for Machine Learning. (Régularisation Entropique du Transport Optimal pour le Machine Learning). PSL Research University, Paris, France, 2019
Conference and Workshop Papers
- 2021
- [c9]Alexander Korotin, Lingxiao Li, Aude Genevay, Justin M. Solomon, Alexander Filippov, Evgeny Burnaev:
Do Neural Optimal Transport Solvers Work? A Continuous Wasserstein-2 Benchmark. NeurIPS 2021: 14593-14605 - [c8]Petr Mokrov, Alexander Korotin, Lingxiao Li, Aude Genevay, Justin M. Solomon, Evgeny Burnaev:
Large-Scale Wasserstein Gradient Flows. NeurIPS 2021: 15243-15256 - [c7]Gaspard Beugnot, Aude Genevay, Kristjan H. Greenewald, Justin Solomon:
Improving approximate optimal transport distances using quantization. UAI 2021: 290-300 - 2020
- [c6]Lingxiao Li, Aude Genevay, Mikhail Yurochkin, Justin M. Solomon:
Continuous Regularized Wasserstein Barycenters. NeurIPS 2020 - 2019
- [c5]Aude Genevay, Lénaïc Chizat, Francis R. Bach, Marco Cuturi, Gabriel Peyré:
Sample Complexity of Sinkhorn Divergences. AISTATS 2019: 1574-1583 - 2018
- [c4]Aude Genevay, Gabriel Peyré, Marco Cuturi:
Learning Generative Models with Sinkhorn Divergences. AISTATS 2018: 1608-1617 - 2016
- [c3]Aude Genevay, Romain Laroche:
Transfer Learning for User Adaptation in Spoken Dialogue Systems. AAMAS 2016: 975-983 - [c2]Romain Laroche, Aude Genevay:
The Negotiation Dialogue Game. IWSDS 2016: 403-410 - [c1]Aude Genevay, Marco Cuturi, Gabriel Peyré, Francis R. Bach:
Stochastic Optimization for Large-scale Optimal Transport. NIPS 2016: 3432-3440
Informal and Other Publications
- 2021
- [i6]Gaspard Beugnot, Aude Genevay, Kristjan H. Greenewald, Justin Solomon:
Improving Approximate Optimal Transport Distances using Quantization. CoRR abs/2102.12731 (2021) - [i5]Petr Mokrov, Alexander Korotin, Lingxiao Li, Aude Genevay, Justin Solomon, Evgeny Burnaev:
Large-Scale Wasserstein Gradient Flows. CoRR abs/2106.00736 (2021) - [i4]Alexander Korotin, Lingxiao Li, Aude Genevay, Justin Solomon, Alexander Filippov, Evgeny Burnaev:
Do Neural Optimal Transport Solvers Work? A Continuous Wasserstein-2 Benchmark. CoRR abs/2106.01954 (2021) - 2020
- [i3]Lingxiao Li, Aude Genevay, Mikhail Yurochkin, Justin Solomon:
Continuous Regularized Wasserstein Barycenters. CoRR abs/2008.12534 (2020) - 2019
- [i2]Aude Genevay, Gabriel Dulac-Arnold, Jean-Philippe Vert:
Differentiable Deep Clustering with Cluster Size Constraints. CoRR abs/1910.09036 (2019) - 2016
- [i1]Aude Genevay, Marco Cuturi, Gabriel Peyré, Francis R. Bach:
Stochastic Optimization for Large-scale Optimal Transport. CoRR abs/1605.08527 (2016)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:14 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
