Demo Data from EDBT 2026 / reviewers in the wild / expert
Dakan Wang
dblp:66/7185
· DBLP profile ↗
5ranked-venue papers
1as first author
3since 2021 · last 2025
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 4 · 1 first-author · 3 since 2021Databases, data management, data science and information retrieval · 2 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 2 · 2 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
3 papers |
Language models and text generation · 39% Trustworthy machine learning · 19% Vision and language · 13% | |
| Databases, data mining, and information retrieval
2 papers |
Information retrieval · 70% Web and social media mining · 30% |
Topics — the 13 heaviest of 13, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Natural language and speech › Language models and text generation
knowledge editing |
1.7 | 2 | 2025 | Lifelong Knowledge Editing for Vision Language Models with Low-Rank Mixture-of-Experts · CVPR 2025 Attribution Analysis Meets Model Editing: Advancing Knowledge Correction in Vision Language Models with VisEdit · AAAI 2025 |
Computer vision › Vision and language
vision-language model |
1.1 | 2 | 2025 | Attribution Analysis Meets Model Editing: Advancing Knowledge Correction in Vision Language Models with VisEdit · AAAI 2025 Lifelong Knowledge Editing for Vision Language Models with Low-Rank Mixture-of-Experts · CVPR 2025 |
Machine learning › Trustworthy machine learning › interpretability
attribution methods |
0.9 | 1 | 2025 | Attribution Analysis Meets Model Editing: Advancing Knowledge Correction in Vision Language Models with VisEdit · AAAI 2025 |
Machine learning › Trustworthy machine learning
interpretability |
0.9 | 1 | 2025 | Attribution Analysis Meets Model Editing: Advancing Knowledge Correction in Vision Language Models with VisEdit · AAAI 2025 |
Knowledge, reasoning and agents › Knowledge representation and reasoning
knowledge graph |
0.9 | 1 | 2025 | UniEdit: A Unified Knowledge Editing Benchmark for Large Language Models · NeurIPS 2025 |
Natural language and speech › Language models and text generation › knowledge editing
large language model knowledge editing |
0.9 | 1 | 2025 | UniEdit: A Unified Knowledge Editing Benchmark for Large Language Models · NeurIPS 2025 |
Natural language and speech › Language models and text generation › knowledge editing
lifelong model editing |
0.9 | 1 | 2025 | Lifelong Knowledge Editing for Vision Language Models with Low-Rank Mixture-of-Experts · CVPR 2025 |
Machine learning › Deep learning architectures and training › mixture of experts
mixture-of-experts adaptation |
0.9 | 1 | 2025 | Lifelong Knowledge Editing for Vision Language Models with Low-Rank Mixture-of-Experts · CVPR 2025 |
Machine learning › Efficient and distributed learning
parameter-efficient fine-tuning |
0.9 | 1 | 2025 | Lifelong Knowledge Editing for Vision Language Models with Low-Rank Mixture-of-Experts · CVPR 2025 |
Web and social media mining › user behavior analysis
user behavior modeling |
0.1 | 1 | 2011 | Action prediction and identification from mining temporal user behaviors · WSDM 2011 |
Information retrieval › ranking › content ranking
ad ranking |
0.1 | 1 | 2009 | Optimizing search engine revenue in sponsored search · SIGIR 2009 |
Information retrieval › online advertising
revenue optimization |
0.1 | 1 | 2009 | Optimizing search engine revenue in sponsored search · SIGIR 2009 |
Information retrieval › online advertising
sponsored search |
0.1 | 1 | 2009 | Optimizing search engine revenue in sponsored search · SIGIR 2009 |
Methods — techniques the papers use, named apart from their topics
soft routing · 0.9noise perturbation · 0.9neighborhood multi-hop chain sampling · 0.9mixture of experts · 0.9low-rank adaptation · 0.9knowledge editing · 0.9hard filtering · 0.9contribution allocation · 0.9LLM-based text generation · 0.9ensemble learning · 0.1ranking function learning · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Attribution Analysis Meets Model Editing: Advancing Knowledge Correction in Vision Language Models with VisEditabstractModel editing aims to correct outdated or erroneous knowledge in large models without costly retraining. Recent research discovered that the mid-layer representation of the subject's final token in a prompt has a strong influence on factual predictions, and developed Large Language Model (LLM) editing techniques based on this observation. However, for Vision-LLMs (VLLMs), how visual representations impact the predictions from a decoder-only language model remains largely unexplored. To the best of our knowledge, model editing for VLLMs has not been extensively studied in the literature. In this work, we employ the contribution allocation and noise perturbation methods to measure the contributions of visual representations for token predictions. Our attribution analysis shows that visual representations in mid-to-later layers that are highly relevant to the prompt contribute significantly to predictions. Based on these insights, we propose *VisEdit*, a novel model editor for VLLMs that effectively corrects knowledge by editing intermediate visual representations in regions important to the edit prompt. We evaluated *VisEdit* using multiple VLLM backbones and public VLLM editing benchmark datasets. The results show the superiority of *VisEdit* over the strong baselines adapted from existing state-of-the-art editors for LLMs. Qizhou Chen, Taolin Zhang 0001, Chengyu Wang 0001, Dakan Wang |
AAAI | 5 |
| 2025 | Lifelong Knowledge Editing for Vision Language Models with Low-Rank Mixture-of-ExpertsabstractModel editing aims to correct inaccurate knowledge, update outdated information, and incorporate new data into Large Language Models (LLMs) without the need for retraining. This task poses challenges in lifelong scenarios where edits must be continuously applied for real-world applications. While some editors demonstrate strong robustness for lifelong editing in pure LLMs, Vision LLMs (VLLMs), which incorporate an additional vision modality, are not directly adaptable to existing LLM editors. In this paper, we propose LiveEdit, a Lifelong vision language model Edit to bridge the gap between lifelong LLM editing and VLLMs. We begin by training an editing expert generator to independently produce low-rank experts for each editing instance, with the goal of correcting the relevant responses of the VLLM. A hard filtering mechanism is developed to utilize visual semantic knowledge, thereby coarsely eliminating visually irrelevant experts for input queries during the inference stage of the post-edited model. Finally, to integrate visually relevant experts, we introduce a soft routing mechanism based on textual semantic relevance to achieve multi-expert fusion. For evaluation, we establish a benchmark for lifelong VLLM editing. Extensive experiments demonstrate that LiveEdit offers significant advantages in lifelong VLLM editing scenarios. Further experiments validate the rationality and effectiveness of each module design in LiveEdit.1 Qizhou Chen, Chengyu Wang 0001, Dakan Wang, Taolin Zhang 0001, Wangyue Li |
CVPR | 3 |
| 2025 | UniEdit: A Unified Knowledge Editing Benchmark for Large Language ModelsabstractModel editing aims to efficiently revise incorrect or outdated knowledge within LLMs without incurring the high cost of full retraining and risking catastrophic forgetting. Currently, most LLM editing datasets are confined to narrow knowledge domains and cover a limited range of editing evaluation. They often overlook the broad scope of editing demands and the diversity of ripple effects resulting from edits. In this context, we introduce \uniedit, a unified benchmark for LLM editing grounded in open-domain knowledge. First, we construct editing samples by selecting entities from 25 common domains across five major categories, utilizing the extensive triple knowledge available in open-domain knowledge graphs to ensure comprehensive coverage of the knowledge domains. To address the issues of generality and locality in editing, we design an Neighborhood Multi-hop Chain Sampling (NMCS) algorithm to sample subgraphs based on a given knowledge piece to entail comprehensive ripple effects to evaluate. Finally, we employ proprietary LLMs to convert the sampled knowledge subgraphs into natural language text, guaranteeing grammatical accuracy and syntactical diversity. Extensive statistical analysis confirms the scale, comprehensiveness, and diversity of our \uniedit benchmark. We conduct comprehensive experiments across multiple LLMs and editors, analyzing their performance to highlight strengths and weaknesses in editing across open knowledge domains and various evaluation criteria, thereby offering valuable insights for future research endeavors. Qizhou Chen, Dakan Wang, Taolin Zhang 0001, Zaoming Yan, Chengsong You, Chengyu Wang 0001 |
NeurIPS | 2 |
| 2011 | Action prediction and identification from mining temporal user behaviorsabstractPredicting user's action provides many monetization opportunities to web service providers. If a user's future action can be predicted and identified correctly in time or in advance, we cannot only satisfy user's current need, but also facilitate and simplify user's future online activities. Traditional works on user behavior modeling such as implicit feedback or personalization mainly investigate on users' immediate, short-term or aggregate behaviors. Hence, it is difficult to understand the diversity in temporal user behavior and predict user's future action. In this paper, we consider a forecasting problem of temporal user behavior modeling. Our first objective is able to capture relevant users that will perform an action. The second objective is able to identify whether a user has finished the action, even when the action happened offline. We propose an ensemble algorithm to achieve both objectives. The experiment compares several implementation methods and demonstrates the temporal user behavior modeling using the ensemble algorithm significantly outperforms other methods. Dakan Wang, Gang Wang 0010, Xiaofeng Ke, Weizhu Chen |
WSDM | 1 |
| 2009 | Optimizing search engine revenue in sponsored searchabstractDisplaying sponsored ads alongside the search results is a key monetization strategy for search engine companies. Since users are more likely to click ads that are relevant to their query, it is crucial for search engine to deliver the right ads for the query and the order in which they are displayed. There are several works investigating on how to learn a ranking function to maximize the number of ad clicks. In this paper, we address a new revenue optimization Yunzhang Zhu, Gang Wang 0010, Junli Yang, Dakan Wang, Jun Yan 0001, Jian Hu 0001, Zheng Chen 0001 |
SIGIR | 4 |