atlas

Research map / Graph learning / Graph algorithms and clustering

Unveiling the sampling density in non-uniform geometric graphs

ICLR 2023 · Graph learning › Graph algorithms and clustering · approach: Graph distance and retrieval · 0 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
Use a distance+hubs decoder instead of inner-product or MLP decodersGraph autoencoder · Real-world link prediction datasetsAUCHelped
Use a distance+hubs decoder instead of a constant-radius distance decoderGraph autoencoder · Real-world link prediction datasetsAUCHelped
Learn sampling density and use it to correct the GSOSpectral graph neural network · Real-world node classification graphsaccuracyHelped
Use degree-normalized GSOs while ignoring sampling densitySpectral graph neural network · Real-world node classification graphsaccuracyHelped
Use learned inverse density to correct the GSOSpectral graph neural network · AIDSclassification performanceHelped
Use learned inverse density for weighted poolingGraph classification network · AIDSclassification performanceHelped
Replace uniform pooling with learned inverse-density weighted poolingGraph classification network · AIDSclassification performanceHelped

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