MétaCan
Menu
Back to cohort
Record W4382317638 · doi:10.1609/aaai.v37i13.26993

Flaky Performances When Pretraining on Relational Databases (Student Abstract)

2023· article· en· W4382317638 on OpenAlexaff
Shengchao Liu, David Vázquez, Jian Tang, Pierre‐André Noël

Bibliographic record

VenueProceedings of the AAAI Conference on Artificial Intelligence · 2023
Typearticle
Languageen
FieldComputer Science
TopicAdvanced Graph Neural Networks
Canadian institutionsCanadian Institute for Advanced ResearchHEC MontréalUniversité de MontréalMila - Quebec Artificial Intelligence Institute
Fundersnot available
KeywordsComputer sciencePortingLeverage (statistics)Relational databaseNode (physics)ConjectureGraphArtificial intelligenceNatural language processingTheoretical computer scienceData miningProgramming languageMathematics

Abstract

fetched live from OpenAlex

We explore the downstream task performances for graph neural network (GNN) self-supervised learning (SSL) methods trained on subgraphs extracted from relational databases (RDBs). Intuitively, this joint use of SSL and GNNs should allow to leverage more of the available data, which could translate to better results. However, we found that naively porting contrastive SSL techniques can cause ``negative transfer'': linear evaluation on fixed representation from a pretrained model performs worse than on representations from the randomly-initialized model. Based on the conjecture that contrastive SSL conflicts with the message passing layers of the GNN, we propose InfoNode: a contrastive loss aiming to maximize the mutual information between a node's initial- and final-layer representation. The primary empirical results support our conjecture and the effectiveness of InfoNode.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.004
metaresearch head score (Gemma)0.015
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.010
Threshold uncertainty score0.021

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0040.015
Meta-epidemiology (narrow)0.0020.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.001
Science and technology studies0.0010.001
Scholarly communication0.0010.004
Open science0.0020.002
Research integrity0.0020.002
Insufficient payload (model declined to judge)0.0050.002

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.169
GPT teacher head0.341
Teacher spread0.171 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreEmpirical

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations0
Published2023
Admission routes1
Has abstractyes

Explore more

Same venueProceedings of the AAAI Conference on Artificial IntelligenceSame topicAdvanced Graph Neural NetworksFrench-language works237,207