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

Xiangqi Wang

dblp:190/6584 · DBLP profile ↗
← Back
11ranked-venue papers
3as first author
10since 2021 · last 2026
—ORCID · conflict

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

Artificial intelligence and machine learning · 7 · 3 first-author · 7 since 2021Systems, architecture and hardware · 2 · 1 since 2021Databases, data management, data science and information retrieval · 2 · 1 first-author · 2 since 2021Computer networks · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021Human-computer interaction and ubiquitous computing · 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
5 papers
Language models and text generation · 38% Trustworthy machine learning · 14% Vision and language · 12%
Databases, data mining, and information retrieval
1 paper
Knowledge graphs · 100%
Network and information security
1 paper
Security and privacy of machine learning · 100%

Topics — the 10 heaviest of 12, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Natural language and speech › Language models and text generation
alignment
1.012026
SPA: Achieving Consensus in LLM Alignment via Self-Priority Optimization · AAAI 2026
Machine learning › Trustworthy machine learning › AI safety
harmlessness
1.012026
SPA: Achieving Consensus in LLM Alignment via Self-Priority Optimization · AAAI 2026
Knowledge, reasoning and agents › Multi-agent systems › agentic AI
agentic reasoning
0.912025
DyFlow: Dynamic Workflow Framework for Agentic Reasoning · NeurIPS 2025
Machine learning › Reinforcement learning
policy learning
0.912025
AdaReasoner: Adaptive Reasoning Enables More Flexible Thinking · NeurIPS 2025
Natural language and speech › Language models and text generation
prompting
0.912025
AdaReasoner: Adaptive Reasoning Enables More Flexible Thinking · NeurIPS 2025
Knowledge graphs
knowledge graph querying
0.912025
WildlifeLookup: A Chatbot Facilitating Wildlife Management with Accessible Data and Insights · WSDM 2025
Natural language and speech › Language models and text generation
instruction following
0.312026
SPA: Achieving Consensus in LLM Alignment via Self-Priority Optimization · AAAI 2026
Natural language and speech › Language models and text generation
large language model
0.312025
DyFlow: Dynamic Workflow Framework for Agentic Reasoning · NeurIPS 2025
Natural language and speech › Language models and text generation
mathematical reasoning
0.312025
AdaReasoner: Adaptive Reasoning Enables More Flexible Thinking · NeurIPS 2025
Security and privacy of machine learning
machine unlearning
0.312025
CLIPErase: Efficient Unlearning of Visual-Textual Associations in CLIP · ACL (1) 2025

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

unlearning · 1.7large language model · 1.7CLIP · 1.7uncertainty-weighted loss · 1.0self-evaluation · 1.0preference optimization · 1.0reward model · 0.9reinforcement learning · 0.9dynamic workflow generation · 0.9context-aware parameterization · 0.9
YearPublicationVenuePosition
2026 SPA: Achieving Consensus in LLM Alignment via Self-Priority Optimization
abstract
In high-stakes scenarios—such as self-harm, legal, or medical queries—LLMs must be both trustworthy and helpful. However, these goals often conflict. We propose priority alignment, a new alignment paradigm that enforces a strict “trustworthy-before-helpful” ordering: optimization of helpfulness is conditioned on first meeting trustworthy thresholds (e.g., harmlessness or honesty). To realize this, we introduce Self-Priority Alignment (SPA)—a fully unsupervised framework that generates diverse responses, self-evaluates them and refines them by the model itself, and applies dual-criterion denoising to remove inconsistency and control variance. From this, SPA constructs lexicographically ordered preference pairs and fine-tunes the model using an uncertainty-weighted alignment loss that emphasizes high-confidence, high-gap decisions. Experiments across multiple benchmarks show that SPA improves helpfulness without compromising safety, outperforming strong baselines while preserving general capabilities. Our results demonstrate that SPA provides a scalable and interpretable alignment strategy for critical LLM applications.
Yue Huang 0001, Xiangqi Wang, Xiangliang Zhang 0001
AAAI2
2025 CLIPErase: Efficient Unlearning of Visual-Textual Associations in CLIP
abstract
Tianyu Yang, Lisen Dai, Xiangqi Wang, Minhao Cheng, Yapeng Tian, Xiangliang Zhang. Proceedings of the 63rd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers). 2025.
Lisen Dai, Xiangqi Wang, Minhao Cheng, Yapeng Tian, Xiangliang Zhang 0001
ACL (1)3
2025 Think it Image by Image: Multi-Image Moral Reasoning of Large Vision-Language Models
abstract
Vision Language Models (VLMs) have demonstrated remarkable success in downstream applications, yet they often exhibit biases, raising ethical concerns. While previous efforts have aimed to evaluate and improve the moral reasoning capabilities of VLMs, existing approaches are limited by simplified, unimodal settings or overly static visual scenarios. We propose a novel multi-image-based dataset pipeline MIST (Moral Inference through Storytelling with Text and Images) designed to assess moral reasoning in complex, dynamic scenarios to address these limitations. To ensure better alignment between these modalities, we introduce the concept of ''text-image flow,'' which seamlessly integrates visual and textual information across complex scenarios. Using this dataset, we evaluate seven widely used VLMs, offering critical insights into their performance in moral reasoning tasks.
Chujie Gao, Yue Huang 0001, Xiangqi Wang, Siyuan Wu 0001, Nitesh V. Chawla, Xiangliang Zhang 0001
CIKM3
2025 AdaReasoner: Adaptive Reasoning Enables More Flexible Thinking
abstract
LLMs often need effective configurations, like temperature and reasoning steps, to handle tasks requiring sophisticated reasoning and problem-solving, ranging from joke generation to mathematical reasoning. Existing prompting approaches usually adopt general-purpose, fixed configurations that work “well enough” across tasks but seldom achieve task-specific optimality. To address this gap, we introduce AdaReasoner, an LLM-agnostic plugin designed for any LLM to automate adaptive reasoning configurations for tasks requiring different types of thinking. AdaReasoner is trained using a reinforcement learning (RL) framework, combining a factorized action space with a targeted exploration strategy, along with a pretrained reward model to optimize the policy model for reasoning configurations with only a few-shot guide. AdaReasoner is backed by theoretical guarantees and experiments of fast convergence and a sublinear policy gap. Across six different LLMs and a variety of reasoning tasks, it consistently outperforms standard baselines, preserves out-of-distribution robustness, and yield gains on knowledge-intensive tasks through tailored prompts.
Xiangqi Wang, Yue Huang 0001, Yanbo Wang 0005, Kehan Guo, Yujun Zhou 0002, Xiangliang Zhang 0001
NeurIPS1
2025 DyFlow: Dynamic Workflow Framework for Agentic Reasoning
abstract
Agent systems based on large language models (LLMs) have shown great potential in complex reasoning tasks, but building efficient and generalizable workflows remains a major challenge. Most existing approaches rely on manually designed processes, which limits their adaptability across different tasks. While a few methods attempt automated workflow generation, they are often tied to specific datasets or query types and make limited use of intermediate feedback, reducing system robustness and reasoning depth. Moreover, their operations are typically predefined and inflexible. To address these limitations, we propose **DyFlow**, a dynamic workflow generation framework that adaptively constructs and adjusts reasoning procedures based on task requirements and real-time intermediate feedback, thereby enhancing cross-task generalization. DyFlow consists of two core components: a designer and an executor. The designer decomposes complex problems into a sequence of sub-goals defined by high-level objectives and dynamically plans the next steps based on intermediate outputs and feedback. These plans are then carried out by the executor, which executes each operation using dynamic operators with context-aware parameterization, enabling flexible and semantically grounded reasoning. We systematically evaluate DyFlow across diverse domains, including social reasoning, biomedical tasks, mathematical problem solving, and code generation. Results demonstrate that DyFlow significantly outperforms existing baselines, achieving substantial Pass@k improvements and exhibiting robust generalization across diverse domains.
Yanbo Wang 0005, Zixiang Xu, Yue Huang 0001, Xiangqi Wang, Zirui Song, Lang Gao, Chenxi Wang 0001, Robert Tang, Yue Zhao 0016, Arman Cohan, Xiangliang Zhang 0001, Xiuying Chen
NeurIPS4
2025 WildlifeLookup: A Chatbot Facilitating Wildlife Management with Accessible Data and Insights
abstract
Wildlife management is increasingly reliant on data-driven insights to address the impacts of climate change on species and ecosystems. However, the complexity of accessing and querying large, multimodal datasets often limits the ability of non-technical users, such as wildlife managers and conservationists, to make informed decisions. To address this challenge, we present WildlifeLookup, a public accessible, intelligent chatbot designed to facilitate natural language interaction with a novel knowledge graph (KN-Wildlife) that houses critical wildlife and environmental data. WildlifeLookup simplifies access to species distributions, habitat interactions, and climate-related events by converting user queries into precise graph queries, reducing the technical barriers for end users. The chatbot WildlifeLookup is available at https://oknbot.ngrok.dev/
Xiangqi Wang, Jason R. Rohr, Brett Scheffers, Nitesh V. Chawla, Xiangliang Zhang 0001
WSDM1
2025 AdvAudio: A New Information Hiding Method via Fooling Automatic Speech Recognition Model
abstract
Audio is an important medium in people’s daily life, secret information can be embedded into audio for covert communication. However, traditional audio information hiding techniques cannot achieve large hiding capacity and good imperceptibility at the same time, and rely on complex encryption, which limits their applicability in resource-constrained Internet of Things (IoT) environments. In this article, we propose a new audio information hiding method, named AdvAudio, which can achieve large high capacity, as well as good imperceptibility, without reliance on cryptographic encryption. Specifically, AdvAudio leverages adversarial example technique to train a well-designed perturbation for cover audio and the secret information can only be extracted by the private automatic speech recognition (ASR) model. To achieve this, we implement two adversarial example algorithms tailored for both online transmission and physical-world transmission scenarios. In particular, our embedding algorithm dynamically adjusts the addition of simulated environmental noise depending on whether the audio is intended to propagate in the physical world. The iterative optimization process is guided by targeted adversarial attack objectives, ensuring that the private ASR model decodes the embedded secret information accurately. Taking DeepSpeech as the private model, we implement a prototype of AdvAudio, which achieves a high embedding capacity of 383.8 bps with excellent imperceptibility, yielding a Perceptual Evaluation of Speech Quality (PESQ) score of 2.351. Furthermore, it offers robust security, achieving a 100% defense success rate against both internal and external attacks. In the physical world, AdvAudio still maintains effectiveness across six different types of noise and retaining 82% accuracy even under sudden loud noises. Additionally, the secret information can only be extracted in the target environment, with a success rate of 26%, and 0% in non-target environments. In the future, we aim at enhancing the steganalysis resistance of AdvAudio and explore its potential applications in various environments or with alternative ASR models.
Xiangqi Wang, Yehao Kong, Luyuan Xie, Shengfang Zhai, Tairui Wang, Boyan Chen, Junkai Liang, Xin Zhang 0110
ACM Trans. Asian Low Resour. Lang. Inf. Process.1
2024 DAF: An Effective Design-for-Testability Authorization Framework Based on Obfuscation Mechanisms for Defending Complex Attacks
abstract
The data privacy and security of Internet of Things (IoT) applications are progressively crucial and cryptography is frequently used to ensure security. Cryptographic hardware implementation is commonly adopted for high throughput and low-computational resources. The crypto circuits have to be strictly tested to guarantee the correctness of data. Scan-based design-for-testability (DFT) widely employed in the chip industry improves the controllability and observability of circuits. However, it facilitates illegal users to steal the internal data for cracking cryptographic keys. Many researchers have recently suggested effective defense technologies against scan-based attacks, but each technology has its own negative aspects. In this article, we propose an effective DFT authorization framework (DAF) based on obfuscation mechanisms. The authentication module is embedded to verify users’ keys, and it can empower each chip distinctive key to minimize the loss of key divulgence. If the test authorization key is accurate, the typical scan operation can be carried out. Conversely, if the key is inaccurate, the inserted obfuscation module comes into play to scramble the scan data. Additionally, a random number generation circuit is used to increase the uncertainty of data obfuscation, effectively preventing attackers from inferring sensitive information. Simulation results show that this design has a low overhead, and theoretical analysis demonstrates that the design has high security with no impact on the testability of the chip.
Weizheng Wang 0002, Xingxing Gong, Xiangqi Wang, Shuo Cai, Peng Liu 0045, Naixue Xiong
IEEE Internet Things J.3
2023 A secure scan architecture using parallel latch-based lock
Weizheng Wang 0002, Xiangqi Wang, Xianmin Pan, Shuo Cai
Integr.3
2022 Ensuring Cryptography Chips Security by Preventing Scan-Based Side-Channel Attacks With Improved DFT Architecture
abstract
Cryptography chips are often used in some applications, such as smart grids and Internet of Things (IoT) to ensure their security. Cryptographic chips must be strictly tested to guarantee the correctness of the encryption and decryption. Scan-based design-for-testability (DFT) provides high test quality. However, it can also be misused to steal the cipher key of cryptographic chips by hackers. In this article, we present a new scan design methodology that can resist scan-based side-channel attacks by the dynamical obfuscation of scan input data and scan output data. The scan test is managed by a test password, which consists of load password and scan password. When the chip enters into the test mode, it is required to apply the test password via some external input ports. Once the correct load password is delivered, the scan password can be loaded into a special shift register. If the scan password is also correct, the chip testing can proceed normally. In case the load password or the scan password is wrong, the data in scan chains cannot be propagated correctly. Specifically, some elusory bits are sneaked into scan chains dynamically. The advantage of the proposed method is that it has no negative impact on design performance and test flow when powerfully protecting cryptographic chips. The area penalty is also acceptably low compared with other schemes.
Weizheng Wang 0002, Xiangqi Wang, Jin Wang 0001, Naixue Xiong, Shuo Cai, Peng Liu 0045
IEEE Trans. Syst. Man Cybern. Syst.2
2020 HRAE: Hardware-assisted Randomization against Adversarial Example Attacks
abstract
With the rapid advancements of the artificial intelligence, machine learning, especially neural networks, have shown huge superiority over humans in image recognition, autonomous vehicles and medical diagnosis. However, its opacity and inexplicability provide many chances for malicious attackers. Recent researches have shown that neural networks are vulnerable to adversarial example (AE) attacks. In the testing stage, it fools the model by adding subtle perturbations to the original sample to misclassify the input, which poses a serious threat to safety-critical areas such as autonomous driving. In order to mitigate this threat, this paper proposes a hardware-assisted randomization method against AEs, where an approximate computing technique in hardware, voltage over-scaling (VOS), is used to randomize the training set of the model, then the processed data are used to generate multiple neural network models, finally multiple redundant models are used for the integrated classification and detection of the AEs. Various AE attacks on the proposed defense are evaluated to prove its effectiveness.
Jiliang Zhang 0002, Shuang Peng 0010, Yupeng Hu 0004, Wei Hu 0008, Jinmei Lai 0001, Jing Ye 0001, Xiangqi Wang
ATS8