Tianyu Luo
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Tianyu Luo has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Jing Yang
Key Laboratory of Intelligent Information Processing, Institute of Computing Technology, Chinese Academy of Sciences, Beijing, China
2 shared publications - Kangli Zi
State Key Laboratory of AI Safety Institute of Computing Technology CAS
2 shared publications - Shi Wang
Institute of Computing Technology Chinese Academy of Sciences Beijing China
2 shared publications - Yanshun Sun
Key Laboratory of Intelligent Information Processing, Institute of Computing Technology, Chinese Academy of Sciences, Beijing, China
2 shared publications - Yuwei Huang
Key Laboratory of Intelligent Information Processing, Institute of Computing Technology, Chinese Academy of Sciences, Beijing, China
2 shared publications
Latest Publications
- 23 May 2025
- Published by Springer Nature in International Journal of Machine Learning and Cybernetics
- p. 1-16
SILTD: Structural Information for LLM-Generated Text Detection
- 23 May 2025
- Published by Springer Nature in International Journal of Machine Learning and Cybernetics
- p. 1-16
SILTD: Structural Information for LLM-Generated Text Detection
- Open Access
- 13 September 2024
- Published by Springer Nature in Research Square
SILTD: Structural Information for LLM-generated Text Detection
The rapid development of large language models (LLMs) has significantly improved the quality and diversity of AI-generated content(AIGC). LLMs-generated text detection plays an important role in preventing the harmful misuse of large language models. Although many detection methods have been proposed, they all have room for improvement and lack generality when detecting multiple models. To tackle these drawbacks, an unsupervised-based Structural Information for LLM-generated Text Detection(SILTD) method is proposed. First, we construct a multi-relational text graph based on the similarity of text features, which aims to model the intricate similarities and correlations between texts in the generative statistical space. Second, we propose a novel unsupervised graph clustering method. The multi-relational graph is transformed into an encoding tree, which is then optimized based on a two-dimensional structure entropy minimization algorithm to achieve hierarchical clustering of texts. Structural entropy minimization enables achieving high-quality clusters, by measuring the uncertainty of random walks within the graph. Finally, we introduce a new method that measures text similarity and computes the intensity of text aggregation within each cluster, to perform in-cluster label inference. Extensive experiments show that, compared to baseline methods, our approach is more effective and generalizable in detecting six popular LLMs across three datasets.
- 13 September 2024
- Published by Springer Nature in Research Square
Open AccessSILTD: Structural Information for LLM-generated Text Detection
The rapid development of large language models (LLMs) has significantly improved the quality and diversity of AI-generated content(AIGC). LLMs-generated text detection plays an important role in preventing the harmful misuse of large language models. Although many detection methods have been proposed, they all have room for improvement and lack generality when detecting multiple models. To tackle these drawbacks, an unsupervised-based Structural Information for LLM-generated Text Detection(SILTD) method is proposed. First, we construct a multi-relational text graph based on the similarity of text features, which aims to model the intricate similarities and correlations between texts in the generative statistical space. Second, we propose a novel unsupervised graph clustering method. The multi-relational graph is transformed into an encoding tree, which is then optimized based on a two-dimensional structure entropy minimization algorithm to achieve hierarchical clustering of texts. Structural entropy minimization enables achieving high-quality clusters, by measuring the uncertainty of random walks within the graph. Finally, we introduce a new method that measures text similarity and computes the intensity of text aggregation within each cluster, to perform in-cluster label inference. Extensive experiments show that, compared to baseline methods, our approach is more effective and generalizable in detecting six popular LLMs across three datasets.