Pith. sign in

REVIEW 1 cited by

AdaGrid: Adaptive Grid Search for Link Prediction Training Objective

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2203.16162 v2 pith:2KGVLOBN submitted 2022-03-30 cs.LG cs.SI

classification cs.LGcs.SI
keywords trainingobjectiveadagridsearchgridmodeladaptivecomplete
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

One of the most important factors that contribute to the success of a machine learning model is a good training objective. Training objective crucially influences the model's performance and generalization capabilities. This paper specifically focuses on graph neural network training objective for link prediction, which has not been explored in the existing literature. Here, the training objective includes, among others, a negative sampling strategy, and various hyperparameters, such as edge message ratio which controls how training edges are used. Commonly, these hyperparameters are fine-tuned by complete grid search, which is very time-consuming and model-dependent. To mitigate these limitations, we propose Adaptive Grid Search (AdaGrid), which dynamically adjusts the edge message ratio during training. It is model agnostic and highly scalable with a fully customizable computational budget. Through extensive experiments, we show that AdaGrid can boost the performance of the models up to $1.9\%$ while being nine times more time-efficient than a complete search. Overall, AdaGrid represents an effective automated algorithm for designing machine learning training objectives.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Quantum Adaptive Search: A Hybrid Quantum-Classical Algorithm for Global Optimization of Multivariate Functions

    quant-ph 2025-06 reject novelty 3.0 of 10

    A proposed quantum-classical optimizer using amplitude-encoded Boltzmann sampling and adaptive box contraction reports exact minima on benchmarks, but the claimed quantum advantage is not supported by the evidence.

Pith tools