Can knowledge graphs teach models deep domain expertise?
Explores whether organizing knowledge as structured graph paths, composed from simple to complex, can enable language models to develop genuine domain superintelligence rather than surface-level pattern matching.
Language models acquire general abstractions through top-down self-supervised learning on vast corpora, but this approach captures surface-level regularities rather than deep domain expertise. Bottom-up curriculum learning from knowledge graphs offers an alternative: KG paths naturally encode compositional reasoning chains where atomic triples (e.g., "Methane Contains Element Carbon") compose into multi-hop paths that build toward higher-order understanding (e.g., methane's bonding structure through C-H bonds → sigma bonds → single covalent bonds).
The pipeline synthesizes 24,000 reasoning tasks from a medical KG, paired with structured thinking traces derived from diverse medical primitives. Fine-tuning QwQ-32B on this curriculum produces QwQ-Med-3, which significantly outperforms state-of-the-art open-source and proprietary reasoning models across 15 medical domains on the ICD-Bench evaluation suite.
The key architectural insight: KG topology naturally induces the bottom-up curriculum — beginning with atomic relations and composing them into increasingly complex reasoning chains. This mirrors how human students build expertise through pedagogical structure (foundational → advanced chapters), not encyclopedic browsing. Previous neuro-symbolic and probabilistic graph inference approaches attempted similar hierarchical reasoning from primitives but failed to generalize beyond synthetic regimes; LMs provide the generalization capability that symbolic systems lacked.
The broader implication challenges the AGI-as-breadth paradigm: domain-specific superintelligence may be achievable through relatively small models (32B) fine-tuned on structured domain knowledge, composing into broader intelligence through interacting specialist agents — analogous to how human society acquires expertise through collaborative specialization.
This connects to:
- Can organizing knowledge structures beat raw training data volume? — both demonstrate that knowledge structure matters more than knowledge volume; StructTuning is taxonomy-based, KG curriculum is path-based
- Does gradually tightening token budgets beat fixed budget training? — curriculum design principle applies to both RL token budgets and KG complexity progression
- Why does reasoning training help math but hurt medical tasks? — bottom-up KG curriculum may work precisely because it provides both domain knowledge (lower layers) and compositional reasoning (higher layers) simultaneously
- Does procedural knowledge drive reasoning more than factual retrieval? — KG paths encode procedural/relational knowledge, not just factual triples
Inquiring lines that use this note as a source 47
This note is a source for these synthesized inquiries. Follow a line forward into its question, or open it to trace back to all of its sources.
- How do knowledge layers differ functionally from reasoning layers in networks?
- How does LLM hallucination risk manifest in knowledge graph construction?
- How much does organized knowledge improve learning efficiency versus raw data?
- What techniques work best for injecting domain knowledge at training time?
- Can domain-expert workflows always decompose into inspectable stages for AI?
- Can knowledge graphs generate scalable training data for deep search agents?
- How does retrieval-augmented generation extract structured properties from domain descriptions?
- Can prompting alone inject new domain knowledge into a model?
- Why does domain-specific terminology require customization of vector search and generation?
- How does cross-domain reasoning transfer differ from domain-specific knowledge transfer?
- What architectural changes would let language models develop genuine functional competence?
- How do LLMs and knowledge graphs work together in different integration patterns?
- Does knowledge structure matter more than knowledge volume for model training?
- Can query-time logic graphs match the efficiency of pre-built knowledge graph indexing?
- What causes catastrophic forgetting during domain knowledge embedding?
- How should rapidly evolving domains choose knowledge injection methods?
- Can in-context learning substitute for domain-specific training altogether?
- Could graph neural networks fundamentally outperform transformers on structured reasoning?
- What makes knowledge-rich specialized domains structurally different from general reasoning tasks?
- Can domain pretraining on historical legal corpora reduce era sensitivity?
- When should you use knowledge graphs instead of semantic vector retrieval systems?
- Can small edits to source text compromise entire knowledge graph reliability?
- How do language agents become optimizable computational graphs automatically?
- How can knowledge graphs improve over pure embedding retrieval?
- Can knowledge graphs externalize and validate reasoning steps during inference?
- Does small-world structure in reasoning graphs improve generalization?
- Can dataset design systematically expand reasoning graph diameter?
- How does retrieval-augmented training reduce domain specialization cliff failures?
- How do review-augmented systems compare to knowledge graph approaches?
- Can knowledge graph structure alone generate sufficient training signals for domain reasoning?
- How do random walk reasoning chains from knowledge graphs compare to traditional fine-tuning?
- Can knowledge graph structure be exploited for efficient multi-hop retrieval?
- Does directional knowledge failure indicate shallow pattern matching over deep representation?
- Can granular function calling tasks learn composition from graph-sampled data?
- Can knowledge density per token be measured as a quality metric?
- Do graph databases outperform embeddings for relational retrieval tasks?
- Why do LLMs recognize graph entities without modeling their relationships?
- How do knowledge graphs scale as training data for open-ended search tasks?
- Can knowledge graphs built at inference time outperform pre-built retrieval augmented generation?
- Why do leading embedding eigenvectors align with WordNet taxonomy structure?
- Can extracted skills transfer effectively across different domains and model architectures?
- Can dense models partially address modality friction without full expert specialization?
- Can reasoning learned from language modeling actually transfer to knowledge-intensive domains?
- Can graph topology represent successful trajectory clusters more effectively than skill libraries?
- Why do fixed-schema outputs fail to capture real knowledge relationships?
- How do hierarchical knowledge layers capture different types of narrative information?
- Can expert-derived knowledge bases scale to other high-stakes domains?
Related papers in this collection 8
Papers most semantically related to this note, ranked by cosine similarity in the embedding space.
- Bottom-up Domain-specific Superintelligence: A Reliable Knowledge Graph is What We Need
- Self-Organizing Graph Reasoning Evolves into a Critical State for Continuous Discovery Through Structural-Semantic Dynamics
- Large Language Models are In-Context Semantic Reasoners rather than Symbolic Reasoners
- Faith and Fate: Limits of Transformers on Compositionality
- Can Language Models Solve Graph Problems in Natural Language?
- Neurosymbolic AI- Why, What, and How
- Enhancing Dialogue Generation via Dynamic Graph Knowledge Aggregation
- The Molecular Structure of Thought: Mapping the Topology of Long Chain-of-Thought Reasoning
Original note title
Knowledge graph curriculum enables bottom-up domain superintelligence by composing primitives into complex reasoning chains