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

Xiaoyan Feng

dblp:88/6946 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
3since 2021 · last 2026
—ORCID · conflict

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

Artificial intelligence and machine learning · 2 · 2 first-author · 2 since 2021Databases, data management, data science and information retrieval · 1 · 1 since 2021Applied, interdisciplinary, general and emerging 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.

Network and information security
2 papers
Digital forensics and information hiding · 75% Security and privacy of machine learning · 20% Privacy and data protection · 5%
Artificial intelligence
1 paper
Language models and text generation · 100%

Topics — the 5 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Digital forensics and information hiding
watermarking
1.922026
Breaking Semantic-Aware Watermarks via LLM-Guided Coherence-Preserving Semantic Injection · WWW 2026
BiMark: Unbiased Multilayer Watermarking for Large Language Models · ICML 2025
Security and privacy of machine learning
adversarial attack
1.012026
Breaking Semantic-Aware Watermarks via LLM-Guided Coherence-Preserving Semantic Injection · WWW 2026
Digital forensics and information hiding › watermarking › text watermarking
semantic watermarking
1.012026
Breaking Semantic-Aware Watermarks via LLM-Guided Coherence-Preserving Semantic Injection · WWW 2026
Natural language and speech › Language models and text generation › text generation
text quality preservation
0.912025
BiMark: Unbiased Multilayer Watermarking for Large Language Models · ICML 2025
Digital forensics and information hiding › watermarking › text watermarking
LLM watermarking
0.912025
BiMark: Unbiased Multilayer Watermarking for Large Language Models · ICML 2025

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

multilayer architecture · 1.7multi-bit encoding · 1.7bit-flip unbiased reweighting · 1.7semantic injection · 1.0large language model · 1.0
YearPublicationVenuePosition
2026 Breaking Semantic-Aware Watermarks via LLM-Guided Coherence-Preserving Semantic Injection
abstract
Generative images have proliferated on Web platforms in social media and online copyright distribution scenarios, and semantic watermarking has increasingly been integrated into diffusion models to support reliable provenance tracking and forgery prevention for web content. Traditional noise-layer-based watermarking, however, remains vulnerable to inversion attacks that can recover embedded signals. To mitigate this, recent content-aware semantic watermarking schemes bind watermark signals to high-level image semantics, constraining local edits that would otherwise disrupt global coherence. Yet, large language models (LLMs) possess structured reasoning capabilities that enable targeted exploration of semantic spaces, allowing locally fine-grained but globally coherent semantic alterations that invalidate such bindings. To expose this overlooked vulnerability, we introduce a Coherence-Preserving Semantic Injection (CSI) attack that leverages LLM-guided semantic manipulation under embedding-space similarity constraints. This alignment enforces visual-semantic consistency while selectively perturbing watermark-relevant semantics, ultimately inducing detector misclassification. Extensive empirical results show that CSI consistently outperforms prevailing attack baselines against content-aware semantic watermarking, revealing a fundamental security weakness of current semantic watermark designs when confronted with LLM-driven semantic perturbations.
Xiaoyu Li 0001, Zhicheng Bao, Xiaoyan Feng, Jiaojiao Jiang 0001
WWW4
2025 BiMark: Unbiased Multilayer Watermarking for Large Language Models
abstract
Recent advances in Large Language Models (LLMs) have raised urgent concerns about LLM-generated text authenticity, prompting regulatory demands for reliable identification mechanisms. Although watermarking offers a promising solution, existing approaches struggle to simultaneously achieve three critical requirements: text quality preservation, model-agnostic detection, and message embedding capacity, which are crucial for practical implementation. To achieve these goals, the key challenge lies in balancing the trade-off between text quality preservation and message embedding capacity. To address this challenge, we propose BiMark, a novel watermarking framework that achieves these requirements through three key innovations: (1) a bit-flip unbiased reweighting mechanism enabling model-agnostic detection, (2) a multilayer architecture enhancing detectability without compromising generation quality, and (3) an information encoding approach supporting multi-bit watermarking. Through theoretical analysis and extensive experiments, we validate that, compared to state-of-the-art multi-bit watermarking methods, BiMark achieves up to 30% higher extraction rates for short texts while maintaining text quality indicated by lower perplexity, and performs comparably to non-watermarked text on downstream tasks such as summarization and translation.
Xiaoyan Feng, He Zhang 0012, Yanjun Zhang 0002, Leo Yu Zhang, Shirui Pan
ICML1
2023 Leveraging Node Attributes for Link Prediction via Meta-path Based Proximity
abstract
Link prediction is an important task of graph data mining that facilitates a series of applications including recommendation system, network reconstruction, etc. Node attributes make it possible to predict potential links between isolate or unobserved nodes. That attracts more and more attention of academia and industry on leveraging node attributes for link prediction. Numerous link prediction methods are based on attributed network embedding, but they are not specially designed for link prediction and may suffer potential loss of accuracy due to reduction of dimension. In this paper, we propose a direct and efficient way to utilize path-based proximity for link prediction. In many works in the past, node attributes were regarded as a different property of networks compared to heterogeneity. This paper creatively treats attributes as a distinct type of nodes and extends attributed networks to heterogeneous networks. It proposes a framework based on transition probability of meta-path guided random walks to get attributes and structure incorporated proximity of nodes. Link prediction experiments on six real-world datasets were conducted by three types of baselines methods. The experimental results demonstrates that the proposed method has exceptional performance in terms of both robustness and accuracy on most datasets.
Xiaoyan Feng, Mingyang Dai
IJCNN1