atlas

Research map / Large language models / Alignment and preferences

Aligning with Logic: Measuring, Evaluating and Improving Logical Preference Consistency in Large Language Models

ICML 2025 · Large language models › Alignment and preferences · approach: Reward model design and preference models · 3 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's full text. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Proposes metrics for logical preference consistency (transitivity, commutativity, negation invariance) for LLM pairwise judgments, evaluates ten LLMs on three tasks, and introduces REPAIR, a rank-estimation-based data refinement and augmentation method for instruction tuning.

Problem

LLM pairwise judgments over sets of items are often inconsistent (intransitive, order-dependent, or failing to invert under negation), which undermines their reliability as logical operators in decision-making and ranking algorithms.

Approach

Define set-level metrics for transitivity (acyclicity of sampled sub-graphs), commutativity (invariance to item order) and negation invariance; then refine noisy pairwise labels by estimating a global ranking (win-loss rate) and extrapolating a self-consistent comparison set, optionally augmented with negated-relation comparisons, for instruction tuning.

Key results

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Replace perturbed comparisons with REPAIR-refined and augmented comparisonsLlama-3-8B-Instruct · Summarize from Feedbacks_tran(5): 91.9 -> 95.4Helped
Replace perturbed comparisons with REPAIR-refined and augmented comparisonsLlama-3-8B-Instruct · Summarize from Feedbacks_comm: 88.4 -> 91.2Helped
Replace perturbed comparisons with REPAIR-refined and augmented comparisonsLlama-3-8B-Instruct · Summarize from Feedbackhuman accuracy: 70.3 -> 70.1No clear effect
Add training on negated relation comparisons (ablation)Llama-3-8B-Instruct trained on REPAIR-ed data · Summarize from Feedbacks_neg: 60.8 -> 87.9Helped
Add training on negated relation comparisons (ablation)Llama-3-8B-Instruct trained on REPAIR-ed data · Summarize from Feedbacks_comm: 91.2 -> 90.5Hurt
Add training on negated relation comparisons (ablation)Llama-3-8B-Instruct trained on REPAIR-ed data · MS MARCOs_neg: 63.1 -> 85.5Helped
Add training on negated relation comparisons (ablation)Llama-3-8B-Instruct trained on REPAIR-ed data · MS MARCOs_tran(5): 91.3 -> 90.2Hurt
Down-sample REPAIR-ed training data to match perturbed-data size (ablation)Llama-3-8B-Instruct · Summarize from Feedbacks_tran(5): 92.4 -> 96.3Helped
Down-sample REPAIR-ed training data to match perturbed-data size (ablation)Llama-3-8B-Instruct · Summarize from Feedbackhuman accuracy: 71.3 -> 69.1Hurt
Use Elo ranking instead of win-loss rate in REPAIR (ablation)Llama-3-8B-Instruct · Summarize from Feedbacks_tran(5): 97.5 -> 97.7Helped
Use Bradley-Terry ranking instead of win-loss rate in REPAIR (ablation)Llama-3-8B-Instruct · Summarize from Feedbacks_tran(5): 97.5 -> 98.6Helped
Apply CoT prompting rather than direct judgments (ablation)LLMs in logical preference evaluation · SummEval, NovelEval, and CaTeRSs_tran(5)Hurt

Surprising findings

Limitations

Experimental setup

Datasets: SummEval NovelEval CaTeRS Summarize from Feedback MS MARCO

Benchmarks: SummEval NovelEval CaTeRS Summarize from Feedback MS MARCO

Metrics: human agreement accuracy s_tran(5) transitivity s_comm commutativity s_neg negation invariance Spearman correlation (PairS) self-agreement

Baselines: Zero-shot inference Perturbed data PairS Elo rating Bradley-Terry model

Builds on: PairS Chain-of-thought prompting LoRA

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy