Demo Data from EDBT 2026 / reviewers in the wild / expert
Haoyan Liu 0001
dblp:220/4217-1
· DBLP profile ↗
10ranked-venue papers
2as first author
5since 2021 · last 2026
0000-0002-3249-2164ORCID · conflict
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 9 · 2 first-author · 5 since 2021Databases, data management, data science and information retrieval · 2 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 1 first-author · 1 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Artificial intelligence
6 papers |
Information extraction and text analysis · 30% Efficient and distributed learning · 29% Language models and text generation · 14% | |
| Databases, data mining, and information retrieval
4 papers |
Recommender systems · 62% Data models and query languages · 24% Knowledge graphs · 7% |
Topics — the 14 heaviest of 16, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Efficient and distributed learning › parameter-efficient fine-tuning
adapter tuning |
1.0 | 1 | 2026 | Don't Start Over: A Cost-Effective Framework for Migrating Personalized Prompts Between LLMs · AAAI 2026 |
Machine learning › Efficient and distributed learning
parameter-efficient fine-tuning |
1.0 | 1 | 2026 | Don't Start Over: A Cost-Effective Framework for Migrating Personalized Prompts Between LLMs · AAAI 2026 |
Natural language and speech › Language models and text generation › large language model › large language model adaptation
personalization |
1.0 | 1 | 2026 | Don't Start Over: A Cost-Effective Framework for Migrating Personalized Prompts Between LLMs · AAAI 2026 |
Recommender systems › explainable recommendation
reasoning-based recommendation |
1.0 | 1 | 2026 | MGFRec: Towards Reinforced Reasoning Recommendation with Multiple Groundings and Feedback · KDD (1) 2026 |
Natural language and speech › Information extraction and text analysis › event extraction › event argument extraction
document-level event argument extraction |
0.7 | 1 | 2023 | Document-Level Event Argument Extraction With a Chain Reasoning Paradigm · ACL (1) 2023 |
Natural language and speech › Information extraction and text analysis › event extraction
event argument extraction |
0.7 | 1 | 2023 | Document-Level Event Argument Extraction With a Chain Reasoning Paradigm · ACL (1) 2023 |
Natural language and speech › Information extraction and text analysis › event extraction
event detection |
0.7 | 1 | 2023 | Learning with Partial Annotations for Event Detection · ACL (1) 2023 |
Machine learning › Learning paradigms › weakly supervised learning
partial annotation learning |
0.7 | 1 | 2023 | Learning with Partial Annotations for Event Detection · ACL (1) 2023 |
Machine learning › Representation and self-supervised learning › word representation
word representation learning |
0.4 | 1 | 2019 | Leveraging Web Semantic Knowledge in Word Representation Learning · AAAI 2019 |
Data models and query languages › natural language interface › natural language interface to database
text-to-SQL |
0.4 | 1 | 2019 | Leveraging Adjective-Noun Phrasing Knowledge for Comparison Relation Prediction in Text-to-SQL · EMNLP/IJCNLP (1) 2019 |
Machine learning › Representation and self-supervised learning
contrastive learning |
0.2 | 1 | 2023 | Learning with Partial Annotations for Event Detection · ACL (1) 2023 |
Knowledge, reasoning and agents › Knowledge representation and reasoning
logic-based reasoning |
0.2 | 1 | 2023 | Document-Level Event Argument Extraction With a Chain Reasoning Paradigm · ACL (1) 2023 |
Natural language and speech › Information extraction and text analysis
relation extraction |
0.1 | 1 | 2019 | Leveraging Adjective-Noun Phrasing Knowledge for Comparison Relation Prediction in Text-to-SQL · EMNLP/IJCNLP (1) 2019 |
Information retrieval › query understanding
natural language query understanding |
0.1 | 1 | 2019 | A Split-and-Recombine Approach for Follow-up Query Analysis · EMNLP/IJCNLP (1) 2019 |
Methods — techniques the papers use, named apart from their topics
reinforcement learning · 1.0prompt migration · 1.0parameter-efficient adapter · 1.0large language model · 1.0word embeddings · 0.8semantic parsing · 0.8semantic knowledge · 0.8trigger localization · 0.7t-norm fuzzy logic · 0.7neural network · 0.7contrastive learning · 0.7chain reasoning · 0.7sequence labeling · 0.4adjective-noun phrasing knowledge · 0.4
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Don't Start Over: A Cost-Effective Framework for Migrating Personalized Prompts Between LLMsabstractPersonalization in Large Language Models (LLMs) often relies on user-specific soft prompts. However, these prompts become obsolete when the foundation model is upgraded, necessitating costly, full-scale retraining. To overcome this limitation, we propose the Prompt-level User Migration Adapter (PUMA), a lightweight framework to efficiently migrate personalized prompts across incompatible models. PUMA utilizes a parameter-efficient adapter to bridge the semantic gap, combined with a group-based user selection strategy to significantly reduce training costs. Experiments on three large-scale datasets show our method matches or even surpasses the performance of retraining from scratch, reducing computational cost by up to 98%. The framework demonstrates strong generalization across diverse model architectures and robustness in advanced scenarios like chained and aggregated migrations, offering a practical path for the sustainable evolution of personalized AI by decoupling user assets from the underlying models. Chongming Gao, Yang Zhang 0072, Haoyan Liu 0001, Weinan Gan, Huifeng Guo, Yong Liu 0020, Fuli Feng |
AAAI | 4 |
| 2026 | MGFRec: Towards Reinforced Reasoning Recommendation with Multiple Groundings and FeedbackabstractThe powerful reasoning and generative capabilities of large language models (LLMs) have inspired researchers to apply them to reasoning-based recommendation tasks, which require in-depth reasoning about user interests and the generation of recommended items. However, previous reasoning-based recommendation methods have typically performed inference within the language space alone, without incorporating the actual item space. This has led to over-interpreting user interests and deviating from real items. Towards this research gap, we propose performing multiple rounds of grounding during inference to help the LLM better understand the actual item space, which could ensure that its reasoning remains aligned with real items. Furthermore, we introduce a user agent that provides feedback during each grounding step, enabling the LLM to better recognize and adapt to user interests. Comprehensive experiments conducted on three Amazon review datasets demonstrate the effectiveness of incorporating multiple groundings and feedback. These findings underscore the critical importance of reasoning within the actual item space, rather than being confined to the language space, for recommendation tasks. Shihao Cai, Chongming Gao, Haoyan Liu 0001, Wentao Shi 0002, Jianshan Sun, Ruiming Tang, Fuli Feng |
KDD (1) | 3 |
| 2023 | Document-Level Event Argument Extraction With a Chain Reasoning ParadigmabstractDocument-level event argument extraction aims to identify event arguments beyond sentence level, where a significant challenge is to model long-range dependencies.Focusing on this challenge, we present a new chain reasoning paradigm for the task, which can generate decomposable first-order logic rules for reasoning.This paradigm naturally captures long-range interdependence due to the chains' compositional nature, which also improves interpretability by explicitly modeling the reasoning process.We introduce T-norm fuzzy logic for optimization, which permits end-toend learning and shows promise for integrating the expressiveness of logical reasoning with the generalization of neural networks.In experiments, we show that our approach outperforms previous methods by a significant margin on two standard benchmarks (over 6 points in F1).Moreover, it is data-efficient in lowresource scenarios and robust enough to defend against adversarial attacks. Jian Liu 0032, Jin An Xu, Haoyan Liu 0001, Zhe Zhao 0006 |
ACL (1) | 4 |
| 2023 | Learning with Partial Annotations for Event DetectionabstractEvent detection (ED) seeks to discover and classify event instances in plain texts.Previous methods for ED typically adopt supervised learning, requiring fully labeled and high-quality training data.However, in a realworld application, we may not obtain clean training data but only partially labeled one, which could substantially impede the learning process.In this work, we conduct a seminal study for learning with partial annotations for ED.We propose a new trigger localization formulation using contrastive learning to distinguish ground-truth triggers from contexts, showing a decent robustness for addressing partial annotation noise.Impressively, in an extreme scenario where more than 90% of events are unlabeled, our approach achieves an F1 score of over 60%.In addition, we reannotate and make available two fully annotated subsets of ACE 2005 to serve as an unbiased benchmark for event detection.We hope our approach and data will inspire future studies on this vital yet understudied problem. Jian Liu 0032, Dianbo Sui, Kang Liu 0001, Haoyan Liu 0001, Zhe Zhao 0006 |
ACL (1) | 4 |
| 2022 | A Simple and Effective Method to Improve Zero-Shot Cross-Lingual Transfer LearningabstractExisting zero-shot cross-lingual transfer methods rely on parallel corpora or bilingual dictionaries, which are expensive and impractical for low-resource languages. To disengage from these dependencies, researchers have explored training multilingual models on English-only resources and transferring them to low-resource languages. However, its effect is limited by the gap between embedding clusters of different languages. To address this issue, we propose Embedding-Push, Attention-Pull, and Robust targets to transfer English embeddings to virtual multilingual embeddings without semantic loss, thereby improving cross-lingual transferability. Experimental results on mBERT and XLM-R demonstrate that our method significantly outperforms previous works on the zero-shot cross-lingual text classification task and can obtain a better multilingual alignment. Kunbo Ding, Weijie Liu 0002, Yuejian Fang, Weiquan Mao, Zhe Zhao 0006, Haoyan Liu 0001, Rong Tian |
COLING | 7 |
| 2020 | BiGCNN: Bidirectional Gated Convolutional Neural Network for Chinese Named Entity Recognition
Tianyang Zhao 0003, Haoyan Liu 0001, Qianhui Wu, Changzhi Sun, Dongdong Zhang 0001, Zhoujun Li 0001 |
DASFAA (1) | 2 |
| 2020 | LARQ: Learning to Ask and Rewrite Questions for Community Question Answering
Huiyang Zhou, Haoyan Liu 0001, Yunbo Cao, Zhoujun Li 0001 |
NLPCC (2) | 2 |
| 2019 | Leveraging Web Semantic Knowledge in Word Representation Learning
Haoyan Liu 0001, Lei Fang 0004, Jian-Guang Lou, Zhoujun Li 0001 |
AAAI | 1 |
| 2019 | A Split-and-Recombine Approach for Follow-up Query AnalysisabstractQian Liu, Bei Chen, Haoyan Liu, Jian-Guang Lou, Lei Fang, Bin Zhou, Dongmei Zhang. Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing and the 9th International Joint Conference on Natural Language Processing (EMNLP-IJCNLP). 2019. Qian Liu 0033, Bei Chen 0008, Haoyan Liu 0001, Jian-Guang Lou, Lei Fang 0004, Dongmei Zhang 0001 |
EMNLP/IJCNLP (1) | 3 |
| 2019 | Leveraging Adjective-Noun Phrasing Knowledge for Comparison Relation Prediction in Text-to-SQLabstractHaoyan Liu, Lei Fang, Qian Liu, Bei Chen, Jian-Guang Lou, Zhoujun Li. Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing and the 9th International Joint Conference on Natural Language Processing (EMNLP-IJCNLP). 2019. Haoyan Liu 0001, Lei Fang 0004, Qian Liu 0033, Bei Chen 0008, Jian-Guang Lou, Zhoujun Li 0001 |
EMNLP/IJCNLP (1) | 1 |