Skip to content

Diffusion Autoencoders for Sparse Graph Data Compression

· 0 citations · 41 references

TL;DR

A graph-native generative compression framework that conditions a graph denoising diffusion probabilistic model (DDPM) decoder on latent representations of continuous graph-structured signals and shows that the resulting encoded representations are higher-fidelity and more distributionally aligned than those of vanilla autoencoders.

View source

Similar papers

#machine learning Preprint Sep 2026

On the Diffusibility of High-Dimensional Latents

It is shown that using the standard velocity prediction in flow matching in this high-dimensional space requires the model to fit orthogonal noise directions outside the low-dimensional signal manifold, making optimization inefficient, and motivated using the clean data parameterization ($\boldsymbol{x}_{0}$-prediction...

Chao Feng, Zhi-Yang Xu, Bo-Wei Chen et al. · 0 citations
Book Open access Sep 2026

SSQT: A Hardware-Friendly Fusion Compression Framework of Structured Sparsification and Sensitivity-Driven Quantization for Large-Scale Language Models

The results show that compression and execution layout must be co-designed to convert model-size reduction into practical parallel inference acceleration, and that compression and execution layout must be co-designed to convert model-size reduction into practical parallel inference acceleration.

Qian-Sheng Song, Guo-Lin Tang · 0 citations
Preprint Aug 2026

Columnar-Embedder: A Biologically Inspired Cortical Architecture for Binary Sparse Distributed Graph Representations

Across five graph benchmarks, the performance of SDRs is competitive with that of real-valued dense embeddings on node classification and link prediction, while the architecture exhibits portability, resilience to noise, and robustness to data corruption.

Mohamed Abidalrekab, D. Hammerstrom · 0 citations
Preprint Aug 2026

Exploring Oversmoothing with Householder Matrices

This work proves three core properties of HouseGNN: every internal layer preserves the node-wise Euclidean norm; the Householder reflector is scale scale and sign-invariant in the message; and pairwise distance between nodes can change through mismatch between node-wise orthogonal operators.

Bhaskar Karol · 0 citations
#machine learning Preprint Aug 2026

Enhancing Distance-Based Graph Autoencoders with Structural Penalties for Dynamic Graph Embedding

Experiments show that incorporating NC-LID-based regularization consistently improves reconstruction performance over the baseline without structural regularization and the method using hub-aware regularization, which highlights NC-LID as a useful structural signal for enhancing distance-based graph autoencoders in dyn...

Aleksandar Tomčić, Milos Savic, Milos Radovanovic · 0 citations
Sep 2026

RCGELM-AE: an efficient graph embedding deep model without gradient descent

This study proposes a model called the Residual compensation graph Convolutional Generalized Extreme Learning Machine Autoencoder (RCGELM-AE), which is built on the Extreme Learning Machine Autoencoder (ELM-AE) and incorporates two key designs, and offers a novel, gradient-descent-free solution for achieving efficient...

Xin-Yi Lin, Xiao-Yun Chen, Shu-Lan Zheng et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.