arXiv AI By Eduard Tulchinskii, Anastasia Voznyuk, Laida Kushnareva, Andrei Andriiainen, Irina Piontkovskaya, Evgeny Burnaev, Serguei Barannikov

Quantifying Logical Consistency in Transformers via Query-Key Alignment

Read the original on arXiv AI →

The paper introduces a lightweight evaluation method for logical reasoning in transformer-based language models, using query-key alignments within attention heads to compute a QK-score. This single forward-pass technique identifies valid versus invalid inferences and is validated across multiple reasoning benchmarks, showing robustness to distractors and deeper reasoning. Experiments span models from 1.5B to 70B parameters, demonstrating scalability.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv AI.

arXiv AI
Oct 2

Selection-Based Structured Reasoning: Toward Efficient Multimodal Search Agents

Selection-Based Structured Reasoning (SSR) is a framework that replaces free-form reasoning with the selection of pre-specified natural‑language reasoning candidates, allowing multimodal agents to choose from a set of reusable high‑level reasoning traces. By scoring these candidates in parallel using a shared context KV cache, SSR eliminates the need for an auxiliary task head and reduces inference cost. Experiments on seven multimodal search benchmarks with 2B and 4B models show that SSR maintains competitive success rates while cutting per‑turn reasoning latency by over 90% and overall inference latency by 28–54%.

By Feiyu Gavin Zhu, Xiaoyu Zhu, Jiqi Yang, Rui Yang, Arnab Kumar Mondal, Yancheng Wang, Xinke Deng, Jean Oh, Reid Simmons, Joerg Liebelt, Xiang Kong, Zhongyu Jiang
arXiv AI
Sep 1

Stratified Consistency Distillation for Natural Language Formalization

The paper introduces Stratified Consistency Distillation, a fine‑tuning method to improve natural‑language to logical‑formula translations for neurosymbolic reasoning. It generates multiple candidate translations with a large LLM, clusters them by semantic equivalence, and selects pseudo‑labels using entropy‑based strategies—majority voting for low entropy, LLM-as‑Judge for medium entropy, and unification or abstention for high entropy. The selected pseudo‑labels are then used to fine‑tune a smaller model, yielding significant gains in Pass@K and a new Equivalent Logical Similarity metric.

By Zhichao Hou, Ferhat Erata, Joe Lilien, MohamadAli Torkamani