atlas

Research map / Learning theory and algorithms / Combinatorial and search optimization

De-coupled NeuroGF for Shortest Path Distance Approximations on Large Terrain Graphs

ICML 2025 · Learning theory and algorithms › Combinatorial and search optimization · approach: Constrained neural network optimization

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's full text. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Proposes decoupled-NeuroGF, which trains a GAT Siamese L1 embedding first (on coarsened terrain graphs in the M-CTR variant), freezes it, and then trains only an MLP distance head on full-resolution terrains to answer approximate shortest-path-distance queries at large scale.

Problem

Answering approximate shortest-path-distance (geodesic) queries on very large terrain DEMs (millions of nodes) is too costly for existing algorithmic data structures and for end-to-end neural approaches such as NeuroGF and GeGNN.

Approach

Decouple NeuroGF training into two stages: a GAT embedding trained with L1 distance, frozen, then an MLP distance head fine-tuned on full-resolution terrain; combined with coarse-to-refined training (M-CTR) that trains the costly embedding on a downsampled grid.

Key results

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Add a distance MLP after the GAT+L1 embedding and train it separately (ablation)NeuroGF on Norway-250 · Norway-250 (downsampled)relative error (%): 1.32 ± 2.03 -> 0.84 ± 1.66Helped
Use a distance MLP instead of L1 distance in the latent space (ablation)GAT embedding on Norway-250 · Norway-250 (downsampled)relative error (%): 0.92 ± 0.95 -> 1.32 ± 2.03Hurt
Use M-CTR instead of coarse embeddings with L1 distance aloneNeuroGF on Norway · Norway (4M nodes)relative error (%): 1.05 ± 0.99 -> 0.90 ± 1.49Helped
Use M-CTR instead of coarse embeddings with L1 distance aloneNeuroGF on Los Angeles · Los Angeles (16M nodes)relative error (%): 1.04 ± 1.09 -> 0.88 ± 3.47Helped
Use M-CTR instead of coarse embeddings with L1 distance aloneNeuroGF on Philadelphia · Philadelphia (1M nodes)relative error (%): 2.07 ± 1.47 -> 0.51 ± 0.71Helped
Use M-CTR instead of coarse embeddings with L1 distance aloneNeuroGF on Holland · Holland (1M nodes)relative error (%): 2.06 ± 1.54 -> 0.86 ± 2.29Helped
Use M-CTR instead of coarse embeddings with L1 distance aloneNeuroGF on weighted terrain graphs · Los Angeles, weighted terrainrelative error (%): 3.55 ± 2.76 -> 1.91 ± 4.66Helped
Use M-CTR instead of coarse embeddings with L1 distance aloneNeuroGF on weighted terrain graphs · Philadelphia, weighted terrainrelative error (%): 2.43 ± 4.62 -> 1.32 ± 2.96Helped
Use M-CTR instead of coarse embeddings with L1 distance aloneNeuroGF on weighted terrain graphs · Holland, weighted terrainrelative error (%): 2.48 ± 6.20 -> 0.82 ± 1.69Helped
Reuse embeddings and retrain only the distance MLP for terrain instantiationsNeuroGF on uncertain Norway terrain · Norway, uncertain terrainrelative error (%): 19.4 ± 3.04 -> 1.76 ± 2.30Helped
Reuse embeddings and retrain only the distance MLP for terrain instantiationsNeuroGF on uncertain Los Angeles terrain · Los Angeles, uncertain terrainrelative error (%): 2.27 ± 2.06 -> 0.77 ± 1.04Helped
Reuse embeddings and retrain only the distance MLP for terrain instantiationsNeuroGF on uncertain Philadelphia terrain · Philadelphia, uncertain terrainrelative error (%): 29.8 ± 6.84 -> 6.14 ± 7.88Helped

Surprising findings

Limitations

Experimental setup

Datasets: Synthetic Gaussian terrains (50x50 grid) Norway DEM (4M nodes) Los Angeles DEM (16M nodes) Holland, Indiana DEM (1M nodes) Philadelphia DEM (1M nodes)

Benchmarks: Synthetic Gaussian terrains Norway-250 downsampled LA Norway Holland Philadelphia weighted terrains uncertainty terrains

Metrics: average relative error (%) accuracy within 2% relative error (%) training time (min)

Baselines: NeuroGF (GAT+MLP) GeGNN GAT+L1 Coarse-GAT+L1 GCN+MLP

Builds on: NeuroGF graph attention network graph convolutional network metric learning Siamese network

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