Meta Operator for Complex Query Answering on Knowledge Graphs
Not on the map. Why?
Abstract (arXiv)
Knowledge graphs contain informative factual knowledge but are considered incomplete. To answer complex queries under incomplete knowledge, learning-based Complex Query Answering (CQA) models are proposed to directly learn from the query-answer samples to avoid the direct traversal of incomplete graph data. Existing works formulate the training of complex query answering models as multi-task learning and require a large number of training samples. In this work, we explore the compositional structure of complex queries and argue that the different logical operator types, rather than the different complex query types, are the key to improving generalizability. Accordingly, we propose a meta-learning algorithm to learn the meta-operators with limited data and adapt them to different instances of operators under various complex queries. Empirical results show that learning meta-operators is more effective than learning original CQA or meta-CQA models.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 21 of its 29 references that are in the map. First posted on arXiv 15 Mar 2024.
Builds on
21 of 29 references.
References · 21
- 2017Model-Agnostic Meta-Learning for Fast Adaptation of Deep Networkscited by 4,897
- 2016Matching Networks for One Shot Learningcited by 2,255
- 2020Meta-Learning in Neural Networks: A Surveycited by 950
- 2019Rapid Learning or Feature Reuse? Towards Understanding the Effectiveness of MAMLcited by 359
- 2020Query2box: Reasoning over Knowledge Graphs in Vector Space using Box Embeddingscited by 171
- 2020Beta Embeddings for Multi-Hop Logical Reasoning in Knowledge Graphscited by 129
- 2019Meta-GNN: On Few-shot Node Classification in Graph Meta-learningcited by 105
- 2020Complex Query Answering with Neural Link Predictorscited by 99
- 2021ConE: Cone Embeddings for Multi-Hop Reasoning over Knowledge Graphscited by 78
- 2022Unobserved Local Structures Make Compositional Generalization Hardcited by 29
- 2021Probabilistic Entity Representation Model for Reasoning over Knowledge Graphscited by 28
- 2023Logical Message Passing Networks with One-hop Inference on Atomic Formulascited by 28
9 more
- 2022Query2Particles: Knowledge Graph Reasoning with Particle Embeddingscited by 24
- 2021Benchmarking the Combinatorial Generalizability of Complex Query Answering on Knowledge Graphscited by 21
- 2023Complex Query Answering on Eventuality Knowledge Graph with Implicit Logical Constraintscited by 21
- 2021Logic Embeddings for Complex Query Answeringcited by 17
- 2022Neural Methods for Logical Reasoning Over Knowledge Graphscited by 17
- 2023Wasserstein-Fisher-Rao Embedding: Logical Query Embeddings with Local Comparison and Global Transportcited by 16
- 2023Rethinking Complex Queries on Knowledge Graphs with Neural Link Predictorscited by 13
- 2023EFOk-CQA: Towards Knowledge Graph Complex Query Answering beyond Set Operationcited by 12
- 2023Knowledge Graph Reasoning over Entities and Numerical Valuescited by 11
Built on by
Citing papers per year: 2025: 1; 2026: 1.
2 papers.