Skip to yearly menu bar Skip to main content


Lossless Compression of Structured Convolutional Models via Lifting

Gustav Sourek · Filip Zelezny · Ondrej Kuzelka


Keywords: [ convolutional models ] [ dynamic computation graphs ] [ lifted inference ] [ relational learning ] [ weight sharing ] [ graph neural networks ]


Lifting is an efficient technique to scale up graphical models generalized to relational domains by exploiting the underlying symmetries. Concurrently, neural models are continuously expanding from grid-like tensor data into structured representations, such as various attributed graphs and relational databases. To address the irregular structure of the data, the models typically extrapolate on the idea of convolution, effectively introducing parameter sharing in their, dynamically unfolded, computation graphs. The computation graphs themselves then reflect the symmetries of the underlying data, similarly to the lifted graphical models. Inspired by lifting, we introduce a simple and efficient technique to detect the symmetries and compress the neural models without loss of any information. We demonstrate through experiments that such compression can lead to significant speedups of structured convolutional models, such as various Graph Neural Networks, across various tasks, such as molecule classification and knowledge-base completion.

Chat is not available.