2026· Annual Meeting of the Association for Computational Linguistics· pp. 22122-22133· 0 citations· 27 references
Computer Science
TL;DR
This framework introduces a Tangent-Residual Engine in multi-geometric spaces, which enables the first stable 8-layer geometric evolution and reveals a phenomenon termed Geometric Annealing, where manifold curvature spontaneously evolves from semantic flatness in shallow layers to structural complexity in deeper layers.
Abstract
Temporal Knowledge Graph (TKG) reasoning remains challenging to characterize with conventional flat representations due to its intrinsic heterogeneous structure. Existing multi-geometry approaches face two key bottlenecks: 1) the Riemannian depth barrier driven by numerical instability, which restricts models to shallow architectures; and 2) gate collapse, where adaptive fusion mechanisms suffer from gradient starvation and degenerate into single-geometry solutions. To this end, we propose MAGIC ( M ulti-geometry A nnealing G raph I nteraction with C onsensus). Our framework introduces a Tangent-Residual Engine in multi-geometric spaces, which enables the first stable 8-layer geometric evolution and reveals a phenomenon termed Geometric Annealing, where manifold curvature spontaneously evolves from semantic flatness in shallow layers to structural complexity in deeper layers. We further design an explicit reasoning module with structural consensus, leveraging geometric invariants and structural priors to regulate gradient flow, prevent collapse, and ensure robust synergy across Hyperbolic, Spherical, and Euclidean spaces. Experiments show that MAGIC achieves state-of-the-art performance in TKG reasoning, improving MRR by up to 2.9 points.
Knowledge graphs have become a fundamental representation for structured knowledge, yet their incompleteness remains a major obstacle to reliable reasoning. Missing links may interrupt relational paths and limit the evidence available for downstream inference. Knowledge graph completion addresses this problem by predic...
Entity alignment is a fundamental step for knowledge graph (KG) integration, yet the complex and heterogeneous structures of real-world KGs make accurate alignment particularly challenging. KG entity alignment faces two main challenges. First, representations learned in a single Euclidean or hyperbolic space struggle t...
Teng Fu, Gang Zhou, Chao Zhang· Journal of King Saud Univers...· 0 citations
An adaptive geometric hypergraph encoder that projects entities into a product manifold and design a topology-aware gating mechanism to dynamically select optimal geometric spaces for each entity, and a role-aware Transformer equipped with role-specific projections and micro-structural bias injection to refine embeddin...
Ke-Jia Chen, Yu-Zhe Hu, Yu Ni et al.· Proceedings of the Thirty-Fi...· 0 citations
Knowledge graph completion (KGC) aims to infer missing facts based on existing triplets. Traditional path-based methods formulate reasoning as a discrete multi-hop traversal, which suffers from exponential search space and error accumulation.In this paper, we propose FlowPath, which rethinks the reasoning process by tr...
Xin Song, Haiyan Liu, Ye Wang et al.· Proceedings of the 32nd ACM...· 0 citations
The proposed HyperMapper is a hyperbolic structure-aware mapping framework that bridges semantic understanding and geometric priors through hyperbolic token-to-feature interactions, and establishes a promising direction for task-preserving dual-task adaptation, bridging semantic and geometric learning and paving the wa...
Jiawei Liu, Da Yang, Tingwei Feng· IEEE Transactions on Neural...· 0 citations
Learning a stable yet highly discriminative representation space that can simultaneously recognize known categories and discover novel ones from limited labeled data is fundamental to Generalized Category Discovery (GCD) on graphs. Recently, Neural Collapse (NC) theory has emerged as a powerful geometric principle for...
Xu Xi, Zhong Zhang, Hongliang Wang et al.· Proceedings of the 32nd ACM...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.