LGMay 14

LPDS: Evaluating LLM Robustness Through Logic-Preserving Difficulty Scaling

arXiv:2605.1539396.5
Predicted impact top 3% in LG · last 90 daysOriginality Incremental advance
AI Analysis

For researchers and developers evaluating LLM robustness, LPDS provides a systematic method to identify failure-prone variations, addressing the limitation of random sampling in existing evaluations.

LPDS introduces a framework to systematically find logic-preserving problem variations that maximize difficulty for LLMs, exposing robustness failures. It achieves performance drops up to 5 times larger than random sampling and shows that training on harder variations yields better robustness gains.

As large language models (LLMs) are increasingly deployed to perform tasks with minimal human oversight, it is crucial that these models operate robustly. In particular, a model that can solve a given problem should not fail simply because certain entities$\unicode{x2013}$such as names, numbers, or other contextual details$\unicode{x2013}$have changed while the underlying problem logic remains the same. Prior work suggests that current LLMs still struggle with this form of robustness: they often succeed on some variations of a problem but fail on others. However, existing evaluations often lack a systematic way to identify which logic-preserving variations are most likely to induce failure. Instead, they typically test a random subset of allowable variations, which can overstate robustness. To address this gap, we introduce logic-preserving difficulty scaling (LPDS), a framework that (i) quantifies the difficulty of a problem variation and (ii) systematically searches the space of allowable variations to find those that maximize difficulty and expose failures. We show that as difficulty increases, performance declines and errors in the models' reasoning chains become more pronounced. We further demonstrate that LPDS efficiently finds difficult problem variations for a model, resulting in performance drops up to 5 times larger compared to random sampling. Finally, we show that fine-tuning on more difficult variations leads to more consistent robustness gains than training on easier ones.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes