The reviewed record of science sign in
Pith

arxiv: 2002.01808 · v5 · pith:V4G67KJH · submitted 2020-02-05 · cs.CL · cs.LG

K-Adapter: Infusing Knowledge into Pre-Trained Models with Adapters

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:V4G67KJHrecord.jsonopen to challenge →

classification cs.CL cs.LG
keywords knowledgeadaptersk-adapterpre-trainedrobertamodelmodelsadapter
0
0 comments X
read the original abstract

We study the problem of injecting knowledge into large pre-trained models like BERT and RoBERTa. Existing methods typically update the original parameters of pre-trained models when injecting knowledge. However, when multiple kinds of knowledge are injected, the historically injected knowledge would be flushed away. To address this, we propose K-Adapter, a framework that retains the original parameters of the pre-trained model fixed and supports the development of versatile knowledge-infused model. Taking RoBERTa as the backbone model, K-Adapter has a neural adapter for each kind of infused knowledge, like a plug-in connected to RoBERTa. There is no information flow between different adapters, thus multiple adapters can be efficiently trained in a distributed way. As a case study, we inject two kinds of knowledge in this work, including (1) factual knowledge obtained from automatically aligned text-triplets on Wikipedia and Wikidata and (2) linguistic knowledge obtained via dependency parsing. Results on three knowledge-driven tasks, including relation classification, entity typing, and question answering, demonstrate that each adapter improves the performance and the combination of both adapters brings further improvements. Further analysis indicates that K-Adapter captures versatile knowledge than RoBERTa.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. KoRe: Compact Knowledge Representations for Large Language Models

    cs.CL 2026-05 unverdicted novelty 6.0

    KoRe encodes 1-hop knowledge graph subgraphs as compact discrete tokens for injection into LLMs, achieving competitive benchmark performance with up to 10x token reduction.

  2. Position: How can Graphs Help Large Language Models?

    cs.AI 2026-05 unverdicted novelty 3.0

    Graphs can help LLMs reduce hallucinations, boost reasoning via prompting techniques, and better process structured data.