On the expressivity and sample complexity of node-individualized graph neural 
networks

Pellizzoni, Paolo; Schulz, Till; Chen, Dexiong; Borgwardt, Karsten M

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Preprint

On the expressivity and sample complexity of node-individualized graph neural networks

MPS-Authors

/persons/resource/persons291271

Pellizzoni, Paolo
Borgwardt, Karsten / Machine Learning and Systems Biology, Max Planck Institute of Biochemistry, Max Planck Society;

Schulz, Till
Borgwardt, Karsten / Machine Learning and Systems Biology, Max Planck Institute of Biochemistry, Max Planck Society;

/persons/resource/persons298953

Chen, Dexiong
Borgwardt, Karsten / Machine Learning and Systems Biology, Max Planck Institute of Biochemistry, Max Planck Society;

/persons/resource/persons75313

Borgwardt, Karsten M
Borgwardt, Karsten / Machine Learning and Systems Biology, Max Planck Institute of Biochemistry, Max Planck Society;

External Resource

https://neurips.cc/virtual/2024/poster/96388
(Any fulltext)

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Pellizzoni, P., Schulz, T., Chen, D., & Borgwardt, K. M. (2024). On the expressivity and sample complexity of node-individualized graph neural networks. Conference on Neural Information Processing Systems (NeurIPS 2024).

Cite as: https://hdl.handle.net/21.11116/0000-000F-EF28-8

Abstract

There is no abstract available