no code implementations • 7 Jun 2020 • Paris D. L. Flood, Ramon Viñas, Pietro Liò
We investigate a flexible means of regularization for link prediction based on an approximation of the Kolmogorov complexity of graphs that is differentiable and compatible with recent advances in link prediction algorithms.