Skip to content

Author

Menglin Yang

We have 4 of 34 papers

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Book Open access Aug 2026

Geometric Space, Architecture and Learning Objective for Large Pre-Trained Models

Large pretrained models have reshaped artificial intelligence, yet their Euclidean design assumptions often limit their ability to model hierarchy, curvature, symmetry, and heterogeneous relations in real-world data. The Geometric Space, Architecture and Learning Objective for Large Pre-Trained Models (GALOP) workshop is an accepted half-day KDD 2026 workshop that examines how geometric principles can make large pretrained models more expressive, robust, interpretable, and efficient. The workshop is organized around three complementary themes: (1) Geometric Space, which studies non-Euclidean representation spaces such as hyperbolic, spherical, and mixed-curvature manifolds; (2) Geometric Architecture, which designs model architectures that respect data symmetries, manifold structure, and relational geometry; and (3) Geometric Learning Objective, which develops objectives and optimization methods that preserve distances, angles, curvature, and topology during training. Through two invited talks and four contributed talks, the workshop brings together researchers from machine learning, data mining, and related fields to advance geometrically-informed foundation models for language, vision, graphs, knowledge discovery, and scientific discovery.

Menglin Yang, Jiahong Liu, Lucas Vinh Tran et al. · 0 citations
Book Open access Aug 2026

Hyperbolic Learning for Structured Data, Knowledge, and Memory: A Tutorial

Foundation models are increasingly deployed as agentic data-and-memory systems built on pretrained parameters, retrieval corpora, external knowledge stores, and persistent interaction histories. For the Knowledge Discovery and Data Mining (KDD) community, this matters because recommendation, search, temporal modeling, enterprise knowledge systems, and AI for science are tasked with organizing long-tail, hierarchical, and relational data while supporting retrieval, adaptation, and memory at scale. Yet Euclidean latent spaces can be a limited fit for tree-like or ontology-rich structure. Hyperbolic geometry offers a useful modeling tool: its exponential volume growth supports compact representations of hierarchy, association, and asymmetric neighborhoods. This lecture-style tutorial covers hyperbolic methods for data organization, retrieval, and memory layers in foundation-model systems: manifold operations, scalable neural primitives, retrieval-aware pipelines, recommendation and knowledge systems, agent memory, multimodal and scientific data modeling, and lifecycle operations including fine-tuning, editing, and unlearning. We emphasize when curved geometry can improve KDD systems and how to evaluate and deploy those gains responsibly. Homepage: https://hyperboliclearning.github.io/events/kdd2026tutorial.

Jiahong Liu, Menglin Yang, Irwin King · 0 citations
Preprint Aug 2026

FlatLand: Personalized Graph Federated Learning via Tailored Lorentz Space

Federated learning enables privacy-preserving collaborative training, but highly heterogeneous client data remain challenging, especially in graph federated learning where clients possess structurally diverse graphs. Existing personalized federated learning (PFL) methods ignore the intrinsic geometric properties of diverse graph structures. We propose FlatLand, a novel personalized federated learning method that embeds different clients'data in tailored Lorentz space of hyperbolic geometry. Our key insight is that hyperbolic geometry naturally accommodates the intrinsic negative curvature prevalent in real-world graphs, while the time-like dimension in Lorentz space provides a principled way to encode client-specific heterogeneity. We develop a parameter decoupling strategy that separates heterogeneous information (captured in time-like parameters) from common knowledge (preserved in space-like parameters), enabling direct aggregation without requiring client similarity estimation and extra calculation modules. Empirical results on diverse federated graph learning tasks demonstrate that FlatLand achieves superior performance, particularly in low-dimensional settings.

Jiahong Liu, Ram Samarth, Xinyu Fu et al. · 0 citations
Preprint Aug 2026

MGAL: A Multilingual Granularity-Aware Long-Context Benchmark

MGAL is the first multilingual, granularity- and position-aware long-context benchmark, constructed from United Nations reports spanning 8K to 128K tokens across the six official UN languages, and finds that LLMs perform well at word-level tasks but struggle with coarser-grained ones.

Chunhan Li, Chenglin Xu, Zongyang Zhang et al. · 0 citations