default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDArthur Gretton
- > Home > Persons > Arthur Gretton
Publications
- 2022
[i64]Pierre Glaser, Michael Arbel, Arnaud Doucet, Arthur Gretton:
Maximum Likelihood Learning of Energy-Based Models for Simulation-Based Inference. CoRR abs/2210.14756 (2022)- 2021
- [c95]Michael Arbel, Liang Zhou, Arthur Gretton:
Generalized Energy Based Models. ICLR 2021 - [c94]Ted Moskovitz, Michael Arbel, Ferenc Huszar, Arthur Gretton:
Efficient Wasserstein Natural Gradients for Reinforcement Learning. ICLR 2021 - [c91]Pierre Glaser, Michael Arbel, Arthur Gretton:
KALE Flow: A Relaxed KL Gradient Flow for Probabilities with Disjoint Support. NeurIPS 2021: 8018-8031 - [i55]Pierre Glaser, Michael Arbel, Arthur Gretton:
KALE Flow: A Relaxed KL Gradient Flow for Probabilities with Disjoint Support. CoRR abs/2106.08929 (2021) - 2020
- [c86]Michael Arbel, Arthur Gretton, Wuchen Li, Guido Montúfar:
Kernelized Wasserstein Natural Gradient. ICLR 2020 - [c82]Anna Korba, Adil Salim, Michael Arbel, Giulia Luise, Arthur Gretton:
A Non-Asymptotic Analysis for Stein Variational Gradient Descent. NeurIPS 2020 - [i50]Michael Arbel, Liang Zhou, Arthur Gretton:
KALE: When Energy-Based Learning Meets Adversarial Training. CoRR abs/2003.05033 (2020) - [i48]Anna Korba, Adil Salim, Michael Arbel, Giulia Luise, Arthur Gretton:
A Non-Asymptotic Analysis for Stein Variational Gradient Descent. CoRR abs/2006.09797 (2020) - [i45]Ted Moskovitz, Michael Arbel, Ferenc Huszar, Arthur Gretton:
Efficient Wasserstein Natural Gradients for Reinforcement Learning. CoRR abs/2010.05380 (2020) - 2019
- [c76]Michael Arbel, Anna Korba, Adil Salim, Arthur Gretton:
Maximum Mean Discrepancy Gradient Flow. NeurIPS 2019: 6481-6491 - [i38]Michael Arbel, Anna Korba, Adil Salim, Arthur Gretton:
Maximum Mean Discrepancy Gradient Flow. CoRR abs/1906.04370 (2019) - [i35]Michael Arbel, Arthur Gretton, Wuchen Li, Guido Montúfar
:
Kernelized Wasserstein Natural Gradient. CoRR abs/1910.09652 (2019) - 2018
- [c74]Danica J. Sutherland, Heiko Strathmann, Michael Arbel, Arthur Gretton:
Efficient and principled score estimation with Nyström kernel exponential families. AISTATS 2018: 652-660 - [c73]Michael Arbel, Arthur Gretton:
Kernel Conditional Exponential Family. AISTATS 2018: 1337-1346 - [c72]Mikolaj Binkowski, Danica J. Sutherland, Michael Arbel, Arthur Gretton:
Demystifying MMD GANs. ICLR (Poster) 2018 - [c70]Michael Arbel, Danica J. Sutherland, Mikolaj Binkowski, Arthur Gretton:
On gradient regularizers for MMD GANs. NeurIPS 2018: 6701-6711 - [i34]Mikolaj Binkowski, Danica J. Sutherland, Michael Arbel, Arthur Gretton:
Demystifying MMD GANs. CoRR abs/1801.01401 (2018) - [i33]Michael Arbel, Danica J. Sutherland, Mikolaj Binkowski, Arthur Gretton:
On gradient regularizers for MMD GANs. CoRR abs/1805.11565 (2018) - 2017
- [i27]Danica J. Sutherland, Heiko Strathmann, Michael Arbel, Arthur Gretton:
Efficient and principled score estimation. CoRR abs/1705.08360 (2017)
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-09-18 01:12 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:
