Complex Hyperbolic Knowledge Graph Embeddings with Fast Fourier Transform
30803Authors
nan
Abstract
AbstractThe choice of geometric space for knowledge graph (KG) embeddings can have significant effects on the performance of KG completion tasks. The hyperbolic geometry has been shown to capture the hierarchical patterns due to its tree-like metrics, which addressed the limitations of the Euclidean embedding models. Recent explorations of the complex hyperbolic geometry further improved the hyperbolic embeddings for capturing a variety of hierarchical structures. However, the performance of the hyperbolic KG embedding models for non-transitive relations is still unpromising, while the complex hyperbolic embeddings do not deal with multi-relations. This paper aims to utilize the representation capacity of the complex hyperbolic geometry in multi-relational KG embeddings. To apply the geometric transformations which account for different relations and the attention mechanism in the complex hyperbolic space, we propose to use the fast Fourier transform (FFT) as the conversion between the real and complex hyperbolic space. Constructing the attention-based transformations in the complex space is very challenging, while the proposed Fourier transform-based complex hyperbolic approaches provide a simple and effective solution. Experimental results show that our methods outperform the baselines, including the Euclidean and the real hyperbolic embedding models.
Keywords
Full Content
Proceedings of the 2022 Conference on Empirical Methods in Natural Language Processing, pages 526 - 537 December 7-11, 2022 ©2022 Association for Computational Linguistics Unsupervised Boundary-Aware Language Model Pretraining for Chinese Sequence Labeling Peijie Jiang1 Dingkun Long Yanzhao Zhang Pengjun Xie Meishan Zhang2∗ Min Zhang2 1School of New Media and Communication, Tianjin University, China 2Institute of Computing and Intelligence, Harbin Institute of Technology (Shenzhen) jzx555@tju.edu.cn, {zhangmeishan,zhangmin2021}@hit.edu.cn {longdingkun1993,zhangyanzhao00,xpjandy}@gmail.com Abstract Boundary information is critical for various Chinese language processing tasks, such as word segmentation, part-of-speech tagging, and named entity recognition. Previous stud- ies usually resorted to the use of a high-quality external lexicon, where lexicon items can of- fer explicit boundary information. However, to ensure the quality of the lexicon, great hu- man effort is always necessary, which has been generally ignored. In this work, we suggest un- supervised statistical boundary information in- stead, and propose an architecture to encode the information directly into pre-trained lan- guage models, resulting in Boundary-Aware BERT (BABERT). We apply BABERT for feature induction of Chinese sequence label- ing tasks. Experimental results on ten bench- marks of Chinese sequence labeling demon- strate that BABERT can provide consistent im- provements on all datasets. In addition, our method can complement previous supervised lexicon exploration, where further improve- ments can be achieved when integrated with external lexicon information. 1 Introduction The representative sequence labeling tasks for the Chinese language, such as word segmentation, part- of-speech (POS) tagging and named entity recogni- tion (NER) (Emerson, 2005; Jin and Chen, 2008), have been inclined to be performed at the character- level in an end-to-end manner (Shen et al., 2016). The paradigm, naturally, is standard to Chinese word segmentation (CWS), while for Chinese POS tagging and NER, it can better help reduce the error propagation (Sun and Uszkoreit, 2012; Yang et al., 2016; Liu et al., 2019a) compared with word-based counterparts by straightforward modeling. Recently, all the above tasks have reached state- of-the-art performances with the help of BERT- like pre-trained language models (Yan et al., 2019; ∗Corresponding author. Meng et al., 2019). The BERT variants, such as BERT-wwm (Cui et al., 2021), ERNIE (Sun et al., 2019), ZEN (Diao et al., 2020), NEZHA (Wei et al., 2019), etc., further improve the vanilla BERT by ei- ther using external knowledge or larger-scale train- ing corpus. The improvements can also benefit character-level Chinese sequence labeling tasks. Notably, since the output tags of all these character-level Chinese sequence labeling tasks in- volve identifying Chinese words or entities (Zhang and Yang, 2018; Yang et al., 2019), prior bound- ary knowledge could be highly helpful for them. A number of studies propose the integration of an external lexicon to enhance their baseline models by feature representation learning (Jia et al., 2020; Tian et al., 2020a; Liu et al., 2021). Moreover, some works suggest injecting similar resources into the pre-trained BERT weights. BERT-wwm (Cui et al., 2021) and ERNIE (Sun et al., 2019) are the representatives, which leverage an external lexicon for masked word prediction in Chinese BERT. …
Content truncated to 500 words
Labeled Text
AbstractThe choice of geometric space for knowledge graph (KG) embeddings can have significant effects on the performance of KG completion tasks. The hyperbolic geometry has been shown to capture the hierarchical patterns due to its tree-like metrics, which addressed the limitations of the Euclidean embedding models. Recent explorations of the complex hyperbolic geometry further improved the hyperbolic embeddings for capturing a variety of hierarchical structures. However, the performance of the hyperbolic KG embedding models for non-transitive relations is still unpromising, while the complex hyperbolic embeddings do not deal with multi-relations. This paper aims to utilize the representation capacity of the complex hyperbolic geometry in multi-relational KG embeddings. To apply the geometric transformations which account for different relations and the attention mechanism in the complex hyperbolic space, we propose to use the fast Fourier transform (FFT) as the conversion between the real and complex hyperbolic space. Constructing the attention-based transformations in the complex space is very challenging, while the proposed Fourier transform-based complex hyperbolic approaches provide a simple and effective solution. Experimental results show that our methods outperform the baselines, including the Euclidean and the real hyperbolic embedding models.
Publication Details
- Paper ID:
- 30803
- Year:
- 2022
- Publication:
- TIPSTER
- Publication Type:
- conf
- DOI:
- nan