paper-with-me

Papers

PBEBench: A Multi-Step Programming by Examples Reasoning Benchmark inspired by Historical Linguistics

2025-05-29 · Atharva Naik, Darsh Agrawal, Manav Kapadnis, Yuwei An, Yash Mathur, Carolyn Rose, David Mortensen

Recently, long chain of thought (LCoT), Large Language Models (LLMs), have taken the machine learning world by storm with their breathtaking reasoning capabilities. However, are the abstract reasoning abilities of these models general enough for problems of practical importance? Unlike past work, which has focused mainly on math, coding, and data wrangling, we focus on a historical linguistics-inspired inductive reasoning problem, formulated as Programming by Examples. We develop a fully automated pipeline for dynamically generating a benchmark for this task with controllable difficulty in order to tackle scalability and contamination issues to which many reasoning benchmarks are subject. Using our pipeline, we generate a test set with nearly 1k instances that is challenging for all state-of-the-art reasoning LLMs, with the best model (Claude-3.7-Sonnet) achieving a mere 54% pass rate, demonstrating that LCoT LLMs still struggle with a class or reasoning that is ubiquitous in historical linguistics as well as many other domains.

📄 PDF Abstract BibTeX arXiv:2505.23126

Code (0)

등록된 구현이 없습니다.

Tasks

Math

Methods 이 논문이 사용한 방법론

Focus 설명 없음
SET Dynamic Sparse Training method where weight mask is updated randomly periodically

Similar Papers 제목 키워드 기반

ReaComp: Compiling LLM Reasoning into Symbolic Solvers for Efficient Program Synthesis

2026-05-06 · Atharva Naik, Yash Mathur, Prakam, Carolyn Rose 외 arxiv

LLMs can solve program synthesis tasks but remain inefficient and unreliable on hard instances requiring large combinatorial search. Given a small set of reasoning traces, we use coding agents to compile them into reusab…

Program Synthesis

Evaluating Step-by-Step Reasoning through Symbolic Verification

2022-12-16 · Yi-Fan Zhang, HANLIN ZHANG, Li Erran Li, Eric Xing

Pre-trained language models (LMs) have shown remarkable reasoning performance using explanations or chain-of-thoughts (CoT)) for in-context learning. On the other hand, these reasoning tasks are usually presumed to be mo…

In-Context Learning

Prompt Selection and Augmentation for Few Examples Code Generation in Large Language Model and its Application in Robotics Control

2024-03-11 · On Tai Wu, Frodo Kin Sun Chan, Zunhao Zhang, Yan Nei Law 외

Few-shot prompting and step-by-step reasoning have enhanced the capabilities of Large Language Models (LLMs) in tackling complex tasks including code generation. In this paper, we introduce a prompt selection and augment…

Code GenerationDiversityGSM8KLanguage Modeling+3

ReasonMed: A 370K Multi-Agent Generated Dataset for Advancing Medical Reasoning

2025-06-11 · Yu Sun, Xingyu Qian, Weiwen Xu, Hao Zhang 외

Though reasoning-based large language models (LLMs) have excelled in mathematics and programming, their capabilities in knowledge-intensive medical question answering remain underexplored. To address this, we introduce R…

Medical Question AnsweringQuestion Answering

Reasoning in Non-Probabilistic Uncertainty: Logic Programming and Neural-Symbolic Computing as Examples

2017-01-18 · Tarek R. Besold, Artur d'Avila Garcez, Keith Stenning, Leendert van der Torre 외

This article aims to achieve two goals: to show that probability is not the only way of dealing with uncertainty (and even more, that there are kinds of uncertainty which are for principled reasons not addressable with p…