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

Cong Zeng

dblp:183/9716 · DBLP profile ↗
← Back
8ranked-venue papers
4as first author
7since 2021 · last 2025
—ORCID · conflict

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

Artificial intelligence and machine learning · 4 · 3 first-author · 4 since 2021Applied, interdisciplinary, general and emerging computing · 2 · 1 first-author · 1 since 2021Computer networks · 1 · 1 since 2021Databases, data management, data science and information retrieval · 1 · 1 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
3 papers
Language models and text generation · 32% Efficient and distributed learning · 23% Generative modeling · 12%

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

TopicWeightPapersLastEvidence papers
Natural language and speech › Language models and text generation
machine-generated text detection
1.622025
Human Texts Are Outliers: Detecting LLM-generated Texts via Out-of-distribution Detection · NeurIPS 2025
DALD: Improving Logits-based Detector without Logits from Black-box LLMs · NeurIPS 2024
Machine learning › Generative modeling
diffusion model
0.912025
MosaicDiff: Training-free Structural Pruning for Diffusion Model Acceleration Reflecting Pretraining Dynamics · ICCV 2025
Machine learning › Efficient and distributed learning
model compression
0.912025
MosaicDiff: Training-free Structural Pruning for Diffusion Model Acceleration Reflecting Pretraining Dynamics · ICCV 2025
Machine learning › Time series and sequential data › anomaly detection
one-class classification
0.912025
Human Texts Are Outliers: Detecting LLM-generated Texts via Out-of-distribution Detection · NeurIPS 2025
Machine learning › Trustworthy machine learning › robustness
out-of-distribution detection
0.912025
Human Texts Are Outliers: Detecting LLM-generated Texts via Out-of-distribution Detection · NeurIPS 2025
Machine learning › Efficient and distributed learning › model compression › pruning
structured pruning
0.912025
MosaicDiff: Training-free Structural Pruning for Diffusion Model Acceleration Reflecting Pretraining Dynamics · ICCV 2025
Natural language and speech › Language models and text generation › machine-generated text detection
black-box detection
0.812024
DALD: Improving Logits-based Detector without Logits from Black-box LLMs · NeurIPS 2024
Machine learning › Transfer learning and domain adaptation
distribution matching
0.812024
DALD: Improving Logits-based Detector without Logits from Black-box LLMs · NeurIPS 2024

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

structural pruning · 0.9pretraining dynamics analysis · 0.9one-class learning · 0.9energy-based method · 0.9HRN · 0.9DeepSVDD · 0.9zero-shot detection · 0.8fine-tuning · 0.8distribution alignment · 0.8
YearPublicationVenuePosition
2025 MosaicDiff: Training-free Structural Pruning for Diffusion Model Acceleration Reflecting Pretraining Dynamics
Bowei Guo, Shengkun Tang, Cong Zeng
ICCV3
2025 Human Texts Are Outliers: Detecting LLM-generated Texts via Out-of-distribution Detection
abstract
The rapid advancement of large language models (LLMs) such as ChatGPT, DeepSeek, and Claude has significantly increased the presence of AI-generated text in digital communication. This trend has heightened the need for reliable detection methods to distinguish between human-authored and machine-generated content. Existing approaches both zero-shot methods and supervised classifiers largely conceptualize this task as a binary classification problem, often leading to poor generalization across domains and models. In this paper, we argue that such a binary formulation fundamentally mischaracterizes the detection task by assuming a coherent representation of human-written texts. In reality, human texts do not constitute a unified distribution, and their diversity cannot be effectively captured through limited sampling. This causes previous classifiers to memorize observed OOD characteristics rather than learn the essence of `non-ID' behavior, limiting generalization to unseen human-authored inputs. Based on this observation, we propose reframing the detection task as an out-of-distribution (OOD) detection problem, treating human-written texts as distributional outliers while machine-generated texts are in-distribution (ID) samples. To this end, we develop a detection framework using one-class learning method including DeepSVDD and HRN, and score-based learning techniques such as energy-based method, enabling robust and generalizable performance. Extensive experiments across multiple datasets validate the effectiveness of our OOD-based approach. Specifically, the OOD-based method achieves 98.3\% AUROC and AUPR with only 8.9\% FPR95 on DeepFake dataset. Moreover, we test our detection framework on multilingual, attacked, and unseen-model and -domain text settings, demonstrating the robustness and generalizability of our framework. Code will be released openly and also available in the supplementary materials.
Cong Zeng, Shengkun Tang, Yuanzhou Chen, Wenchao Yu, Xujiang Zhao, Wei Cheng 0002
NeurIPS1
2024 DALD: Improving Logits-based Detector without Logits from Black-box LLMs
abstract
The advent of Large Language Models (LLMs) has revolutionized text generation, producing outputs that closely mimic human writing. This blurring of lines between machine- and human-written text presents new challenges in distinguishing one from the other – a task further complicated by the frequent updates and closed nature of leading proprietary LLMs. Traditional logits-based detection methods leverage surrogate models for identifying LLM-generated content when the exact logits are unavailable from black-box LLMs. However, these methods grapple with the misalignment between the distributions of the surrogate and the often undisclosed target models, leading to performance degradation, particularly with the introduction of new, closed-source models. Furthermore, while current methodologies are generally effective when the source model is identified, they falter in scenarios where the model version remains unknown, or the test set comprises outputs from various source models. To address these limitations, we present \textbf{D}istribution-\textbf{A}ligned \textbf{L}LMs \textbf{D}etection (DALD), an innovative framework that redefines the state-of-the-art performance in black-box text detection even without logits from source LLMs. DALD is designed to align the surrogate model's distribution with that of unknown target LLMs, ensuring enhanced detection capability and resilience against rapid model iterations with minimal training investment. By leveraging corpus samples from publicly accessible outputs of advanced models such as ChatGPT, GPT-4 and Claude-3, DALD fine-tunes surrogate models to synchronize with unknown source model distributions effectively. Our approach achieves SOTA performance in black-box settings on different advanced closed-source and open-source models. The versatility of our method enriches widely adopted zero-shot detection frameworks (DetectGPT, DNA-GPT, Fast-DetectGPT) with a `plug-and-play' enhancement feature. Extensive experiments validate that our methodology reliably secures high detection precision for LLM-generated text and effectively detects text from diverse model origins through a singular detector. Our method is also robust under the revised text attack and non-English texts.
Cong Zeng, Shengkun Tang, Xianjun Yang, Yuanzhou Chen, Yiyou Sun, Yao Li 0015, Wei Cheng 0002, Dongkuan Xu
NeurIPS1
2024 A prediction model for rumor user propagation behavior based on sparse representation and transfer learning
Yunpeng Xiao 0001, Cong Zeng, Tun Li 0001, Rong Wang 0003, Qian Li 0009, Chaolong Jia
Inf. Sci.3
2022 Lightweight global-locally connected distillation network for single image super-resolution
Cong Zeng, Guangyao Li 0003, Qiaochuan Chen, Qingguo Xiao
Appl. Intell.1
2022 pHisPred: a tool for the identification of histidine phosphorylation sites by integrating amino acid patterns and properties
abstract
BACKGROUND: Protein histidine phosphorylation (pHis) plays critical roles in prokaryotic signal transduction pathways and various eukaryotic cellular processes. It is estimated to account for 6-10% of the phosphoproteome, however only hundreds of pHis sites have been discovered to date. Due to the inherent disadvantages of experimental methods, it is an urgent task for developing efficient computational approaches to identify pHis sites. RESULTS: Here, we present a novel tool, pHisPred, for accurately identifying pHis sites from protein sequences. We manually collected the largest number of experimental validated pHis sites to build benchmark datasets. Using randomized tenfold CV, the weighted SVM-RBF model shows the best performance than other four commonly used classification models (LR, KNN, RF, and MLP). From ten thousands of features, 140 and 150 most informative features were individually selected out for eukaryotic and prokaryotic models. The average AUC and F1-score values of pHisPred were (0.81, 0.40) and (0.78, 0.46) for tenfold CV on the eukaryotic and prokaryotic training datasets, respectively. In addition, pHisPred significantly outperforms other tools on testing datasets, in particular on the eukaryotic one. CONCLUSION: We implemented a python program of pHisPred, which is freely available for non-commercial use at https://github.com/xiaofengsong/pHisPred . Moreover, users can use it to train new models with their own data.
Jian Zhao 0034, Minhui Zhuang, Meng Zhang 0046, Cong Zeng, Bin Jiang 0001
BMC Bioinform.5
2022 A social rumor and anti-rumor game diffusion model based on sparse representation and tensor completion
Qian Li 0009, Cong Zeng, Yunpeng Xiao 0001
J. Netw. Comput. Appl.2
2019 An account of in silico identification tools of secreted effector proteins in bacteria and future challenges
abstract
Bacterial pathogens secrete numerous effector proteins via six secretion systems, type I to type VI secretion systems, to adapt to new environments or to promote virulence by bacterium-host interactions. Many computational approaches have been used in the identification of effector proteins before the subsequent experimental verification because they tolerate laborious biological procedures and are genome scale, automated and highly efficient. Prevalent examples include machine learning methods and statistical techniques. In this article, we summarize the computational progress toward predicting secreted effector proteins in bacteria, with an opening of an introduction of features that are used to discriminate effectors from non-effectors. The mechanism, contribution and deficiency of previous developed detection tools are presented, which are further benchmarked based on a curated testing data set. According to the results of benchmarking, potential improvements of the prediction performance are discussed, which include (1) more informative features for discriminating the effectors from non-effectors; (2) the construction of comprehensive training data set of the machine learning algorithms; (3) the advancement of reliable prediction methods and (4) a better interpretation of the mechanisms behind the molecular processes. The future of in silico identification of bacterial secreted effectors includes both opportunities and challenges.
Cong Zeng, Lingyun Zou
Briefings Bioinform.1