sound-probabilistic-safety-bounds-for-large-language-models-88a7ef92·1 events·first seen Aliases: Sound Probabilistic Safety Bounds for Large Language Models
A new arXiv preprint proposes a framework for computing formally sound probabilistic bounds on the likelihood that an LLM generates harmful output for a given prompt. The method applies Clopper-Pearson confidence intervals to obtain PAC (probably approximately correct) bounds, and introduces an algorithm that uses latent-space features to prioritize exploration of harmful branches in the autoregressive generation tree. The approach is designed to produce valid lower bounds even when true harm probability is very small, enabling statistical certification of LLM safety properties.