← Search

Guanglai Gao

29 accepted papers

2026

FlorE: Integrating Full Lorentz Group and Directional Offsets for Effective Knowledge Graph Embedding

AAAI 2026technical

Knowledge Graph Embedding (KGE) aims to map entities and relationships into a continuous vector space to facilitate reasoning and downstream tasks. Although previous KGE methods based on Euclidean, complex spaces, or hyperbolic spaces have performed well, they still struggle to effectively model Z-P

Cited by 0SourcePDFScholar
2025

A Mutual Information Perspective on Knowledge Graph Embedding

ACL 2025long

Knowledge graph embedding techniques have emerged as a critical approach for addressing the issue of missing relations in knowledge graphs. However, existing methods often suffer from limitations, including high intra-group similarity, loss of semantic information, and insufficient inference capabil…

Cited by 0SourcePDFScholar
2025

Distance-Adaptive Quaternion Knowledge Graph Embedding with Bidirectional Rotation

COLING 2025main

Quaternion contains one real part and three imaginary parts, which provided a more expressive hypercomplex space for learning knowledge graph. Existing quaternion embedding models measure the plausibility of a triplet either through semantic matching or distance scoring functions. However, it appear…

2025

F²Bench: An Open-ended Fairness Evaluation Benchmark for LLMs with Factuality Considerations

EMNLP 2025

With the growing adoption of large language models (LLMs) in NLP tasks, concerns about their fairness have intensified. Yet, most existing fairness benchmarks rely on closed-ended evaluation formats, which diverge from real-world open-ended interactions. These formats are prone to position bias and

2025

McBE: A Multi-task Chinese Bias Evaluation Benchmark for Large Language Models

ACL 2025finding

As large language models (LLMs) are increasingly applied to various NLP tasks, their inherent biases are gradually disclosed. Therefore, measuring biases in LLMs is crucial to mitigate its ethical risks. However, most existing bias evaluation datasets are focus on English andNorth American culture,…

Cited by 0SourcePDFScholar
2025

Mitigating Heterogeneity among Factor Tensors via Lie Group Manifolds for Tensor Decomposition Based Temporal Knowledge Graph Embedding

NAACL 2025long

Recent studies have highlighted the effectiveness of tensor decomposition methods in the Temporal Knowledge Graphs Embedding (TKGE) task. However, we found that inherent heterogeneity among factor tensors in tensor decomposition significantly hinders the tensor fusion process and further limits the…

2025

SSAN: A Symbol Spatial-Aware Network for Handwritten Mathematical Expression Recognition

AAAI 2025technical

The great challenge of handwritten mathematical expression recognition (HMER) is the complex structures of the expressions, which are directly related to the symbol spatial positions. Existing HMER methods typically employ attention mechanisms in the decoder of their models to implicitly perceive th…

2025

Structural-Aware Disentangled Learning with CLIP for Hyperbolic Zero-Shot Sketch-Based Image Retrieval

ICASSP 2025accepted

The zero-shot sketch-based image retrieval task faces two key challenges: domain gap and knowledge transfer. Our innovation is recognizing that directly aligning cross-domain features weakens the discriminative ability of the model, as it overlooks the asymmetry between sketches and images. Addition…

Cited by 0SourceScholar
2025

Task-Decoupled Bezier Surface Constraint for Uneven Low-Light Image Enhancement

ICCV 2025poster

Low-light image enhancement (LLIE) is a fundamental task in computer vision. Its goal is to extract more useful information from dark regions. Many existing methods have made excellent strides in improving image brightness and enhancing texture details. However, these approaches often lead to overex…

Cited by 0SourcePDFScholar
2025

Unifying Dual-Space Embedding for Entity Alignment via Contrastive Learning

COLING 2025main

Entity alignment (EA) aims to match identical entities across different knowledge graphs (KGs). Graph neural network-based entity alignment methods have achieved promising results in Euclidean space. However, KGs often contain complex local and hierarchical structures, which are hard to represent in…

2024

EpLSA: Synergy of Expert-prefix Mixtures and Task-Oriented Latent Space Adaptation for Diverse Generative Reasoning

COLING 2024main

Existing models for diverse generative reasoning still struggle to generate multiple unique and plausible results. Through an in-depth examination, we argue that it is critical to leverage a mixture of experts as prefixes to enhance the diversity of generated results and make task-oriented adaptatio…

2024

Exploring the Synergy of Dual-path Encoder and Alignment Module for Better Graph-to-Text Generation

COLING 2024main

The mainstream approaches view the knowledge graph-to-text (KG-to-text) generation as a sequence-to-sequence task and fine-tune the pre-trained model (PLM) to generate the target text from the linearized knowledge graph. However, the linearization of knowledge graphs and the structure of PLMs lead t…

2024

Learning Low-dimensional Multi-domain Knowledge Graph Embedding via Dual Archimedean Spirals

ACL 2024findings

Knowledge graph embedding (KGE) is extensively employed for link prediction by representing entities and relations as low-dimensional vectors. In real-world scenarios, knowledge graphs (KGs) usually encompass diverse domains, which poses challenges to KG representations. However, existing KGE method…

Cited by 0SourcePDFScholar
2024

Lˆ2GC:Lorentzian Linear Graph Convolutional Networks for Node Classification

COLING 2024main

Linear Graph Convolutional Networks (GCNs) are used to classify the node in the graph data. However, we note that most existing linear GCN models perform neural network operations in Euclidean space, which do not explicitly capture the tree-like hierarchical structure exhibited in real-world dataset…

2024

TransERR: Translation-based Knowledge Graph Embedding via Efficient Relation Rotation

COLING 2024main

This paper presents a translation-based knowledge geraph embedding method via efficient relation rotation (TransERR), a straightforward yet effective alternative to traditional translation-based knowledge graph embedding models. Different from the previous translation-based models, TransERR encodes…

2023

Exploiting Modality-Invariant Feature for Robust Multimodal Emotion Recognition with Missing Modalities

ICASSP 2023accepted

Multimodal emotion recognition leverages complementary information across modalities to gain performance. However, we cannot guarantee that the data of all modalities are always present in practice. In the studies to predict the missing data across modalities, the inherent difference between heterog…

Cited by 0SourceScholar
2023

How Well Apply Simple MLP to Incomplete Utterance Rewriting?

ACL 2023short

Incomplete utterance rewriting (IUR) aims to restore the incomplete utterance with sufficient context information for comprehension. This paper introduces a simple yet efficient IUR method. Different from prior studies, we first employ only one-layer MLP architecture to mine latent semantic informat…

2023

TeAST: Temporal Knowledge Graph Embedding via Archimedean Spiral Timeline

ACL 2023long

Temporal knowledge graph embedding (TKGE) models are commonly utilized to infer the missing facts and facilitate reasoning and decision-making in temporal knowledge graph based systems. However, existing methods fuse temporal information into entities, potentially leading to the evolution of entity…

2022

Alignment-Learning Based Single-Step Decoding for Accurate and Fast Non-Autoregressive Speech Recognition

ICASSP 2022accepted

Non-autoregressive transformer (NAT) based speech recognition models have gained more and more attention since they perform faster inference speed compared with autoregressive counterparts, especially when the single-step decoding is applied. However, the single-step decoding process with length pre…

Cited by 0SourceScholar
2021

Joint Alignment Learning-Attention Based Model for Grapheme-to-Phoneme Conversion

ICASSP 2021accepted

Sequence-to-sequence attention-based models for grapheme-to-phoneme (G2P) conversion have gained significant interests. The attention-based encoder-decoder framework learns the mapping of input to output tokens by selectively focusing on relevant information, and has been shown well performance. How…

Cited by 0SourceScholar
2020

Incorporating Inner-word and Out-word Features for Mongolian Morphological Segmentation

COLING 2020main

Mongolian morphological segmentation is regarded as a crucial preprocessing step in many Mongolian related NLP applications and has received extensive attention. Recently, end-to-end segmentation approaches with long short-term memory networks (LSTM) have achieved excellent results. However, the inn…

Cited by 1SourcePDFScholar
2020

Teacher-Student Training For Robust Tacotron-Based TTS

ICASSP 2020accepted

While neural end-to-end text-to-speech (TTS) is superior to conventional statistical methods in many ways, the exposure bias problem in the autoregressive models remains an issue to be resolved. The exposure bias problem arises from the mismatch between the training and inference process, that resul…

Cited by 0SourceScholar
2018

Training Supervised Speech Separation System to Improve STOI and PESQ Directly

ICASSP 2018accepted

Supervised speech separation methods train learning machine to cast the noisy speech to the target clean speech. Most of them use mean-square error (MSE) as loss function. However, MSE is not the perfect choice because it doesn't match the human auditory perception. Short-time objective intelligibil…

Cited by 0SourceScholar
2015

A pairwise algorithm for pitch estimation and speech separation using deep stacking network

ICASSP 2015accepted

Pitch information is an important cue for speech separation. However, pitch estimation in noisy condition is also a task as challenging as speech separation. In this paper, we propose a supervised learning architecture which combines these two problems concisely. The proposed algorithm is based on d…

Cited by 0SourceScholar