atlas

Research map / Graph learning / Knowledge and temporal graphs

Lossless Compression of Structured Convolutional Models via Lifting

ICLR 2021 · Graph learning › Knowledge and temporal graphs · approach: Heterogeneous graph learning · 3 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Apply lifting-based computation-graph compressionStructured convolutional models · Molecule classificationtraining and inference time: app. 3xHelped
Apply scalar-parameterized lifting compressionGraphlets model · Molecule classificationtraining time: 10xHelped
Use lossless lifting compressionStructured convolutional models · Molecule classification and knowledge-base completiontraining and testing accuracyNo clear effect
Apply lifting-based compression to GINGIN · Molecule classificationtraining time: app. 2xHelped
Reduce numeric precision used for equivalence checks (ablation)Non-exact lifting compression · Molecule classificationlearning performanceHurt
Use tensor rather than scalar parameterization for equivalence checks (ablation)Lifting compression · Molecule classification and Kinshipscompression precision: first 4 digitsHelped

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy