PuzzleClone: A DSL-Powered Framework for Synthesizing Verifiable Data (2026.findings-acl)
Copied to clipboard
| Challenge: | Existing datasets with verifiable answers are limited in reliability, diversity, and scalability . a new approach to generate verifikatable data at scale is needed to improve models' performance . |
| Approach: | They propose a formal framework for synthesizing verifiable data at scale using a novel DSL-driven approach. |
| Outcome: | The proposed framework improves performance on a wide range of puzzles and logic benchmarks. |
Similar Papers
SynthRL: Scaling Visual Reasoning with Verifiable Data Synthesis (2026.findings-acl)
Copied to clipboard
| Challenge: | SynthRL synthesizes over 3.3K additional verifiable, challenging questions from approximately 8K seed samples. |
| Approach: | They propose a scalable and guaranteed pipeline for automatic data scaling in reasoning-oriented RL training. |
| Outcome: | The proposed pipeline synthesizes over 3.3K additional verifiable, challenging questions from approximately 8K seed samples. |
KodCode: A Diverse, Challenging, and Verifiable Synthetic Dataset for Coding (2025.findings-acl)
Copied to clipboard
| Challenge: | Existing code-focused resources typically fail to ensure either the breadth of coverage or verifiable correctness. |
| Approach: | They propose a synthetic dataset that provides high-quality, verifiable training data for Large Language Models for coding. |
| Outcome: | The proposed dataset surpasses Qwen2.5-Coder-32B-Instruct and DeepSeek-R1-Distill-Llama-70B in performance on coding benchmarks. |
RV-Syn: Rational and Verifiable Mathematical Reasoning Data Synthesis based on Structured Function Library (2026.findings-eacl)
Copied to clipboard
| Challenge: | Existing methods for generating high-quality reasoning data are limited in quality and availability. |
| Approach: | They propose a method that constructs mathematical operations and generates verifiable graphs that are back-translated into complex problems. |
| Outcome: | The proposed method achieves a 6.3% performance gain over existing methods on LLaMA-3-8B and outperforms others with only half the training data (50k vs. 100k). |
SLR: Automated Synthesis for Scalable Logical Reasoning (2026.acl-long)
Copied to clipboard
Lukas Helff, Ahmad Omar, Felix Friedrich, Antonia Wüst, Hikaru Shindo, Rupert Mitchell, Tim Woydt, Patrick Schramowski, Wolfgang Stammer, Kristian Kersting
| Challenge: | Existing benchmarks intended to evaluate reasoning capabilities emphasize deductive reasoning, where conclusions necessarily follow from given premises. |
| Approach: | They propose an end-to-end framework for systematic evaluation and training of Large Language Models via Scalable Logical Reasoning. |
| Outcome: | The proposed framework doubles Llama-3-8B accuracy on SLR-Bench, achieving parity with Gemini-Flash-Thinking at a fraction of computational cost. |
SATBench: Benchmarking LLMs’ Logical Reasoning via Automated Puzzle Generation from SAT Formulas (2025.emnlp-main)
Copied to clipboard
Anjiang Wei, Yuheng Wu, Yingjia Wan, Tarun Suresh, Huanmi Tan, Zhanke Zhou, Sanmi Koyejo, Ke Wang, Alex Aiken
| Challenge: | SATBench is a benchmark for evaluating the logical reasoning capabilities of large language models (LLMs) through logical puzzles derived from Boolean satisfiability (SAT) problems. |
| Approach: | They propose a benchmark to evaluate logical reasoning capabilities of large language models (LLMs) using logical puzzles derived from Boolean satisfiability problems. |
| Outcome: | The proposed model achieves 65.0% accuracy on hard UNSAT problems, close to the baseline of 50%. |
RiddleBench: A New Generative Reasoning Benchmark for LLMs (2026.findings-eacl)
Copied to clipboard
| Challenge: | Large Language Models (LLMs) show remarkable capabilities, but complex reasoning skills require deeper investigation. |
| Approach: | They propose a benchmark of 1,737 puzzles to test reasoning beyond simple pattern matching. |
| Outcome: | The proposed model performs poorly when faced with reordered constraints or irrelevant information. |
Tool learning via Inference-time Scaling and Cycle Verifier (2025.findings-acl)
Copied to clipboard
| Challenge: | In inference-time scaling, Chain-of-Thought (CoT) data is scarce or even unavailable. |
| Approach: | They propose a method which establishes an inference cycle to synthesize user queries and CoT data. |
| Outcome: | The proposed method achieves a 75.4% pass rate and a 79.6% win rate using small models in StableToolBench. |
AutoDSPy: Automating Modular Prompt Design with Reinforcement Learning for Small and Large Language Models (2025.emnlp-industry)
Copied to clipboard
Nafew Azim, Abrar Ur Alam, Hasan Bin Omar, Abdullah Mohammad Muntasir Adnan Jami, Jawad Ibn Ahad, Muhammad Rafsan Kabir, Md. Ismail Hossain, Fuad Rahman, Mohammad Ruhul Amin, Shafin Rahman, Nabeel Mohammed
| Challenge: | Large Language Models excel at complex reasoning tasks, yet their performance hinges on the quality of their prompts and pipeline structures. |
| Approach: | They propose a framework that fully automates large language models' pipeline construction using reinforcement learning. |
| Outcome: | Experimental results show that autoDSPy outperforms DSPy benchmarks in accuracy gains and time. |
SQLForge: Synthesizing Reliable and Diverse Data to Enhance Text-to-SQL Reasoning in LLMs (2025.findings-acl)
Copied to clipboard
| Challenge: | Existing closed-source LLMs have a performance gap in text-to-SQL reasoning tasks. |
| Approach: | They propose a SQL-based approach to synthesize reliable data to enhance text-to-SQL reasoning in LLMs. |
| Outcome: | The proposed model achieves state-of-the-art accuracy on the widely recognized Spider and BIRD benchmarks, significantly narrowing the performance gap with closed-source methods. |
Crossing the Reward Bridge: Expanding Reinforcement Learning with Verifiable Rewards Across Diverse Domains (2026.acl-long)
Copied to clipboard
| Challenge: | Reinforcement learning with verifiable rewards (RLVR) has been effective on structured tasks, but its reliance on simple, rule-based verifiers creates a bottleneck. |
| Approach: | They propose a framework that uses a generative verifier to provide soft, probabilistic rewards. |
| Outcome: | The proposed framework outperforms existing models up to 10x their size and can be scalable and effective. |