Conversational complexity for assessing risk in large language models

Large Language Models (LLMs) present a dual-use dilemma: they enable beneficial applications while harboring potential for harm, particularly through conversational interactions. Despite various safeguards, advanced LLMs remain vulnerable. A watersed case in early 2023 involved journalist Kevin Roose’s extended dialogue with Bing, an LLM-powered search engine, which revealed harmful outputs after probing questions, highlighting vulnerabilities in the model’s safeguards. This contrasts with simpler early jailbreaks, like the “Grandma Jailbreak,” where users framed requests as innocent help for a grandmother, easily eliciting similar content. This raises the question: How much conversational effort is needed to elicit harmful information from LLMs? We propose two measures: Conversational Length (CL), which quantifies the conversation length used to obtain a specific response, and Conversational Complexity (CC), defined as the Kolmogorov complexity of the user’s instruction sequence leading to the response. To address the incomputability of Kolmogorov complexity, we approximate CC using a reference LLM to estimate the compressibility of user instructions. Applying this approach to a large red-teaming dataset, we perform a quantitative analysis examining the statistical distribution of harmful and harmless conversational lengths and complexities. Our empirical findings suggest that this distributional analysis and the minimisation of CC serve as valuable tools for understanding AI safety, offering insights into the accessibility of harmful information. This work establishes a foundation for a new perspective on LLM safety, centered around the algorithmic complexity of pathways to harm.

Authors

Institutions

Publication Details

Journal
EPJ Data Science
Published
2025-11-05
DOI
https://doi.org/10.1140/epjds/s13688-025-00592-4
Citations
1
Primary Topic
Topic Modeling
Type
article
Field-Weighted Citation Impact
2.48

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Conversational complexity for assessing risk in large language models

José Hernández‐Orallo, John Burden, Manuel Cebrian
1 citations
EPJ Data Science
Topic Modeling
2.48
article

Conversational complexity for assessing risk in large language models

José Hernández‐Orallo, John Burden, Manuel Cebrian
article en
1 citations

Abstract

Large Language Models (LLMs) present a dual-use dilemma: they enable beneficial applications while harboring potential for harm, particularly through conversational interactions. Despite various safeguards, advanced LLMs remain vulnerable. A watersed case in early 2023 involved journalist Kevin Roose’s extended dialogue with Bing, an LLM-powered search engine, which revealed harmful outputs after probing questions, highlighting vulnerabilities in the model’s safeguards. This contrasts with simpler early jailbreaks, like the “Grandma Jailbreak,” where users framed requests as innocent help for a grandmother, easily eliciting similar content. This raises the question: How much conversational effort is needed to elicit harmful information from LLMs? We propose two measures: Conversational Length (CL), which quantifies the conversation length used to obtain a specific response, and Conversational Complexity (CC), defined as the Kolmogorov complexity of the user’s instruction sequence leading to the response. To address the incomputability of Kolmogorov complexity, we approximate CC using a reference LLM to estimate the compressibility of user instructions. Applying this approach to a large red-teaming dataset, we perform a quantitative analysis examining the statistical distribution of harmful and harmless conversational lengths and complexities. Our empirical findings suggest that this distributional analysis and the minimisation of CC serve as valuable tools for understanding AI safety, offering insights into the accessibility of harmful information. This work establishes a foundation for a new perspective on LLM safety, centered around the algorithmic complexity of pathways to harm.

EPJ Data ScienceVol. 14(1)
University of Cambridge (GB), Leverhulme Trust (GB), Centre for Automation and Robotics (ES), Artificial Intelligence Research Institute (ES), Universitat Politècnica de València (ES)
Silicon Valley Community Foundation, Ministerio de Ciencia, Innovación y Universidades, Generalitat Valenciana, Fundación General CSIC, Defense Advanced Research Projects Agency, Horizon 2020 Framework Programme, European Regional Development Fund, Agencia Estatal de Investigación
Openalex Percentile: Top 8%
Topic Modeling
2.48
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.