# ALBERT with Knowledge Graph Encoder Utilizing Semantic Similarity for Commonsense Question Answering

Source: [ALBERT with Knowledge Graph Encoder Utilizing Semantic Similarity for Commonsense Question Answering](<https://www.sota2.com/research/paper/68fa6de11e209131cea3ca14>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2025-10-26T00:45:11.347Z

Authors: Byeongmin Choi, YongHyun Lee, Yeunwoong Kyung, Eunchan Kim

Published: 2022-11-14T01:39:26.000Z

## Abstract

Recently, pre-trained language representation models such as bidirectional encoder representations from transformers (BERT) have been performing well in commonsense question answering (CSQA). However, there is a problem that the models do not directly use explicit information of knowledge sources existing outside. To augment this, additional methods such as knowledge-aware graph network (KagNet) and multi-hop graph relation network (MHGRN) have been proposed. In this study, we propose to use the latest pre-trained language model a lite bidirectional encoder representations from transformers (ALBERT) with knowledge graph information extraction technique. We also propose to applying the novel method, schema graph expansion to recent language models. Then, we analyze the effect of applying knowledge graph-based knowledge extraction techniques to recent pre-trained language models and confirm that schema graph expansion is effective in some extent. Furthermore, we show that our proposed model can achieve better performance than existing KagNet and MHGRN models in CommonsenseQA dataset.

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/2211.07065>)

[PDF](<https://arxiv.org/pdf/2211.07065.pdf>)
