Semantic Level of Detail: Multi-Scale Knowledge Representation via Heat Kernel Diffusion on Hyperbolic Manifolds

• URL: http://arxiv.org/abs/2603.08965v1
• Date: Mon, 09 Mar 2026 21:54:08 GMT
• Title: Semantic Level of Detail: Multi-Scale Knowledge Representation via Heat Kernel Diffusion on Hyperbolic Manifolds
• Abstract summary: We introduce Semantic Level of Detail (SLoD), a framework that defines a continuous zoom operator via heat kernel diffusion on the Poincaré ball.<n>We show that spectral gaps in the graph Laplacian induce emergent scale boundaries.<n>On synthetic hierarchies, our boundary scanner recovers planted levels with ARI up to 1.00, with detection degrading gracefully near the information-theoretic Kesten-Stigum threshold.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: AI memory systems increasingly organize knowledge into graph structures -- knowledge graphs, entity relations, community hierarchies -- yet lack a principled mechanism for continuous resolution control: where do the qualitative boundaries between abstraction levels lie, and how should an agent navigate them? We introduce Semantic Level of Detail (SLoD), a framework that answers both questions by defining a continuous zoom operator via heat kernel diffusion on the Poincaré ball $\mathbb{B}^d$. At coarse scales ($σ\to \infty$), diffusion aggregates embeddings into high-level summaries; at fine scales ($σ\to 0$), local semantic detail is preserved. We prove hierarchical coherence with bounded approximation error $O(σ)$ and $(1+\varepsilon)$ distortion for tree-structured hierarchies under Sarkar embedding. Crucially, we show that spectral gaps in the graph Laplacian induce emergent scale boundaries -- scales where the representation undergoes qualitative transitions -- which can be detected automatically without manual resolution parameters. On synthetic hierarchies (HSBM), our boundary scanner recovers planted levels with ARI up to 1.00, with detection degrading gracefully near the information-theoretic Kesten-Stigum threshold. On the full WordNet noun hierarchy (82K synsets), detected boundaries align with true taxonomic depth ($τ= 0.79$), demonstrating that the method discovers meaningful abstraction levels in real-world knowledge graphs without supervision.

Related papers

• H$^2$EDL: Hyper Evidential Deep Learning for Hierarchical Classification [19.611209640933435]
  A new uncertainty representation, H$2$EDL, can capture both fine-grained classes and intermediate concepts.<n>On FGVC-Aircraft and DERM12345, H$2$EDL reduces calibration error by approximately half compared with cross-entropy baselines.
  arXiv  Detail & Related papers  (2026-08-18T08:42:32Z)
• The Multiscale Single-Index Model: A Stylized Model for Hierarchical Feature Learning [33.59654714700262]
  We consider the Multiscale Single-Index Model (MSIM) as a stylized model for hierarchical learning with emphscale separation.<n>We perform a fine-grained analysis of the chaos using Wiener Edgeworth expansions.<n>We prove that online SGD on the correlation objective, where all layers evolve in the same timescale, $1 - o_d(1)$ recovery with $n = widetildeO( dK-1)$ samples, recovering the same sample complexity as in the linear counterpart.
  arXiv  Detail & Related papers  (2026-07-03T14:02:42Z)
• Learning Taxonomic Trees with Hierarchical Representation Regularization for Large Multimodal Models [47.868429337792314]
  Large multimodal models (LMMs) often lack taxonomic knowledge, leading to low hierarchical visual recognition (HVR) consistency.<n>We propose Hierarchical Representation Regularization ($HiR2$), a simple plug-and-play regularizer that improves hierarchical consistency in LMMs.<n>$HiR2$ effectively captures taxonomic structures across diverse LMMs and fine-tuning methods.
  arXiv  Detail & Related papers  (2026-07-03T03:16:41Z)
• HH-SAE: Discovering and Steering Hierarchical Knowledge of Complex Manifolds [12.383053678348281]
  We introduce the textbfHybrid (HH-SAE) to resolve rare semantic innovations in high-dimensional, mission-critical domains.<n> HH-SAE prioritizes high-order mechanistic innovation over environmental proxies to enable high-precision discovery in high-stakes environments.
  arXiv  Detail & Related papers  (2026-05-11T13:19:45Z)
• HGNet: Scalable Foundation Model for Automated Knowledge Graph Generation from Scientific Literature [6.001574550157585]
  We propose a two-stage framework for scalable, zero-shot scientific knowledge graph constructions.<n>We release SPHERE, a benchmark for hierarchical relation extraction.<n>In zero-shot settings, gains reach 10.76% for NER and 26.2% for RE.
  arXiv  Detail & Related papers  (2026-03-24T12:35:10Z)
• A Hyperbolic Perspective on Hierarchical Structure in Object-Centric Scene Representations [58.143688187023734]
  We propose a simple pipeline to project Euclidean slot embeddings onto the Lorentz hyperboloid of hyperbolic space.<n>We construct five-level visual hierarchies directly from slot attention masks.<n>We find that hyperbolic projection exposes a consistent scene-level to object-level organisation.
  arXiv  Detail & Related papers  (2026-03-14T16:53:59Z)
• Phase Transition for Budgeted Multi-Agent Synergy [41.486076708302456]
  Multi-agent systems can improve reliability, yet under a fixed inference budget they often help, saturate, or even collapse.<n>We develop a minimal and calibratable theory that predicts these regimes from three binding constraints of modern agent stacks.
  arXiv  Detail & Related papers  (2026-01-24T05:32:50Z)
• Improving LLM Reasoning with Homophily-aware Structural and Semantic Text-Attributed Graph Compression [55.51959317490934]
  Large language models (LLMs) have demonstrated promising capabilities in Text-Attributed Graph (TAG) understanding.<n>We argue that graphs inherently contain rich structural and semantic information, and that their effective exploitation can unlock potential gains in LLMs reasoning performance.<n>We propose Homophily-aware Structural and Semantic Compression for LLMs (HS2C), a framework centered on exploiting graph homophily.
  arXiv  Detail & Related papers  (2026-01-13T03:35:18Z)
• FedTopo: Topology-Informed Representation Alignment in Federated Learning under Non-I.I.D. Conditions [35.0734004020033]
  FedTopo is a framework that integrates Topological-Guided Block Screening (TGBS) and Topological Embedding (TE)<n>Experiments on Fashion-MNIST, CIFAR-10, and CIFAR-100 under four non-I.I.D. partitions show that FedTopo accelerates convergence and improves accuracy over strong baselines.
  arXiv  Detail & Related papers  (2025-11-16T14:40:58Z)
• Hyperbolic Residual Quantization: Discrete Representations for Data with Latent Hierarchies [48.72319569157807]
  Residual Quantization (RQ) is widely used to generate discrete, multitoken representations for hierarchical data.<n>We propose Hyperbolic Residual Quantization (HRQ), which embeds data in a hyperbolic manifold.<n>HRQ imparts an inductive bias that aligns naturally with hierarchical branching.
  arXiv  Detail & Related papers  (2025-05-18T13:14:07Z)
• Hyperbolic Hypergraph Neural Networks for Multi-Relational Knowledge Hypergraph Representation [19.14148664582895]
  We propose the Hyperbolic Hypergraph Neural Network (H2GNN), whose essential component is the hyper-star message passing.<n>We compare H2GNN with 15 baselines on knowledge hypergraphs, and it outperforms state-of-the-art approaches in both node classification and link prediction tasks.
  arXiv  Detail & Related papers  (2024-12-11T12:03:33Z)
• Information-Theoretic Thresholds for Planted Dense Cycles [52.076657911275525]
  We study a random graph model for small-world networks which are ubiquitous in social and biological sciences. For both detection and recovery of the planted dense cycle, we characterize the information-theoretic thresholds in terms of $n$, $tau$, and an edge-wise signal-to-noise ratio $lambda$.
  arXiv  Detail & Related papers  (2024-02-01T03:39:01Z)
• Understanding and Mitigating Hyperbolic Dimensional Collapse in Graph Contrastive Learning [70.0681902472251]
  We propose a novel contrastive learning framework to learn high-quality graph embeddings in hyperbolic space.<n>Specifically, we design the alignment metric that effectively captures the hierarchical data-invariant information.<n>We show that in the hyperbolic space one has to address the leaf- and height-level uniformity related to properties of trees.
  arXiv  Detail & Related papers  (2023-10-27T15:31:42Z)
• Bringing motion taxonomies to continuous domains via GPLVM on hyperbolic manifolds [8.385386712928785]
  Human motion serves as high-level hierarchical abstractions that classify how humans move and interact with their environment. We propose to model taxonomy data via hyperbolic embeddings that capture the associated hierarchical structure. We show that our model properly encodes unseen data from existing or new taxonomy categories, and outperforms its Euclidean and VAE-based counterparts.
  arXiv  Detail & Related papers  (2022-10-04T15:19:24Z)
• Hierarchical nucleation in deep neural networks [67.85373725288136]
  We study the evolution of the probability density of the ImageNet dataset across the hidden layers in some state-of-the-art DCNs. We find that the initial layers generate a unimodal probability density getting rid of any structure irrelevant for classification. In subsequent layers density peaks arise in a hierarchical fashion that mirrors the semantic hierarchy of the concepts.
  arXiv  Detail & Related papers  (2020-07-07T14:42:18Z)

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.