default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlessandro Barp
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i9]Anthony Baptista, Alessandro Barp, Tapabrata Chakraborti, Chris Harbron, Ben D. MacArthur, Christopher R. S. Banerji:
Deep Learning as Ricci Flow. CoRR abs/2404.14265 (2024)- 2023
- [j1]Carl-Johann Simon-Gabriel, Alessandro Barp, Bernhard Schölkopf, Lester Mackey:
Metrizing Weak Convergence with Maximum Mean Discrepancies. J. Mach. Learn. Res. 24: 184:1-184:20 (2023) - [c6]Zhuo Sun, Alessandro Barp, François-Xavier Briol:
Vector-Valued Control Variates. ICML 2023: 32819-32846 - [i8]Marcelo Hartmann, Bernardo Williams, Hanlin Yu, Mark Girolami, Alessandro Barp, Arto Klami:
Warped geometric information on the optimisation of Euclidean functions. CoRR abs/2308.08305 (2023) - [i7]Andrea Marinoni, Pietro Lio', Alessandro Barp, Christian Jutten, Mark Girolami:
Improving embedding of graphs with missing data by soft manifolds. CoRR abs/2311.17598 (2023) - 2022
- [i6]Alessandro Barp, Lancelot Da Costa, Guilherme França, Karl J. Friston, Mark A. Girolami, Michael I. Jordan, Grigorios A. Pavliotis
:
Geometric Methods for Sampling, Optimisation, Inference and Adaptive Agents. CoRR abs/2203.10592 (2022) - [i5]Alessandro Barp, Carl-Johann Simon-Gabriel, Mark Girolami, Lester Mackey:
Targeted Separation and Convergence with Kernel Discrepancies. CoRR abs/2209.12835 (2022) - 2020
- [c5]Alessandro Barp:
Geometric Integration of Measure-Preserving Flows for Sampling. SPIGL 2020: 345-355 - [i4]Carl-Johann Simon-Gabriel, Alessandro Barp, Lester Mackey:
Metrizing Weak Convergence with Maximum Mean Discrepancies. CoRR abs/2006.09268 (2020)
2010 – 2019
- 2019
- [c4]Alexis Arnaudon, Alessandro Barp, So Takao:
Irreversible Langevin MCMC on Lie Groups. GSI 2019: 171-179 - [c3]Alessandro Barp:
Hamiltonian Monte Carlo on Lie Groups and Constrained Mechanics on Homogeneous Manifolds. GSI 2019: 665-675 - [c2]Wilson Ye Chen, Alessandro Barp, François-Xavier Briol, Jackson Gorham, Mark A. Girolami, Lester W. Mackey, Chris J. Oates:
Stein Point Markov Chain Monte Carlo. ICML 2019: 1011-1021 - [c1]Alessandro Barp, François-Xavier Briol, Andrew B. Duncan, Mark A. Girolami, Lester W. Mackey:
Minimum Stein Discrepancy Estimators. NeurIPS 2019: 12964-12976 - [i3]François-Xavier Briol, Alessandro Barp, Andrew B. Duncan, Mark A. Girolami:
Statistical Inference for Generative Models with Maximum Mean Discrepancy. CoRR abs/1906.05944 (2019) - [i2]Alessandro Barp, François-Xavier Briol, Andrew B. Duncan, Mark A. Girolami, Lester W. Mackey:
Minimum Stein Discrepancy Estimators. CoRR abs/1906.08283 (2019) - 2017
- [i1]Alessandro Barp, François-Xavier Briol, Anthony D. Kennedy, Mark A. Girolami:
Geometry and Dynamics for Markov Chain Monte Carlo. CoRR abs/1705.02891 (2017)
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-09-13 00:37 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:
