arXiv AI

Query-Driven Learning for Lifted Reasoning

The paper introduces query-driven learning for lifted reasoning, aiming to combine learning and reasoning into a single process rather than treating them as separate stages. It extends previous work to the first-order setting and identifies a necessary and sufficient condition called bounded concealment for validating or refuting universal queries with partial data and a knowledge base. A quasi-polynomial-time algorithm is proposed, with soundness and completeness guarantees relative to space-bounded lifted proofs, and quasipolynomial sample and runtime bounds are shown to make lifted query-driven reasoning efficient even when unrestricted knowledge-base learning is not feasible.

arXiv AI
Oct 12

BoundaryEvo: Data-Model Co-Evolution at the Capability Boundary for Long-Chain Reasoning Distillation

BoundaryEvo introduces a two‑stage data‑model co‑evolution framework for distilling long‑chain reasoning from large teacher models into small language models. First, Capability Priming distills a small set of teacher trajectories to give the student an initial reasoning baseline. Then, Capability‑Boundary Co‑Evolution iteratively selects questions the student has not mastered but the teacher can solve, updating the training data as the student’s capability grows. With only 1,000 examples, BoundaryEvo improves Qwen3.5‑4B accuracy from 62.9 % to 75.3 % on IMO‑AnswerBench and from 26.8 % to 46.0 % on AMO‑Bench, outperforming static and dynamic baselines across 11 benchmarks.

By Jiaming Su, Suorong Yang, Xudong Li, Tengchao Yang, Peng Ye
arXiv AI
Aug 28

Do Language Models Follow Occam's Razor? An Evaluation of Parsimony in Inductive and Abductive Reasoning

The paper investigates whether large language models (LLMs) follow Occam's Razor when performing inductive and abductive reasoning. It introduces a synthetic framework for generating questions that require both types of reasoning and a new automated metric to evaluate the simplicity and correctness of generated hypotheses. Experiments show that while LLMs can handle simple scenarios, they struggle with complex world models and producing high‑quality, simplest hypotheses, even when using advanced reasoning techniques.

By Yunxin Sun, Abulhair Saparov
arXiv AI
Oct 2

Learning to Ask: Information Acquisition for SLM-LLM Collaboration, under a budget

The paper proposes a new framework for collaboration between a small language model (SLM) and a large language model (LLM) that treats the interaction as an information acquisition problem under an API budget constraint. Instead of delegating reasoning tasks, the SLM remains the primary reasoner and selectively queries the LLM advisor with targeted questions, using a three-stage RLVR approach to decide when to call the advisor, how to phrase queries, and how to integrate the responses. Experiments on mathematical reasoning and coding tasks show that this strategy improves the performance–cost tradeoff compared to existing baselines and can transfer to other advisor model families without additional training.

By Yongjun Kim, Xiaoxiao Li, Jaeho Lee
arXiv Computation and Language
Sep 10

Benchmarking Hybrid Deep Research Across Database Querying and Web Search

arXiv:2609.09410v1 Announce Type: new Abstract: While autonomous agents have made significant strides in "deep research" by iteratively navigating the open web to synthesize information, real-world p...

By Ruofan Wu, Peiran Xu, Xiaolong Li, Fan Shu, Soyoung Yoon, Yite Wang, Xiaodong Yu, Boyi Liu, Feng Yan, Debiao Li, Yuxiong He, Zhewei Yao
arXiv AI
Sep 7

DODR: Deterministic Operator-Driven Reasoning in Latent Space

The paper introduces DODR, a deterministic operator‑driven reasoning architecture that models reasoning as graph computations in a high‑dimensional linear‑algebraic space, replacing token‑level sampling with matrix operations. Reasoning states are snapshot vectors of semantic units, and three trainable matrix operators—deduction, induction, and abduction—implement Peirce’s inference types. Experiments on 503 records demonstrate near‑perfect deduction, high generalization for induction, and significant gains for abduction, while the design guarantees zero hallucination and supports continual learning.

By Weicai Huang (Beijing MQPat Technologies, Co., Ltd.)
arXiv AI
Jun 30

Beyond Scaling Law: A Data-Efficient Distillation Framework for Reasoning

arXiv:2508. 09883v2 Announce Type: replace-cross Abstract: Large language models (LLMs) demonstrate remarkable reasoning capabilities in tasks such as algorithmic coding and mathematical problem-solving.

By Xiaojun Wu, Xiaoguang Jiang, Huiyang Li, Jucai Zhai, Dengfeng Liu, Qiaobo Hao, Huang Liu, Zhiguo Yang, Ji Xie, Ninglun Gu, Jin Yang, Kailai Zhang, Yelun Bao, Jun Wang
arXiv Computation and Language
Oct 22

HybridResearcher: Bridging the Structured-Unstructured Boundary for Deep Research Agents

arXiv:2610.24899v2 Announce Type: replace-cross Abstract: While LLM agents are increasingly capable of gathering and synthesizing evidence from a single homogeneous source, such as structured tables...

By Soyoung Yoon, Peiran Xu, Han Wang, Ruofan Wu, Xiaodong Yu, Feng Yan, Mohit Bansal, Debiao Li, Seung-Won Hwang, Yuxiong He, Zhewei Yao