arXiv Computation and Language
Sep 4

Evaluating Criterion-Conditioned Behaviour of Large Language Models in Content Moderation

The paper introduces DECO, a diagnostic framework that factorises content into independent moderation criteria, allowing controlled evaluation of large language models (LLMs) at the criterion level. Using pairwise evaluation across four datasets and four LLMs, the authors find that high aggregate benchmark scores can mask significant failures when decisions hinge on specific content aspects required by individual criteria. The study underscores that aggregated labels do not guarantee reliable criterion-conditioned performance, highlighting the need for evaluation methods that explicitly assess this behavior.

By Danting Zhang, Bei Peng, Robert Loftin
Hugging Face Trending Papers
Sep 3

Evaluating Criterion-Conditioned Behaviour of Large Language Models in Content Moderation

The paper introduces DECO, a diagnostic tool that factorises content into independent criteria for evaluating large language models (LLMs) on content moderation tasks. Using DECO and pairwise evaluation across four datasets and four LLMs, the authors find that high benchmark scores can mask significant failures at the criterion level, especially when decisions hinge on specific content aspects rather than overall harmfulness. The study underscores that aggregated label performance does not guarantee reliable criterion-conditioned evaluation, calling for new methods that explicitly assess this behavior.

arXiv Machine Learning
Sep 2

Training-Free Policy Violation Detection via Activation-Space Whitening in LLMs

The paper introduces a training‑free approach to detect policy violations in large language models by treating the task as an out‑of‑distribution problem in the model’s activation space. It uses whitening‑inspired techniques to compute policy‑violation scores directly from normalized hidden activations, requiring only the policy text and a few illustrative examples. Experiments on several LLMs and policy benchmarks show the method achieves up to 86.0% F1, outperforming fine‑tuned and LLM‑as‑a‑judge baselines while being computationally lightweight.

By Oren Rachmil, Avishag Shapira, Roy Betser, Omer Hofman, Itay Gershon, Asaf Shabtai, Yuval Elovici, Roman Vainshtein