Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Savkin, Maksim, Goncharov, Mikhail, Gambashidze, Alexander, Chepurova, Alla, Tarasov, Dmitrii, Andriianov, Nikita, Pugacheva, Daria, Konovalov, Vasily, Galichin, Andrey, Oseledets, Ivan
Format: Preprint
Veröffentlicht: 2026
Schlagworte:
Online-Zugang:https://arxiv.org/abs/2606.00683
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
_version_ 1866918533663817728
author Savkin, Maksim
Goncharov, Mikhail
Gambashidze, Alexander
Chepurova, Alla
Tarasov, Dmitrii
Andriianov, Nikita
Pugacheva, Daria
Konovalov, Vasily
Galichin, Andrey
Oseledets, Ivan
author_facet Savkin, Maksim
Goncharov, Mikhail
Gambashidze, Alexander
Chepurova, Alla
Tarasov, Dmitrii
Andriianov, Nikita
Pugacheva, Daria
Konovalov, Vasily
Galichin, Andrey
Oseledets, Ivan
contents Recent progress in the development of language models has been defined by scale, with each generation absorbing more of the world's knowledge into its weights. However, many practical applications benefit more from robust reasoning than from extensive parametric knowledge. In this setting, task-specialized small language models (SLMs) offer a principled design choice. We introduce Optimal Cognitive Core (OCC), a family of SLMs built around this premise. As a variant of OCC, we present OCC-RAG, optimized for faithful question answering (QA) grounded in the provided context. This task directly aligns with the OCC design approach, requiring multi-hop reasoning over supplied passages while ignoring memorized knowledge. To train OCC-RAG, we implement a novel pipeline for synthesizing multi-context, multi-hop QA data at scale, producing a corpus of over three million examples targeting multi-hop reasoning, strict context faithfulness, and calibrated abstention. We release OCC-RAG-0.6B and OCC-RAG-1.7B, both mid-trained on this corpus. The models produce structured reasoning traces with source citations grounded in literal quotes from the context. Through OCC-RAG, we demonstrate that compact, task-specialized SLMs can match or exceed general-purpose models 2 -- 6x their size across multi-hop reasoning (HotpotQA, MuSiQue, TAT-QA), faithfulness (ConFiQA), and refusal (MuSiQue-Un) benchmarks.
format Preprint
id arxiv_https___arxiv_org_abs_2606_00683
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle OCC-RAG: Optimal Cognitive Core for Faithful Question Answering
Savkin, Maksim
Goncharov, Mikhail
Gambashidze, Alexander
Chepurova, Alla
Tarasov, Dmitrii
Andriianov, Nikita
Pugacheva, Daria
Konovalov, Vasily
Galichin, Andrey
Oseledets, Ivan
Computation and Language
Recent progress in the development of language models has been defined by scale, with each generation absorbing more of the world's knowledge into its weights. However, many practical applications benefit more from robust reasoning than from extensive parametric knowledge. In this setting, task-specialized small language models (SLMs) offer a principled design choice. We introduce Optimal Cognitive Core (OCC), a family of SLMs built around this premise. As a variant of OCC, we present OCC-RAG, optimized for faithful question answering (QA) grounded in the provided context. This task directly aligns with the OCC design approach, requiring multi-hop reasoning over supplied passages while ignoring memorized knowledge. To train OCC-RAG, we implement a novel pipeline for synthesizing multi-context, multi-hop QA data at scale, producing a corpus of over three million examples targeting multi-hop reasoning, strict context faithfulness, and calibrated abstention. We release OCC-RAG-0.6B and OCC-RAG-1.7B, both mid-trained on this corpus. The models produce structured reasoning traces with source citations grounded in literal quotes from the context. Through OCC-RAG, we demonstrate that compact, task-specialized SLMs can match or exceed general-purpose models 2 -- 6x their size across multi-hop reasoning (HotpotQA, MuSiQue, TAT-QA), faithfulness (ConFiQA), and refusal (MuSiQue-Un) benchmarks.
title OCC-RAG: Optimal Cognitive Core for Faithful Question Answering
topic Computation and Language
url https://arxiv.org/abs/2606.00683