default search action
Thomas Laurent 0001
Person information
- affiliation: Loyola Marymount University, Department of Mathematics, Los Angeles, CA, USA
- affiliation (former): University of California, Riverside, Department of Mathematics, CA, USA
- affiliation (PhD 2006): Duke University, Department of Mathematics, Durham, NC, USA
Other persons with the same name
- Thomas Laurent 0002
— European Molecular Biology Laboratory, European Bioinformatics Institute
- Thomas Laurent 0003
- Thomas Laurent 0004 — FCS Railenium, Famars, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c15]Thomas Laurent, James von Brecht, Xavier Bresson:
Feature Collapse. ICLR 2024 - [c14]Xiaoxin He, Xavier Bresson, Thomas Laurent, Adam Perold, Yann LeCun, Bryan Hooi:
Harnessing Explanations: LLM-to-LM Interpreter for Enhanced Text-Attributed Graph Representation Learning. ICLR 2024 - [i25]Xiaoxin He, Yijun Tian, Yifei Sun, Nitesh V. Chawla, Thomas Laurent, Yann LeCun, Xavier Bresson, Bryan Hooi:
G-Retriever: Retrieval-Augmented Generation for Textual Graph Understanding and Question Answering. CoRR abs/2402.07630 (2024) - [i24]Nian Liu, Xiaoxin He, Thomas Laurent, Francesco Di Giovanni, Michael M. Bronstein, Xavier Bresson:
Advancing Graph Convolutional Networks via General Spectral Wavelets. CoRR abs/2405.13806 (2024) - 2023
- [j7]Vijay Prakash Dwivedi, Chaitanya K. Joshi, Anh Tuan Luu, Thomas Laurent, Yoshua Bengio, Xavier Bresson:
Benchmarking Graph Neural Networks. J. Mach. Learn. Res. 24: 43:1-43:48 (2023) - [c13]Thomas Laurent, James von Brecht, Xavier Bresson:
Long-Tailed Learning Requires Feature Learning. ICLR 2023 - [c12]Xiaoxin He, Bryan Hooi, Thomas Laurent, Adam Perold, Yann LeCun, Xavier Bresson:
A Generalization of ViT/MLP-Mixer to Graphs. ICML 2023: 12724-12745 - [c11]Lovro Vrcek, Xavier Bresson, Thomas Laurent, Martin Schmitz, Mile Sikic:
Reconstruction of short genomic sequences with graph convolutional networks. MIPRO 2023: 403-409 - [i23]Thomas Laurent, James H. von Brecht, Xavier Bresson:
Feature Collapse. CoRR abs/2305.16162 (2023) - [i22]Xiaoxin He, Xavier Bresson, Thomas Laurent, Bryan Hooi:
Explanations as Features: LLM-Based Features for Text-Attributed Graphs. CoRR abs/2305.19523 (2023) - 2022
- [j6]Chaitanya K. Joshi
Learning the travelling salesperson problem requires rethinking generalization. Constraints An Int. J. 27(1-2): 70-98 (2022) - [c10]Vijay Prakash Dwivedi, Anh Tuan Luu, Thomas Laurent, Yoshua Bengio, Xavier Bresson:
Graph Neural Networks with Learnable Structural and Positional Representations. ICLR 2022 - [i21]Yong Liang Goh, Wee Sun Lee, Xavier Bresson, Thomas Laurent, Nicholas Lim:
Combining Reinforcement Learning and Optimal Transport for the Traveling Salesman Problem. CoRR abs/2203.00903 (2022) - [i20]Thomas Laurent, James H. von Brecht, Xavier Bresson:
A Model of One-Shot Generalization. CoRR abs/2205.14553 (2022) - [i19]Lovro Vrcek, Xavier Bresson, Thomas Laurent, Martin Schmitz, Mile Sikic:
Learning to Untangle Genome Assembly with Graph Convolutional Networks. CoRR abs/2206.00668 (2022) - [i18]Xiaoxin He, Bryan Hooi, Thomas Laurent, Adam Perold, Yann LeCun, Xavier Bresson:
A Generalization of ViT/MLP-Mixer to Graphs. CoRR abs/2212.13350 (2022) - 2021
- [c9]Chaitanya K. Joshi
Learning TSP Requires Rethinking Generalization. CP 2021: 33:1-33:21 - [i17]Xavier Bresson, Thomas Laurent:
The Transformer Network for the Traveling Salesman Problem. CoRR abs/2103.03012 (2021) - [i16]Vijay Prakash Dwivedi, Anh Tuan Luu, Thomas Laurent, Yoshua Bengio, Xavier Bresson:
Graph Neural Networks with Learnable Structural and Positional Representations. CoRR abs/2110.07875 (2021) - 2020
- [i15]Vijay Prakash Dwivedi, Chaitanya K. Joshi
Benchmarking Graph Neural Networks. CoRR abs/2003.00982 (2020) - [i14]Chaitanya K. Joshi
Learning TSP Requires Rethinking Generalization. CoRR abs/2006.07054 (2020)
2010 – 2019
- 2019
- [i13]Yao Yang Leow, Thomas Laurent, Xavier Bresson:
GraphTSNE: A Visualization Technique for Graph-Structured Data. CoRR abs/1904.06915 (2019) - [i12]Chaitanya K. Joshi
An Efficient Graph Convolutional Network Technique for the Travelling Salesman Problem. CoRR abs/1906.01227 (2019) - [i11]Xavier Bresson, Thomas Laurent:
A Two-Step Graph Convolutional Decoder for Molecule Generation. CoRR abs/1906.03412 (2019) - [i10]Chaitanya K. Joshi
On Learning Paradigms for the Travelling Salesman Problem. CoRR abs/1910.07210 (2019) - 2018
- [c8]Xavier Bresson, Thomas Laurent:
An Experimental Study of Neural Networks for Variable Graphs. ICLR (Workshop) 2018 - [c7]Thomas Laurent, James von Brecht:
Deep Linear Networks with Arbitrary Loss: All Local Minima Are Global. ICML 2018: 2908-2913 - [c6]Thomas Laurent, James von Brecht:
The Multilinear Structure of ReLU Networks. ICML 2018: 2914-2922 - 2017
- [c5]Thomas Laurent, James von Brecht:
A recurrent neural network without chaos. ICLR (Poster) 2017 - [i9]Xavier Bresson, Thomas Laurent:
Residual Gated Graph ConvNets. CoRR abs/1711.07553 (2017) - [i8]Thomas Laurent, James von Brecht:
Deep linear neural networks with arbitrary loss: All local minima are global. CoRR abs/1712.01473 (2017) - [i7]Thomas Laurent, James von Brecht:
The Multilinear Structure of ReLU Networks. CoRR abs/1712.10132 (2017) - 2016
- [j5]Nicolás García Trillos, Dejan Slepcev, James H. von Brecht, Thomas Laurent, Xavier Bresson:
Consistency of Cheeger and Ratio Graph Cuts. J. Mach. Learn. Res. 17: 181:1-181:46 (2016) - [j4]Andrea L. Bertozzi
The Regularity of the Boundary of a Multidimensional Aggregation Patch. SIAM J. Math. Anal. 48(6): 3789-3819 (2016) - [c4]Thomas Laurent, James H. von Brecht, Xavier Bresson, Arthur Szlam:
The Product Cut. NIPS 2016: 3792-3800 - [i6]Thomas Laurent, James H. von Brecht:
A recurrent neural network without chaos. CoRR abs/1612.06212 (2016) - 2015
- [c3]Xavier Bresson, Thomas Laurent, James H. von Brecht:
Enhanced lasso recovery on graph. EUSIPCO 2015: 1501-1505 - [i5]Xavier Bresson, Thomas Laurent, James H. von Brecht:
Enhanced Lasso Recovery on Graph. CoRR abs/1506.05985 (2015) - 2014
- [i4]Xavier Bresson, Huiyi Hu, Thomas Laurent, Arthur Szlam, James H. von Brecht:
An Incremental Reseeding Strategy for Clustering. CoRR abs/1406.3837 (2014) - [i3]Nicolás García Trillos, Dejan Slepcev, James H. von Brecht, Thomas Laurent, Xavier Bresson:
Consistency of Cheeger and Ratio Graph Cuts. CoRR abs/1411.6590 (2014) - 2013
- [j3]Huiyi Hu, Thomas Laurent, Mason A. Porter, Andrea L. Bertozzi
A Method Based on Total Variation for Network Modularity Optimization Using the MBO Scheme. SIAM J. Appl. Math. 73(6): 2224-2246 (2013) - [c2]Xavier Bresson, Thomas Laurent, David Uminsky, James H. von Brecht:
Multiclass Total Variation Clustering. NIPS 2013: 1421-1429 - [i2]Huiyi Hu, Thomas Laurent, Mason A. Porter, Andrea L. Bertozzi:
A Method Based on Total Variation for Network Modularity Optimization using the MBO Scheme. CoRR abs/1304.4679 (2013) - [i1]Xavier Bresson, Thomas Laurent, David Uminsky, James H. von Brecht:
Multiclass Total Variation Clustering. CoRR abs/1306.1185 (2013) - 2012
- [j2]Andrea L. Bertozzi
Characterization of Radially Symmetric Finite Time Blowup in Multidimensional Aggregation Equations. SIAM J. Math. Anal. 44(2): 651-681 (2012) - [c1]Xavier Bresson, Thomas Laurent, David Uminsky, James H. von Brecht:
Convergence and Energy Landscape for Cheeger Cut Clustering. NIPS 2012: 1394-1402
2000 – 2009
- 2006
- [j1]Thomas Laurent, Brian Rider, Michael Reed:
Parabolic Behavior of a Hyperbolic Delay Equation. SIAM J. Math. Anal. 38(1): 1-15 (2006)
Coauthor Index
aka: James von Brecht
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-10-21 20:27 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: