Competence-Based Evaluation of Logical Reasoning in Large Language Models

Jize Jiang, Chengxiang Zhai

University of Illinois Urbana-Champaign

Published October 16, 2026 · on the feed October 20, 2026 · ▲ 4 · arXiv 2610.22894

Reasoning & mathLLM training & RL No code arXiv ↗Hugging Face ↗

The abstract

Recent advances in large language models (LLMs) have brought impressive performance across diverse tasks; however, shortcomings remain in logical reasoning, including inconsistencies under linguistic variation. To improve the reasoning capacity of LLMs, we must be able to accurately measure their reasoning capacity. Current benchmarks primarily report single accuracy numbers on selected reasoning tasks. Such a performance-based evaluation methodology says little about a model's generalization capacity in reasoning. To address this limitation, we argue for a different evaluation paradigm, called competence-based evaluation (CBE), which tests whether models reliably apply the same competence across a family of problems. A parameterized generator scales complexity while keeping the required competence fixed, and matched answer-preserving presentations test correctness beyond one formulation. We instantiate CBE on elementary ordering tasks, scaling input size while varying presentations of the same ordering rule. Across six GPT and Qwen models, performance is reasonably good over bounded complexity ranges, but even strong models fail the competence condition across the tested family. Chain-of-thought and GRPO extend strong performance without resolving all tested failures; supervised LoRA shows little held-out transfer. CBE provides diagnostic profiles and an evaluation protocol that can grow with future models.

The Brief

2:14

A short podcast summary of the paper. Written and voiced by AI.

Transcript

Competence-Based Evaluation of Logical Reasoning in Large Language Models. By Jize Jiang and one other, from the University of Illinois Urbana-Champaign. Published on the sixteenth of October. No code repository is linked to it.

Large language models perform well across many tasks, yet their logical reasoning still has shortcomings, including inconsistency when the same problem is phrased differently. Improving reasoning requires measuring it accurately, and current benchmarks mostly report a single accuracy number on selected reasoning tasks. The authors argue that this performance-based methodology says little about whether a model's reasoning generalizes. A good score on a fixed set of items does not show that the model applies the underlying skill reliably, at larger sizes or in other wordings.

The proposed paradigm is competence-based evaluation, or CBE. It tests whether a model reliably applies the same competence across a whole family of problems, rather than whether it gets particular items right. Two ingredients make that testable. A parameterized generator scales complexity while holding the required competence fixed. And matched presentations that preserve the answer test correctness beyond any single formulation.

The paradigm is instantiated on elementary ordering tasks. Input size is scaled up, while the presentation of the same ordering rule is varied. Keeping the task elementary means the required competence stays plain, and what changes is only size and wording. Six models from the GPT and Qwen families are evaluated.

Performance is reasonably good over bounded ranges of complexity. But even strong models fail the competence condition across the tested family. Several interventions were tried. Chain-of-thought and GRPO extend the range of strong performance without resolving all of the tested failures. Supervised LoRA shows little transfer to held-out cases.

The contribution is a change in what a reasoning score is meant to certify. In place of a number on a sample, CBE produces diagnostic profiles of where a competence holds and where it gives way, together with an evaluation protocol that can grow as models improve. Ordering is an elementary task, and that is the point. A model that cannot keep one simple rule stable as problems grow and are rephrased has not yet shown the competence its accuracy might suggest.

More with an account

Listen to every day’s papers

Daily playlists, deep dives, quests for the papers, and quizzes on their key terms.

Join free
KipQuest: the day’s AI research, as podcasts and quests. All papers Android app Privacy Contact Episodes are written and voiced by AI from each paper. Summaries can contain mistakes: the paper is the source.