Edge Sparsification via Temporal Forman-Ricci Curvature for Dynamic Graph Learning

arXiv:2608.07158 · cs.LG · Submitted 2026-08-23 · Read on arXiv

Poupak Azad, Cuneyt Gurcan Akcora, Kiarash Shamsi

cs.LG

Submitted: 2026-08-23

Updated: 2026-08-25

License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/

Terminology

• AUC — 27× in this paper · explained in 2 episodes
• Benchmark — 10× in this paper · explained in 2 episodes
• Representation Learning — 6× in this paper · explained in 3 episodes
• Feature Extraction — 5× in this paper · explained in 3 episodes
• Pruning — 4× in this paper · explained in 4 episodes
• Robustness — 4× in this paper · explained in 6 episodes
• Sparsity — 3× in this paper · explained in 5 episodes
• Composition — 2× in this paper · explained in 2 episodes
• Core — 2× in this paper · explained in 2 episodes
• Information Leakage — 2× in this paper · explained in 2 episodes
• Monotonicity — 2× in this paper · explained in 2 episodes
• Overfitting — 2× in this paper · explained in 2 episodes
• Reinforcement Learning — 2× in this paper · explained in 4 episodes
• Adam — 1× in this paper · explained in 3 episodes
• Augmentation — 1× in this paper · explained in 2 episodes
• Bilevel Optimization — 1× in this paper · explained in 2 episodes
• Computational Efficiency — 1× in this paper · explained in 2 episodes
• Data Augmentation — 1× in this paper · explained in 10 episodes
• Downstream Tasks — 1× in this paper · explained in 2 episodes
• Evaluation Protocol — 1× in this paper · explained in 2 episodes
• Geometric interpretation — 1× in this paper · explained in 2 episodes
• Regularization — 1× in this paper · explained in 3 episodes
• Runtime Efficiency — 1× in this paper · explained in 2 episodes
• Structural Properties — 1× in this paper · explained in 2 episodes
• Transformer — 1× in this paper · explained in 2 episodes

Sources

• Temporal Graph Networks for Deep Learning on Dynamic Graphs
• TEDDY: Trimming Edges with Degree-based Discrimination strategY
• GraphSAINT: Graph Sampling Based Inductive Learning Method
• Graph Sparsification via Mixture of Graphs
• A Survey on Graph Structure Learning: Progress and Opportunities

Related papers

• Polynomial-Augmented Neural Networks (PANNs) with Weak Orthogonality Constraints for Enhanced Function and PDE Approximation
• AIRL-S: Unifying Reinforcement Learning and Search-Based Test-Time Scaling via Adversarial Inverse Reinforcement Learning
• Transformers as Bayesian In-Context Experimenters: Smoothness-Adaptive Efficient ATE Estimation
• Convergence issues in Relational Concept Analysis based on AOC-posets
• Beliefs Beyond Posteriors: The Predictive Cost of ELBO Binding
• Understanding Diffusion Models via Ratio-Based Function Approximation with SignReLU Networks