GRIT-LP: Graph Transformer with Long-Range Skip Connection and Partitioned Spatial Graphs for Accurate Ice Layer Thickness Prediction

• URL: http://arxiv.org/abs/2511.18716v1
• Date: Mon, 24 Nov 2025 03:14:55 GMT
• Title: GRIT-LP: Graph Transformer with Long-Range Skip Connection and Partitioned Spatial Graphs for Accurate Ice Layer Thickness Prediction
• Authors: Zesheng Liu, Maryam Rahnemoonfar,
• Abstract summary: We introduce GRIT-LP, a graph transformer explicitly designed for polar ice-layer thickness estimation from polar radar.<n>GRIT-LP combines an inductive geometric graph learning framework with self-attention mechanism.<n>We demonstrate that GRIT-LP outperforms current state-of-the-art methods with a 24.92% improvement in mean root squared error.
• Score: 1.6114012813668932
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Graph transformers have demonstrated remarkable capability on complex spatio-temporal tasks, yet their depth is often limited by oversmoothing and weak long-range dependency modeling. To address these challenges, we introduce GRIT-LP, a graph transformer explicitly designed for polar ice-layer thickness estimation from polar radar imagery. Accurately estimating ice layer thickness is critical for understanding snow accumulation, reconstructing past climate patterns and reducing uncertainties in projections of future ice sheet evolution and sea level rise. GRIT-LP combines an inductive geometric graph learning framework with self-attention mechanism, and introduces two major innovations that jointly address challenges in modeling the spatio-temporal patterns of ice layers: a partitioned spatial graph construction strategy that forms overlapping, fully connected local neighborhoods to preserve spatial coherence and suppress noise from irrelevant long-range links, and a long-range skip connection mechanism within the transformer that improves information flow and mitigates oversmoothing in deeper attention layers. We conducted extensive experiments, demonstrating that GRIT-LP outperforms current state-of-the-art methods with a 24.92\% improvement in root mean squared error. These results highlight the effectiveness of graph transformers in modeling spatiotemporal patterns by capturing both localized structural features and long-range dependencies across internal ice layers, and demonstrate their potential to advance data-driven understanding of cryospheric processes.

Related papers

• Multi-Stage Graph Neural Networks for Data-Driven Prediction of Natural Convection in Enclosed Cavities [0.0]
  Graph Neural Networks (GNNs) offer new alternatives for learning thermal-fluid behavior directly from simulation data.<n>We propose a novel multi-stage GNN architecture that leverages hierarchical pooling and unpooling operations to progressively model global-to-local interactions.<n> Experimental results demonstrate that the proposed model achieves higher predictive accuracy, improved training efficiency, and reduced long-term error accumulation.
  arXiv  Detail & Related papers  (2025-09-07T13:05:39Z)
• ST-GRIT: Spatio-Temporal Graph Transformer For Internal Ice Layer Thickness Prediction [0.7673339435080445]
  thickness and variability of internal ice layers in radar imagery is crucial for monitoring snow accumulation, assessing ice dynamics and reducing uncertainties in climate models.<n>In this work, we present-temporal graph for ice layer thickness, designed to process radar and capture relationships between shallow and deep ice layers.<n> ST-GRIT consistently outperforms current state-of-the-art methods and other baseline graph neural networks by achieving lower root mean-squared error.
  arXiv  Detail & Related papers  (2025-07-10T03:06:01Z)
• GRIT: Graph Transformer For Internal Ice Layer Thickness Prediction [0.7673339435080445]
  Radar sensors, capable of penetrating ice, capture detailed radargram images of internal ice layers.<n>GRIT integrates an inductive geometric graph learning framework with an attention mechanism to map the relationships between shallow and deeper ice layers.
  arXiv  Detail & Related papers  (2025-07-10T02:59:21Z)
• Mitigating Over-Squashing in Graph Neural Networks by Spectrum-Preserving Sparsification [81.06278257153835]
  We propose a graph rewiring method that balances structural bottleneck reduction and graph property preservation.<n>Our method generates graphs with enhanced connectivity while maintaining sparsity and largely preserving the original graph spectrum.
  arXiv  Detail & Related papers  (2025-06-19T08:01:00Z)
• PIORF: Physics-Informed Ollivier-Ricci Flow for Long-Range Interactions in Mesh Graph Neural Networks [23.97389618896843]
  We propose Physics-Informed Ollivier-Ricci Flow (PIORF), a novel rewiring method that combines physical correlations with graph topology.<n>We show that PIORF consistently outperforms baseline models and existing rewiring methods, achieving up to 26.2 improvement.
  arXiv  Detail & Related papers  (2025-04-05T04:14:05Z)
• Point Cloud Denoising With Fine-Granularity Dynamic Graph Convolutional Networks [58.050130177241186]
  Noise perturbations often corrupt 3-D point clouds, hindering downstream tasks such as surface reconstruction, rendering, and further processing. This paper introduces finegranularity dynamic graph convolutional networks called GDGCN, a novel approach to denoising in 3-D point clouds.
  arXiv  Detail & Related papers  (2024-11-21T14:19:32Z)
• SeaDAG: Semi-autoregressive Diffusion for Conditional Directed Acyclic Graph Generation [83.52157311471693]
  We introduce SeaDAG, a semi-autoregressive diffusion model for conditional generation of Directed Acyclic Graphs (DAGs) Unlike conventional autoregressive generation that lacks a global graph structure view, our method maintains a complete graph structure at each diffusion step. We explicitly train the model to learn graph conditioning with a condition loss, which enhances the diffusion model's capacity to generate realistic DAGs.
  arXiv  Detail & Related papers  (2024-10-21T15:47:03Z)
• SGFormer: Single-Layer Graph Transformers with Approximation-Free Linear Complexity [74.51827323742506]
  We evaluate the necessity of adopting multi-layer attentions in Transformers on graphs. We show that one-layer propagation can be reduced to one-layer propagation, with the same capability for representation learning. It suggests a new technical path for building powerful and efficient Transformers on graphs.
  arXiv  Detail & Related papers  (2024-09-13T17:37:34Z)
• Graph Dual-stream Convolutional Attention Fusion for Precipitation Nowcasting [1.4610685586329806]
  We reformulate precipitation nowcasting as a graph sequence problem.<n>Our model's dual-stream design employs distinct attention mechanisms for spatial temporal interactions.<n>A fusion module integrates both streams, leveraging spatial and temporal information for improved accuracy.
  arXiv  Detail & Related papers  (2024-01-15T20:54:20Z)
• Graph Transformer GANs for Graph-Constrained House Generation [223.739067413952]
  We present a novel graph Transformer generative adversarial network (GTGAN) to learn effective graph node relations. The GTGAN learns effective graph node relations in an end-to-end fashion for the challenging graph-constrained house generation task.
  arXiv  Detail & Related papers  (2023-03-14T20:35:45Z)
• Space-Time Graph Neural Networks [104.55175325870195]
  We introduce space-time graph neural network (ST-GNN) to jointly process the underlying space-time topology of time-varying network data. Our analysis shows that small variations in the network topology and time evolution of a system does not significantly affect the performance of ST-GNNs.
  arXiv  Detail & Related papers  (2021-10-06T16:08:44Z)
• Deoscillated Graph Collaborative Filtering [74.55967586618287]
  Collaborative Filtering (CF) signals are crucial for a Recommender System(RS) model to learn user and item embeddings. Recent Graph Neural Networks(GNNs) propose to stack multiple aggregation layers to propagate high-order signals. We propose a new RS model, named as textbfDeoscillated textbfGraph textbfCollaborative textbfFiltering(DGCF)
  arXiv  Detail & Related papers  (2020-11-04T02:26:53Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.