EDBT 2026 Demo / reviewers in the wild / expert
Jun Ma 0015
dblp:91/4845-15
· DBLP profile ↗
13ranked-venue papers in the field
1as first author
11since 2021 · last 2026
0000-0003-2258-0854ORCID · conflict
Domains — venue-derived; a paper can count in several
Database Systems & Data Management · 7 (1 first)Data Mining & Knowledge Discovery · 3Information Retrieval & Web Search · 2Other / Interdisciplinary · 1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | EMSEdit: Efficient Multi-Step Meta-Learning-based Model EditingabstractLarge Language Models (LLMs) power numerous AI applications, yet updating their knowledge remains costly. Model editing provides a lightweight alternative through targeted parameter modifications, with meta-learning-based model editing (MLME) demonstrating strong effectiveness and efficiency. However, we find that MLME struggles in low-data regimes and incurs high training costs due to the use of KL divergence. To address these issues, we propose $\textbf{E}$fficient $\textbf{M}$ulti-$\textbf{S}$tep $\textbf{Edit (EMSEdit)}$, which leverages multi-step backpropagation (MSBP) to effectively capture gradient-activation mapping patterns within editing samples, performs multi-step edits per sample to enhance editing performance under limited data, and introduces norm-based regularization to preserve unedited knowledge while improving training efficiency. Experiments on two datasets and three LLMs show that EMSEdit consistently outperforms state-of-the-art methods in both sequential and batch editing. Moreover, MSBP can be seamlessly integrated into existing approaches to yield additional performance gains. Further experiments on a multi-hop reasoning editing task demonstrate EMSEdit's robustness in handling complex edits, while ablation studies validate the contribution of each design component. Our code is available at https://github.com/xpq-tech/emsedit. Xiaopeng Li 0006, Shasha Li 0001, Xi Wang 0018, Shezheng Song, Bin Ji 0002, Shangwen Wang, Jun Ma 0015, Xiaodong Liu 0004, Mina Liu, Jie Yu 0008 |
WWW | 7 |
| 2026 | Emp: enhance memory in data pruning
Jinying Xiao, Ping Li 0034, Jie Nie, Bin Ji 0002, Shasha Li 0001, Xiaodong Liu 0004, Jun Ma 0015, Qingbo Wu 0003, Jie Yu 0008 |
Data Min. Knowl. Discov. | 7 |
| 2026 | SEAttack: A self-evolving jailbreak attack to induce toxic responses for non-toxic queries in large language models
Huijun Liu 0003, Shasha Li 0001, Bin Ji 0002, Xiaohu Du, Xiaopeng Li 0006, Jun Ma 0015, Jie Yu 0008 |
Inf. Process. Manag. | 6 |
| 2025 | Cross-Modal Reasoning-Based Unsupervised Multi-modal Entity Linking
Yongtao Tang, Shasha Li 0001, Jun Ma 0015, Bin Ji 0002, Xiaodong Liu 0004, Jie Yu 0008 |
DASFAA (3) | 3 |
| 2025 | Identifying Knowledge Editing Types in Large Language ModelsabstractWarning: This paper contains examples of toxic text. Knowledge editing has emerged as an efficient technique for updating the knowledge of large language models (LLMs), attracting increasing attention in recent years. However, there is a lack of effective measures to prevent the malicious misuse of this technique, which could lead to harmful edits in LLMs. These malicious modifications could cause LLMs to generate toxic content, misleading users into inappropriate actions. In front of this risk, we introduce a new task, Knowledge Editing Type Identification (KETI), aimed at identifying different types of edits in LLMs, thereby providing timely alerts to users when encountering illicit edits. As part of this task, we propose KETIBench, which includes five types of harmful edits covering the most popular toxic types, as well as one benign factual edit. We develop five classical classification models and three BERT-based models as baseline identifiers for both open-source and closed-source LLMs. Our experimental results, across 92 trials involving four models and three knowledge editing methods, demonstrate that all eight baseline identifiers achieve decent identification performance, highlighting the feasibility of identifying malicious edits in LLMs. Additional analyses reveal that the performance of the identifiers is independent of the reliability of the knowledge editing methods and exhibits cross-domain generalization, enabling the identification of edits from unknown sources. All data and code are available in https://github.com/xpq-tech/KETI. Xiaopeng Li 0006, Shasha Li 0001, Shangwen Wang, Shezheng Song, Bin Ji 0002, Huijun Liu 0003, Jun Ma 0015, Jie Yu 0008 |
KDD (2) | 7 |
| 2025 | Win-Win Cooperation: Bundling Sequence and Span Models for Named Entity RecognitionabstractFor Named Entity Recognition (NER), sequence labeling-based and span-based paradigms are quite different. Previous studies have demonstrated the clear complementary advantages of the two paradigms, but few models have tried to incorporate them into a single NER model as far as we know. In our previous work, we proposed a paradigm called Bundling Learning (BL) to explore the above issue, which bundles the two NER paradigms, enabling NER models to jointly tune their parameters by weighted summing each paradigm's training loss. However, three critical issues remain unresolved: When does BL work? Why does BL work? Can BL enhance existing state-of-the-art NER models? To address the first two issues, we design three NER models: a sequence labeling-based model – SeqNER, a span-based NER model – SpanNER, and BL-NER which bundles SeqNER and SpanNER. We draw two conclusions regarding the two issues based on the experimental results on eleven NER datasets. To investigate the third issue, we apply BL to five existing state-of-the-art NER models, including three sequence labeling-based and two span-based models. Experimental results indicate consistent NER performance gains, suggesting a feasible way to construct new state-of-the-art NER systems by applying BL to the current state-of-the-art systems. Moreover, investigation results show that BL reduces both entity boundary and type prediction errors. In addition, we compare two commonly used label tagging methods and three types of span semantic representations. Bin Ji 0002, Huijun Liu 0003, Shasha Li 0001, Jun Ma 0015, Jie Yu 0008 |
IEEE Trans. Knowl. Data Eng. | 4 |
| 2025 | How to Bridge the Gap Between Modalities: Survey on Multimodal Large Language ModelabstractWe explore Multimodal Large Language Models (MLLMs), which integrate LLMs like GPT-4 to handle multimodal data, including text, images, audio, and more. MLLMs demonstrate capabilities such as generating image captions and answering image-based questions, bridging the gap towards real-world human-computer interactions and hinting at a potential pathway to artificial general intelligence. However, MLLMs still face challenges in addressing the semantic gap in multimodal data, which may lead to erroneous outputs, posing potential risks to society. Selecting the appropriate modality alignment method is crucial, as improper methods might require more parameters without significant performance improvements. This paper aims to explore modality alignment methods for LLMs and their current capabilities. Implementing effective modality alignment can help LLMs address environmental issues and enhance accessibility. The study surveys existing modality alignment methods for MLLMs, categorizing them into four groups: (1) Multimodal Converter, which transforms data into a format that LLMs can understand; (2) Multimodal Perceiver, which improves how LLMs percieve different types of data; (3) Tool Learning, which leverages external tools to convert data into a common format, usually text; and (4) Data-Driven Method, which teaches LLMs to understand specific data types within datasets. Shezheng Song, Xiaopeng Li 0006, Shasha Li 0001, Shan Zhao 0002, Jie Yu 0008, Jun Ma 0015, Xiaoguang Mao, Meng Wang 0001 |
IEEE Trans. Knowl. Data Eng. | 6 |
| 2024 | A More Context-Aware Approach for Textual Adversarial Attacks Using Probability Difference-Guided Beam SearchabstractTextual adversarial attacks expose the vulnerabilities of text classifiers and can be used to improve their robustness. Previous context-aware attack models suffer from several limitations. They generally rely on out-of-date substitutes, solely consider the gold label probability, and use the greedy search when generating adversarial examples, often limiting the attack efficiency. To tackle these issues, we proposeMC-PDBS, aMoreContext-aware textual adversarial attack model usingProbabilityDifference-guidedBeamSearch. MC-PDBS generates substitutes using the newest perturbed text sequences in each attack iteration, enabling the generation of more context-aware adversarial examples. The probability difference is an overall consideration of the probabilities of all class labels, which is more effective than the gold label probability in guiding the selection of attack paths. In addition, the beam search enables MC-PDBS to search attack paths from multiple search channels, thereby avoiding the limited search space problem. Extensive experiments and human evaluation demonstrate that MC-PDBS outperforms previous best models in a series of evaluation metrics, particularly bringing up to a +19.5% attack success rate. Extensive analyses further confirm the effectiveness of MC-PDBS. Huijun Liu 0003, Bin Ji 0002, Jie Yu 0008, Shasha Li 0001, Jun Ma 0015, Zibo Yi, Mengxue Du, Miaomiao Li 0001, Jie Liu 0002, Zeyao Mo |
IEEE Trans. Knowl. Data Eng. | 5 |
| 2023 | Dynamic Multi-View Fusion Mechanism for Chinese Relation ExtractionabstractAbstract Recently, many studies incorporate external knowledge into character-level feature based models to improve the performance of Chinese relation extraction. However, these methods tend to ignore the internal information of the Chinese character and cannot filter out the noisy information of external knowledge. To address these issues, we propose a mixture-of-view-experts framework (MoVE) to dynamically learn multi-view features for Chinese relation extraction. With both the internal and external knowledge of Chinese characters, our framework can better capture the semantic information of Chinese characters. To demonstrate the effectiveness of the proposed framework, we conduct extensive experiments on three real-world datasets in distinct domains. Experimental results show consistent and significant superiority and robustness of our proposed framework. Our code and dataset will be released at: https://gitee.com/tmg-nudt/multi-view-of-expert-for-chinese-relation-extraction Bin Ji 0002, Shasha Li 0001, Jun Ma 0015, Long Peng 0002, Jie Yu 0008 |
PAKDD (1) | 4 |
| 2023 | When Database Meets New Storage Devices: Understanding and Exposing Performance Mismatches via ConfigurationsabstractNVMe SSD hugely boosts the I/O speed, with up to GB/s throughput and microsecond-level latency. Unfortunately, DBMS users can often find their high-performanced storage devices tend to deliver less-than-expected or even worse performance when compared to their traditional peers. While many works focus on proposing new DBMS designs to fully exploit NVMe SSDs, few systematically study the symptoms, root causes and possible detection methods of such performance mismatches on existing databases. In this paper, we start with an empirical study where we systematically expose and analyze the performance mismatches on six popular databases via controlled configuration tuning. From the study, we find that all six databases can suffer from performance mismatches. Moreover, we conclude that the root causes can be categorized as databases' unawareness of new storage devices characteristics in I/O size, I/O parallelism and I/O sequentiality. We report 17 mismatches to developers and 15 are confirmed. Additionally, we realize testing all configuration knobs yields low efficiency. Therefore, we propose a fast performance mismatch detection framework and evaluation shows that our framework brings two orders of magnitude speedup than baseline without sacrificing effectiveness. Haochen He, Erci Xu, Shanshan Li 0001, Zhouyang Jia, Si Zheng 0003, Yue Yu 0001, Jun Ma 0015, Xiangke Liao |
Proc. VLDB Endow. | 7 |
| 2022 | Textual adversarial attacks by exchanging text-self wordsabstractAdversarial attacks expose the vulnerability of deep neural networks. Compared to image adversarial attacks, textual adversarial attacks are more challenging due to the discrete nature of texts. Recent synonym-based methods achieve the current state-of-the-art results. However, these methods introduce new words against the original text, leading to that humans easily perceive the difference between the adversarial example and the original text. Motivated by the fact that humans are usually unaware of chaotic word order in some cases, we propose exchange-attack (EA), a concise and effective word-level textual adversarial attack model. Specifically, the EA model generates adversarial examples by exchanging words of the original text itself according to the contributions that these words make regarding classification results. Intuitively, the smaller the distance between the two exchanged words, the more difficult the chaotic word order to be perceived by humans. We thus take the word distance into consideration when generating the chaotic word orders. Extensive experiments on several text classification data sets show that the EA model consistently outperforms the selected baselines in terms of averaged after-attack accuracy, modification rate, query number, and semantic similarity. And human evaluation results reveal that humans difficultly perceive the adversarial examples generated by the EA model. In addition, quantitative and qualitative analyses further validate the effectiveness of the EA model, including that the generated adversarial examples are grammatically correct and semantically preserved. Huijun Liu 0003, Jie Yu 0008, Jun Ma 0015, Shasha Li 0001, Bin Ji 0002, Zibo Yi, Miaomiao Li 0001, Long Peng 0002, Xiaodong Liu 0004 |
Int. J. Intell. Syst. | 3 |
| 2016 | ERPC: An Edge-Resources Based Framework to Reduce Bandwidth Cost in the Personal Cloud
Shaoduo Gan, Jie Yu 0008, Xiaoling Li 0002, Jun Ma 0015, Lei Luo 0002, Qingbo Wu 0003, Shasha Li 0001 |
WAIM (2) | 4 |
| 2008 | Research of a Secure File System for Protection of Intellectual Property RightabstractThis paper analyses the architecture of current secure file system and the security needs for protection of intellectual property rights and especially the major problems of it. Then we propose a secure data container model based on data encapsulation from the realization concept of virtual file system (VFS) in Linux. Based on this model, we design and implant a secure file system IPR-SFS on Windows platform for protection of intellectual property which achieves perfect combination between data encryption and access control. Compared with the previous systems, the IPR-SFS file system is more convenient and flexible, safe and scalable, also comparable to the existing file. Jun Ma 0015, Jiangchun Ren, Zhiying Wang 0003, Yaokai Zhu |
WAIM | 1 |