A Metric for the Balance of Information in Graph Learning

Research output: Contribution to conferenceConference Paperpeer-review

114 Downloads (Pure)

Abstract

Graph learning on molecules makes use of information from both the molecular structure and the features attached to that structure. Much work has been conducted on biasing either towards structure or features, with the aim that bias bolsters performance. Identifying which information source a dataset favours, and therefore how to approach learning that dataset, is an open issue. Here we propose Noise-Noise Ratio Difference (NNRD), a quantitative metric for whether there is more useful information in structure or features. By employing iterative noising on features and structure independently, leaving the other intact, NNRD measures the degradation of information in each. We employ NNRD over a range of molecular tasks, and show that it corresponds well to a loss of information, with intuitive results that are more expressive than simple performance aggregates. Our future work will focus on expanding data domains, tasks and types, as well as refining our choice of baseline model.
Original languageEnglish
Pages1-5
Number of pages5
Publication statusPublished - 3 Mar 2025
Event4th Annual AAAI Workshop on AI to Accelerate Science and Engineering - Pennsylvania Convention Center, Philadelphia, United States
Duration: 3 Mar 20253 Mar 2025
https://ai-2-ase.github.io/

Conference

Conference4th Annual AAAI Workshop on AI to Accelerate Science and Engineering
Abbreviated titleAI2ASE
Country/TerritoryUnited States
CityPhiladelphia
Period3/03/253/03/25
Internet address

Research Groups and Themes

  • Intelligent Systems Laboratory

Fingerprint

Dive into the research topics of 'A Metric for the Balance of Information in Graph Learning'. Together they form a unique fingerprint.

Cite this