Lossless Compression of Structured Convolutional Models via Lifting
Not on the map. Why?
Abstract (arXiv)
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.
Key facts. Cited by 11 papers in the map (data through 7 Oct 2026). First posted on arXiv 13 Jul 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 3; 2022: 4; 2023: 1; 2024: 0; 2025: 2; 2026: 1.
11 papers.
- 2022The Combinatorial Brain Surgeon: Pruning Weights That Cancel One Another in Neural Networkscited by 41
- 2025Symmetry in Neural Network Parameter Spacescited by 31
- 2021Scaling Up Exact Neural Network Compression by ReLU Stabilitycited by 19
- 2022Recall Distortion in Neural Network Pruning and the Undecayed Pruning Algorithmcited by 9
- 2023Getting Away with More Network Pruning: From Sparsity to Geometry and Linear Regionscited by 8
- 2021Universal approximation and model compression for radial neural networkscited by 7
- 2022Quiver neural networkscited by 4
- 2021The Minimum Edit Arborescence Problem and Its Use in Compressing Graph Collections [Extended Version]cited by 0
- 2022Towards Global Neural Network Abstractions with Locally-Exact Reconstructioncited by 0
- 2025Optimization over Trained (and Sparse) Neural Networks: A Surrogate within a Surrogatecited by 0
- 2026Discovering Symmetries in Neural Network Parameter Spacescited by 0
- 2026Discovering Symmetries in Neural Network Parameter Spaces27 Sep 2026
- 2025Symmetry in Neural Network Parameter Spaces16 Jun 2025
- 2025Optimization over Trained (and Sparse) Neural Networks: A Surrogate within a Surrogate4 May 2025
- 2023Getting Away with More Network Pruning: From Sparsity to Geometry and Linear Regions19 Jan 2023
- 2022Towards Global Neural Network Abstractions with Locally-Exact Reconstruction21 Oct 2022
- 2022Quiver neural networks26 Jul 2022
- 2022Recall Distortion in Neural Network Pruning and the Undecayed Pruning Algorithm7 Jun 2022
- 2022The Combinatorial Brain Surgeon: Pruning Weights That Cancel One Another in Neural Networks9 Mar 2022
- 2021The Minimum Edit Arborescence Problem and Its Use in Compressing Graph Collections [Extended Version]30 Jul 2021
- 2021Universal approximation and model compression for radial neural networks6 Jul 2021
- 2021Scaling Up Exact Neural Network Compression by ReLU Stability15 Feb 2021