<?xml version="1.0"?>
<metadata xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:dc="http://purl.org/dc/elements/1.1/"><dc:title>Adaptive graph neural network training objective for link prediction</dc:title><dc:creator>POŠTUVAN,	TIM	(Avtor)
	</dc:creator><dc:creator>Šubelj,	Lovro	(Mentor)
	</dc:creator><dc:subject>machine learning</dc:subject><dc:subject>meta-learning</dc:subject><dc:subject>link prediction</dc:subject><dc:subject>graph neural networks</dc:subject><dc:subject>training objective</dc:subject><dc:description>One of the most important factors which contributes to success of a machine learning model is good training objective. Training objective crucially influences model’s performance and generalization capabilities. We focus on graph neural network training objective for link prediction, because it is barely explored in literature. In this case, training objective includes, among others, training mode, negative sampling strategy, and various hyperparameters, such as edge message ratio. Commonly, these hyperparameters are fine-tuned by complete search, which is very time consuming and model dependent. To mitigate these limitations, we propose Adaptive Grid Search (AdaGrid), which dynamically adjusts edge message ratio during training. It is model agnostic and highly scalable with fully customizable computational budget. AdaGrid can also boosts performance of the models up to 2.3%, while can be nine times more efficient than complete search.</dc:description><dc:date>2021</dc:date><dc:date>2021-08-17 13:10:00</dc:date><dc:type>Diplomsko delo/naloga</dc:type><dc:identifier>128919</dc:identifier><dc:identifier>VisID: 32301</dc:identifier><dc:identifier>COBISS_ID: 75109379</dc:identifier><dc:language>sl</dc:language></metadata>
