Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Keyi Kong

dblp:359/3282 · DBLP profile ↗
← Back
6ranked-venue papers
1as first author
6since 2021 · last 2025
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 6 · 1 first-author · 6 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 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
Language models and text generation · 25% Trustworthy machine learning · 21% Vision and language · 14%
Network and information security
1 paper
Security and privacy of machine learning · 100%

Topics — the 16 heaviest of 19, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Natural language and speech › Speech recognition and synthesis
audio-language model
0.912025
SoundMind: RL-Incentivized Logic Reasoning for Audio-Language Models · EMNLP 2025
Computer vision › Vision and language › visual question answering
explainable visual question answering
0.912025
ProtoVQA: An Adaptable Prototypical Framework for Explainable Fine-Grained Visual Question Answering · EMNLP 2025
Machine learning › Trustworthy machine learning
interpretability
0.912025
ProtoVQA: An Adaptable Prototypical Framework for Explainable Fine-Grained Visual Question Answering · EMNLP 2025
Natural language and speech › Language models and text generation
multimodal language model
0.912025
SoundMind: RL-Incentivized Logic Reasoning for Audio-Language Models · EMNLP 2025
Machine learning › Trustworthy machine learning › interpretability › example-based explanation
prototype-based explanation
0.912025
ProtoVQA: An Adaptable Prototypical Framework for Explainable Fine-Grained Visual Question Answering · EMNLP 2025
Machine learning › Reinforcement learning
reinforcement learning for reasoning
0.912025
SoundMind: RL-Incentivized Logic Reasoning for Audio-Language Models · EMNLP 2025
Computer vision › Vision and language
visual question answering
0.912025
ProtoVQA: An Adaptable Prototypical Framework for Explainable Fine-Grained Visual Question Answering · EMNLP 2025
Natural language and speech › Language models and text generation
alignment
0.812024
Perplexity-aware Correction for Robust Alignment with Noisy Preferences · NeurIPS 2024
Machine learning › Trustworthy machine learning
robustness
0.812024
Perplexity-aware Correction for Robust Alignment with Noisy Preferences · NeurIPS 2024
Security and privacy of machine learning
adversarial attack
0.812024
An LLM can Fool Itself: A Prompt-Based Adversarial Attack · ICLR 2024
Security and privacy of machine learning › adversarial robustness
adversarial robustness evaluation
0.812024
An LLM can Fool Itself: A Prompt-Based Adversarial Attack · ICLR 2024
Security and privacy of machine learning › large language model security
large language model robustness
0.812024
An LLM can Fool Itself: A Prompt-Based Adversarial Attack · ICLR 2024
Knowledge, reasoning and agents › Knowledge representation and reasoning › normative reasoning
legal reasoning
0.712023
Syllogistic Reasoning for Legal Judgment Analysis · EMNLP 2023
Knowledge, reasoning and agents › Knowledge representation and reasoning › logic-based reasoning › deductive reasoning
syllogistic reasoning
0.712023
Syllogistic Reasoning for Legal Judgment Analysis · EMNLP 2023
Natural language and speech › Language models and text generation
large language model
0.312025
Generative Agents for Multimodal Controversy Detection · IJCAI 2025
Natural language and speech › Language models and text generation
large language model safety
0.212024
An LLM can Fool Itself: A Prompt-Based Adversarial Attack · ICLR 2024

Methods — techniques the papers use, named apart from their topics

prompt engineering · 1.5adversarial example ensembling · 1.5reinforcement learning · 0.9prototypical network · 0.9multi-agent simulation · 0.9large language model · 0.9surrogate model · 0.8supervised fine-tuning · 0.8perplexity difference · 0.8large language model benchmarking · 0.7
YearPublicationVenuePosition
2025 ProtoVQA: An Adaptable Prototypical Framework for Explainable Fine-Grained Visual Question Answering
abstract
Visual Question Answering (VQA) is increasingly used in diverse applications ranging from general visual reasoning to safety-critical domains such as medical imaging and autonomous systems, where models must provide not only accurate answers but also explanations that humans can easily understand and verify.Prototype-based modeling has shown promise for interpretability by grounding predictions in semantically meaningful regions for purely visual reasoning tasks, yet remains underexplored in the context of VQA.We present ProtoVQA, a unified prototypical framework that (i) learns question-aware prototypes that serve as reasoning anchors, connecting answers to discriminative image regions, (ii) applies spatially constrained matching to ensure that the selected evidence is coherent and semantically relevant, and (iii) supports both answering and grounding tasks through a shared prototype backbone.To assess explanation quality, we propose the Visual-Linguistic Alignment Score (VLAS), which measures how well the model's attended regions align with ground-truth evidence.Experiments on Visual7W show that ProtoVQA yields faithful, fine-grained explanations while maintaining competitive accuracy, advancing the development of transparent and trustworthy VQA systems.
Xingjian Diao, Weiyi Wu, Keyi Kong, Peijun Qing, Xinwen Xu, Ming Cheng 0004, Soroush Vosoughi, Jiang Gui
EMNLP3
2025 SoundMind: RL-Incentivized Logic Reasoning for Audio-Language Models
abstract
Xingjian Diao, Chunhui Zhang, Keyi Kong, Weiyi Wu, Chiyu Ma, Zhongyu Ouyang, Peijun Qing, Soroush Vosoughi, Jiang Gui. Proceedings of the 2025 Conference on Empirical Methods in Natural Language Processing. 2025.
Xingjian Diao, Keyi Kong, Weiyi Wu, Chiyu Ma, Zhongyu Ouyang, Peijun Qing, Soroush Vosoughi, Jiang Gui
EMNLP3
2025 Generative Agents for Multimodal Controversy Detection
abstract
Multimodal controversy detection, which involves determining whether a given video and its associated comments are controversial, plays a pivotal role in risk management on social video platforms. Existing methods typically provide only classification results, failing to identify what aspects are controversial and why, thereby lacking detailed explanations. To address this limitation, we propose a novel Agent-based Multimodal Controversy Detection architecture, termed AgentMCD. This architecture leverages Large Language Models (LLMs) as generative agents to simulate human behavior and improve explainability. AgentMCD employs a multi-aspect reasoning process, where multiple judges conduct evaluations from diverse perspectives to derive a final decision. Furthermore, a multi-agent simulation process is incorporated, wherein agents act as audiences, offering opinions and engaging in free discussions after watching videos. This hybrid framework enables comprehensive controversy evaluation and significantly enhances explainability. Experiments conducted on the MMCD dataset demonstrate that our proposed architecture outperforms existing LLM-based baselines in both high-resource and low-resource comment scenarios, while maintaining superior explainability.
Tianjiao Xu, Jinfei Gao, Keyi Kong, Jianhua Yin 0001, Tian Gan 0002, Liqiang Nie
IJCAI3
2024 An LLM can Fool Itself: A Prompt-Based Adversarial Attack
abstract
The wide-ranging applications of large language models (LLMs), especially in safety-critical domains, necessitate the proper evaluation of the LLM’s adversarial robustness. This paper proposes an efficient tool to audit the LLM’s adversarial robustness via a prompt-based adversarial attack (PromptAttack). PromptAttack converts adversarial textual attacks into an attack prompt that can cause the victim LLM to output the adversarial sample to fool itself. The attack prompt is composed of three important components: (1) original input (OI) including the original sample and its ground-truth label, (2) attack objective (AO) illustrating a task description of generating a new sample that can fool itself without changing the semantic meaning, and (3) attack guidance (AG) containing the perturbation instructions to guide the LLM on how to complete the task by perturbing the original sample at character, word, and sentence levels, respectively. Besides, we use a fidelity filter to ensure that PromptAttack maintains the original semantic meanings of the adversarial examples. Further, we enhance the attack power of PromptAttack by ensembling adversarial examples at different perturbation levels. Comprehensive empirical results using Llama2 and GPT-3.5 validate that PromptAttack consistently yields a much higher attack success rate compared to AdvGLUE and AdvGLUE++. Interesting findings include that a simple emoji can easily mislead GPT-3.5 to make wrong predictions. Our source code is available at https://github.com/GodXuxilie/PromptAttack.
Xilie Xu, Keyi Kong, Ning Liu 0014, Li-Zhen Cui 0001, Di Wang 0015, Jingfeng Zhang, Mohan Kankanhalli
ICLR2
2024 Perplexity-aware Correction for Robust Alignment with Noisy Preferences
abstract
Alignment techniques are critical in ensuring that large language models (LLMs) output helpful and harmless content by enforcing the LLM-generated content to align with human preferences. However, the existence of noisy preferences (NPs), where the responses are mistakenly labelled as chosen or rejected, could spoil the alignment, thus making the LLMs generate useless and even malicious content. Existing methods mitigate the issue of NPs from the loss perspective by adjusting the alignment loss based on a clean validation dataset. Orthogonal to these loss-oriented methods, we propose perplexity-aware correction (PerpCorrect) from the data perspective for robust alignment which detects and corrects NPs based on the differences between the perplexity of the chosen and rejected responses (dubbed as PPLDiff). Intuitively, a higher PPLDiff indicates a higher probability of the NP because a rejected/chosen response which is mistakenly labelled as chosen/rejected is less preferable to be generated by an aligned LLM, thus having a higher/lower perplexity. PerpCorrect works in three steps: (1) PerpCorrect aligns a surrogate LLM using the clean validation data to make the PPLDiff able to distinguish clean preferences (CPs) and NPs. (2) PerpCorrect further aligns the surrogate LLM by incorporating the reliable clean training data whose PPLDiff is extremely small and reliable noisy training data whose PPLDiff is extremely large after correction to boost the discriminatory power. (3) Detecting and correcting NPs according to the PPLDiff obtained by the aligned surrogate LLM to obtain a denoised training dataset for robust alignment. Comprehensive experiments validate that our proposed PerpCorrect can achieve state-of-the-art alignment performance under NPs. Notably, PerpCorrect demonstrates practical utility by requiring only a modest amount of validation data and being compatible with various alignment techniques. Our code is available at [PerpCorrect](https://github.com/luxinyayaya/PerpCorrect).
Keyi Kong, Xilie Xu, Di Wang 0015, Jingfeng Zhang, Mohan Kankanhalli
NeurIPS1
2023 Syllogistic Reasoning for Legal Judgment Analysis
abstract
Legal judgment assistants are developing fast due to impressive progress of large language models (LLMs).However, people can hardly trust the results generated by a model without reliable analysis of legal judgement.For legal practitioners, it is common practice to utilize syllogistic reasoning to select and evaluate the arguments of the parties as part of the legal decision-making process.But the development of syllogistic reasoning for legal judgment analysis is hindered by the lack of resources: (1) there is no large-scale syllogistic reasoning dataset for legal judgment analysis, and (2) there is no set of established benchmarks for legal judgment analysis.In this paper, we construct and manually correct a syllogistic reasoning dataset for legal judgment analysis.The dataset contains 11,239 criminal cases which cover 4 criminal elements, 80 charges and 124 articles.We also select a set of large language models as benchmarks, and conduct a in-depth analysis of the capacity of their legal judgment analysis.
Wentao Deng, Jiahuan Pei, Keyi Kong, Furu Wei, Zhaochun Ren, Zhumin Chen, Pengjie Ren
EMNLP3