LLMSR@XLLM25: SWRV: Empowering Self-Verification of Small Language Models through Step-wise Reasoning and Verification

Large language models (LLMs) have demonstrated impressive reasoning capabilities through Chain-of-Thought (CoT) prompting.However, their reasoning processes remain inexplicable and uncontrollable.In this paper, we introduce a Step-Wise Reasoning and Verification (SWRV) framework, designed as a two-stage Parser-Verifier pipeline, that decomposes the reasoning process into discrete inference steps and rigorously validates each one.Our Parser extracts problem constraints and the sequence of reasoning steps from the LLM's output, and our Verifier, either LM-based or powered by a symbolic solver, checks the logical correctness of every step.To ensure robust parsing, we fine-tune a compact LM on a small, high-quality annotation set generated by a more capable LM.Experiments on the LLMSR dataset built atop LogiQA show significant gains over baselines, illustrating the effectiveness of our method for step-wise analysis of LLM reasoning 1 .

Authors

Publication Details

Published
2025-01-01
DOI
https://doi.org/10.18653/v1/2025.xllm-1.29
Primary Topic
Natural Language Processing Techniques
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

LLMSR@XLLM25: SWRV: Empowering Self-Verification of Small Language Models through Step-wise Reasoning and Verification

D. Chen
Natural Language Processing Techniques
article

LLMSR@XLLM25: SWRV: Empowering Self-Verification of Small Language Models through Step-wise Reasoning and Verification

D. Chen
article en

Abstract

Large language models (LLMs) have demonstrated impressive reasoning capabilities through Chain-of-Thought (CoT) prompting.However, their reasoning processes remain inexplicable and uncontrollable.In this paper, we introduce a Step-Wise Reasoning and Verification (SWRV) framework, designed as a two-stage Parser-Verifier pipeline, that decomposes the reasoning process into discrete inference steps and rigorously validates each one.Our Parser extracts problem constraints and the sequence of reasoning steps from the LLM's output, and our Verifier, either LM-based or powered by a symbolic solver, checks the logical correctness of every step.To ensure robust parsing, we fine-tune a compact LM on a small, high-quality annotation set generated by a more capable LM.Experiments on the LLMSR dataset built atop LogiQA show significant gains over baselines, illustrating the effectiveness of our method for step-wise analysis of LLM reasoning 1 .

Openalex Percentile: Top 90%
Natural Language Processing Techniques
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.