mlsanityData to 7 Oct 2026

Relational Learning in Pre-Trained Models: A Theory from Hypergraph Recovery Perspective

arXiv 2406.11249 ↗First posted 17 Jun 2024cs.AI cs.LGcited by 1

Not on the map. Why?

Abstract (arXiv)

Foundation Models (FMs) have demonstrated remarkable insights into the relational dynamics of the world, leading to the crucial question: how do these models acquire an understanding of world hybrid relations? Traditional statistical learning, particularly for prediction problems, may overlook the rich and inherently structured information from the data, especially regarding the relationships between objects. We introduce a mathematical model that formalizes relational learning as hypergraph recovery to study pre-training of FMs. In our framework, the world is represented as a hypergraph, with data abstracted as random samples from hyperedges. We theoretically examine the feasibility of a Pre-Trained Model (PTM) to recover this hypergraph and analyze the data efficiency in a minimax near-optimal style. By integrating rich graph theories into the realm of PTMs, our mathematical framework offers powerful tools for an in-depth understanding of pre-training from a unique perspective and can be used under various scenarios. As an example, we extend the framework to entity alignment in multimodal learning.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 30 of its 60 references that are in the map. First posted on arXiv 17 Jun 2024.

Builds on

30 of 60 references.

References · 30

  1. 2023GPT-4 Technical Reportcited by 18,132
  2. 2021Masked Autoencoders Are Scalable Vision Learnerscited by 7,339
  3. 2017Model-Agnostic Meta-Learning for Fast Adaptation of Deep Networkscited by 4,861
  4. 2021Zero-Shot Text-to-Image Generationcited by 4,276
  5. 2021On the Opportunities and Risks of Foundation Modelscited by 3,961
  6. 2023Sparks of Artificial General Intelligence: Early experiments with GPT-4cited by 2,579
  7. 2016ConceptNet 5.5: An Open Multilingual Graph of General Knowledgecited by 1,065
  8. 2017Convolutional 2D Knowledge Graph Embeddingscited by 729
  9. 2022Transformers learn in-context by gradient descentcited by 714
  10. 2022What learning algorithm is in-context learning? Investigations with linear modelscited by 671
  11. 2019Explain Yourself! Leveraging Language Models for Commonsense Reasoningcited by 367
  12. 2023Mathematical Capabilities of ChatGPTcited by 263
18 more
  1. 2018Probabilistic Model-Agnostic Meta-Learningcited by 254
  2. 2023Large Language Models as Commonsense Knowledge for Large-Scale Task Planningcited by 231
  3. 2023Transformers as Algorithms: Generalization and Stability in In-context Learningcited by 220
  4. 2023Planning with Large Language Models for Code Generationcited by 179
  5. 2020Provable Meta-Learning of Linear Representationscited by 161
  6. 2022Should You Mask 15% in Masked Language Modeling?cited by 117
  7. 2018Relational Deep Reinforcement Learningcited by 72
  8. 2023Relational Deep Learning: Graph Representation Learning on Relational Databasescited by 55
  9. 2018Efficient random graph matching via degree profilescited by 48
  10. 2021Near-optimal Representation Learning for Linear Bandits and Linear RLcited by 45
  11. 2023RETA-LLM: A Retrieval-Augmented Large Language Model Toolkitcited by 40
  12. 2016Improved Achievability and Converse Bounds for ErdHos-R'enyi Graph Matchingcited by 30
  13. 2018(Nearly) Efficient Algorithms for the Graph Matching Problem on Correlated Random Graphscited by 29
  14. 2021Topological Relational Learning on Graphscited by 27
  15. 2022Nearly Minimax Algorithms for Linear Bandits with Shared Representationcited by 16
  16. 2022Active Multi-Task Representation Learningcited by 13
  17. 2017An exponential lower bound for Individualization-Refinement algorithms for Graph Isomorphismcited by 1
  18. 2021Hypergraph Dissimilarity Measurescited by 1

Built on by

Cited by year

Citing papers per year: 2025: 1.

1 paper.