Jian Tang, Jie Tang, Jing Zhang, Hong Chen, Jifan Yu, Xiaokang Zhang, Cuiping Li, Turing Hinton, Bengio Edinburgh, Cambridge Mcgill
We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
Recent works on knowledge base question answering (KBQA) retrieve subgraphs for easier reasoning. The desired subgraph is crucial as a small one may exclude the answer but a large one might introduce more noises. However, the existing retrieval is either heuristic or interwoven with the reasoning, causing reasoning on the partial subgraphs, which increases the reasoning bias when the intermediate supervision is missing. This paper proposes a trainable subgraph retriever (SR) decoupled from the subsequent reasoning process, which enables a plug-and-play framework to enhance any subgraph-oriented KBQA model. Extensive experiments demonstrate SR achieves significantly better retrieval and QA performance than existing retrieval methods. Via weakly supervised pre-training as well as the end-to-end fine-tuning, SR achieves new state-of-the-art performance when combined with NSM (He et al., 2021), a subgraph-oriented reasoner, for embedding-based KBQA methods. Codes and datasets are available online 1 .
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2202.13296")
get_code_for_paper("2202.13296")
have("2202.13296")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2202.13296.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2202.13296)
Connect an agent — have() is free.