paper-with-me

Papers

Riemannian Geometry Speaks Louder Than Words: From Graph Foundation Model to Next-Generation Graph Intelligence

2026-03-23 · Philip S. Yu, Li Sun arxiv

Graphs provide a natural description of the complex relationships among objects, and play a pivotal role in communications, transportation, social computing, the life sciences, etc. Currently, there is strong agreement that Graph Foundation Models (GFMs) are essential for advancing graph learning, yet considerable disagreement persists on how to build a powerful, general-purpose GFM analogous to Large Language Models (LLMs). Graph Neural Networks (GNNs) exhibit limitations in memory retention and principled interpretability when confronted with multi-domain pretraining and adaptation. The challenge of graph serialization hinders the direct application of LLMs, as the words struggle to capture the structural complexity and diversity inherent in graphs. In contrast, Riemannian geometry offers an elegant mathematical framework for modeling structures, while remaining compatible with graph semantic learning, even with LLMs. In this paper, we argue that, for graphs, Riemannian geometry speaks louder than words, and lay out the foundational principles for GFM. Reimagining with Riemannian geometry, we introduce a blue sky idea-Riemannian Foundation Model (RFM)-that opens a new pathway for capturing complex structural patterns and uncovering cross-domain generalities. RFM emphasizes intrinsic graph geometry and embodies endogenous capacities for structural inference and generation, moving beyond mere representation-space switching. Accordingly, we outline a progressive agenda that begins with universal structural understanding through intrinsic geometry, and then rebuilds LLM with a Riemannian engine for general-purpose graph modeling and beyond. Thus, RFM enables a paradigm shift from designing graph models to solving graph-structured applications with RFM agents, unlocking the next-generation graph intelligence.

📄 PDF Abstract BibTeX arXiv:2603.21601

Code (0)

등록된 구현이 없습니다.

Tasks

Graph Learning

Similar Papers 제목 키워드 기반

Text Speaks Louder than Vision: ASCII Art Reveals Textual Biases in Vision-Language Models

2025-04-02 · Zhaochen Wang, Yujun Cai, Zi Huang, Bryan Hooi 외

Vision-language models (VLMs) have advanced rapidly in processing multimodal information, but their ability to reconcile conflicting signals across modalities remains underexplored. This work investigates how VLMs proces…

Prompt Engineering

On measuring linguistic intelligence

2015-03-20 · Maxim Litvak

This work addresses the problem of measuring how many languages a person "effectively" speaks given that some of the languages are close to each other. In other words, to assign a meaningful number to her language portfo…

Riemannian Metric Learning: Closer to You than You Imagine

2025-03-07 · Samuel Gruffaz, Josua Sassen

Riemannian metric learning is an emerging field in machine learning, unlocking new ways to encode complex data structures beyond traditional distance metric learning. While classical approaches rely on global distances i…

Causal InferenceMetric LearningRepresentation Learning

Log-Euclidean Bag of Words for Human Action Recognition

2014-06-09 · Masoud Faraki, Maziar Palhang, Conrad Sanderson

Representing videos by densely extracted local space-time features has recently become a popular approach for analysing actions. In this paper, we tackle the problem of categorising human actions by devising Bag of Words…

Action RecognitionOptical Flow EstimationTemporal Action Localization

Poincaré GloVe: Hyperbolic Word Embeddings

2018-10-15 · Alexandru Tifrea, Gary Bécigneul, Octavian-Eugen Ganea

Words are not created equal. In fact, they form an aristocratic graph with a latent hierarchical structure that the next generation of unsupervised learned word embeddings should reveal. In this paper, justified by the n…

Word Embeddings