default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThéo Lacombe
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j4]Yasuaki Hiraoka, Yusuke Imoto, Théo Lacombe, Killian Meehan, Toshiaki Yachimura:
Topological Node2vec: Enhanced Graph Embedding via Persistent Homology. J. Mach. Learn. Res. 25: 134:1-134:26 (2024)- [j3]Charles Arnal, Felix Hensel, Mathieu Carrière, Théo Lacombe, Hiroaki Kurihara, Yuichi Ike, Frédéric Chazal:
MAGDiff: Covariate Data Set Shift Detection via Activation Graphs of Neural Networks. Trans. Mach. Learn. Res. 2024 (2024) - [c7]Mathieu Carrière, Marc Theveneau, Théo Lacombe:
Diffeomorphic interpolation for efficient persistence-based topological optimization. NeurIPS 2024 - [i9]Mathieu Carrière, Marc Theveneau, Théo Lacombe:
Diffeomorphic interpolation for efficient persistence-based topological optimization. CoRR abs/2405.18820 (2024) - 2023
- [j2]Jacob Leygonie
, Mathieu Carrière, Théo Lacombe, Steve Oudot:
A gradient sampling algorithm for stratified maps with applications to topological data analysis. Math. Program. 202(1): 199-239 (2023) - [c6]Théo Lacombe:
An Homogeneous Unbalanced Regularized Optimal Transport Model with Applications to Optimal Transport with Boundary. AISTATS 2023: 7311-7330 - [i8]Felix Hensel, Charles Arnal, Mathieu Carrière, Théo Lacombe, Hiroaki Kurihara, Yuichi Ike, Frédéric Chazal:
MAGDiff: Covariate Data Set Shift Detection via Activation Graphs of Deep Neural Networks. CoRR abs/2305.13271 (2023) - [i7]Yasuaki Hiraoka, Yusuke Imoto, Killian Meehan, Théo Lacombe, Toshiaki Yachimura:
Topological Node2vec: Enhanced Graph Embedding via Persistent Homology. CoRR abs/2309.08241 (2023) - 2022
- [c5]Thibault de Surrel, Felix Hensel, Mathieu Carrière, Théo Lacombe, Yuichi Ike, Hiroaki Kurihara, Marc Glisse, Frédéric Chazal:
RipsNet: a general architecture for fast and robust estimation of the persistent homology of point clouds. TAG-ML 2022: 96-106 - [i6]Thibault de Surrel, Felix Hensel, Mathieu Carrière, Théo Lacombe, Yuichi Ike, Hiroaki Kurihara, Marc Glisse, Frédéric Chazal:
RipsNet: a general architecture for fast and robust estimation of the persistent homology of point clouds. CoRR abs/2202.01725 (2022) - 2021
- [j1]Vincent Divol, Théo Lacombe:
Understanding the topology and the geometry of the space of persistence diagrams via optimal partial transport. J. Appl. Comput. Topol. 5(1): 1-53 (2021) - [c4]Vincent Divol, Théo Lacombe:
Estimation and Quantization of Expected Persistence Diagrams. ICML 2021: 2760-2770 - [c3]Théo Lacombe, Yuichi Ike, Mathieu Carrière, Frédéric Chazal, Marc Glisse, Yuhei Umeda:
Topological Uncertainty: Monitoring Trained Neural Networks through Persistence of Activation Graphs. IJCAI 2021: 2666-2672 - [i5]Théo Lacombe, Yuichi Ike, Mathieu Carrière, Frédéric Chazal, Marc Glisse, Yuhei Umeda:
Topological Uncertainty: Monitoring trained neural networks through persistence of activation graphs. CoRR abs/2105.04404 (2021) - [i4]Jacob Leygonie, Mathieu Carrière, Théo Lacombe, Steve Oudot:
A Gradient Sampling Algorithm for Stratified Maps with Applications to Topological Data Analysis. CoRR abs/2109.00530 (2021) - 2020
- [b1]Théo Lacombe:
Statistics for Topological Descriptors using optimal transport. (Statistiques sur les descripteurs topologiques à base de transport optimal). Institut Polytechnique of Paris, France, 2020 - [c2]Mathieu Carrière, Frédéric Chazal, Yuichi Ike, Théo Lacombe, Martin Royer, Yuhei Umeda:
PersLay: A Neural Network Layer for Persistence Diagrams and New Graph Topological Signatures. AISTATS 2020: 2786-2796
2010 – 2019
- 2019
- [i3]Vincent Divol, Théo Lacombe:
Understanding the Topology and the Geometry of the Persistence Diagram Space via Optimal Partial Transport. CoRR abs/1901.03048 (2019) - [i2]Mathieu Carrière, Frédéric Chazal, Yuichi Ike, Théo Lacombe, Martin Royer, Yuhei Umeda:
A General Neural Network Architecture for Persistence Diagrams and Graph Classification. CoRR abs/1904.09378 (2019) - 2018
- [c1]Théo Lacombe, Marco Cuturi, Steve Oudot:
Large Scale computation of Means and Clusters for Persistence Diagrams using Optimal Transport. NeurIPS 2018: 9792-9802 - [i1]Théo Lacombe, Marco Cuturi, Steve Oudot:
Large Scale computation of Means and Clusters for Persistence Diagrams using Optimal Transport. CoRR abs/1805.08331 (2018)
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 2025-02-15 01:23 CET 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:
