Likang Xiao
2026
Enhancing Multilingual Reasoning via Steerable Model Merging
Zhuoran Li | Rui Xu | Jian Yang | Junnan Liu | Zhijun Chen | Qianren Mao | Hongcheng Guo | Jiaheng Liu | Likang Xiao | Ming LI | Xiaojie Wang
Findings of the Association for Computational Linguistics: ACL 2026
Zhuoran Li | Rui Xu | Jian Yang | Junnan Liu | Zhijun Chen | Qianren Mao | Hongcheng Guo | Jiaheng Liu | Likang Xiao | Ming LI | Xiaojie Wang
Findings of the Association for Computational Linguistics: ACL 2026
Model merging is an effective technique for composing the capabilities of a multilingual model and a reasoning model. It has achieved promising generalization in multilingual reasoning tasks by aligning feature spaces of different models. However, the merged single model often fails to address the conflicts between source models, leading to suboptimal performance. In other words, the one-size-fits-all merging strategy may not align with the characteristics of different inputs which may require prioritizing certain models over others. To this end, we propose a Steerable Model Merging (**ST-Merge**) framework to modulate the contribution of each source model. To realize this idea, we introduce a gated cross-attention mechanism to weight or filter the two attended source models in an adaptive manner. Extensive experiments demonstrate that ST-Merge consistently outperforms multiple strong baselines on four multilingual reasoning benchmarks across 21 different languages.
2023
Tucker Decomposition with Frequency Attention for Temporal Knowledge Graph Completion
Likang Xiao | Richong Zhang | Zijie Chen | Junfan Chen
Findings of the Association for Computational Linguistics: ACL 2023
Likang Xiao | Richong Zhang | Zijie Chen | Junfan Chen
Findings of the Association for Computational Linguistics: ACL 2023
Temporal Knowledge Graph Completion aims to complete missing entities or relations under temporal constraints. Previous tensor decomposition-based models for TKGC only independently consider the combination of one single relation with one single timestamp, ignoring the global nature of the embedding. We propose a Frequency Attention (FA) model to capture the global temporal dependencies between one relation and the entire timestamp. Specifically, we use Discrete Cosine Transform (DCT) to capture the frequency of the timestamp embedding and further compute the frequency attention weight to scale embedding. Meanwhile, the previous temporal tucker decomposition method uses a simple norm regularization to constrain the core tensor, which limits the optimization performance. Thus, we propose Orthogonal Regularization (OR) variants for the core tensor, which can limit the non-superdiagonal elements of the 3-rd core tensor. Experiments on three standard TKGC datasets demonstrate that our method outperforms the state-of-the-art results on several metrics. The results suggest that the direct-current component is not the best feature for TKG representation learning. Additional analysis shows the effectiveness of our FA and OR models, even with smaller embedding dimensions.