paper-with-me

Papers

An In-Context Learning Agent for Formal Theorem-Proving

2023-10-06 · Amitayush Thakur, George Tsoukalas, Yeming Wen, Jimmy Xin, Swarat Chaudhuri

We present an in-context learning agent for formal theorem-proving in environments like Lean and Coq. Current state-of-the-art models for the problem are finetuned on environment-specific proof data. By contrast, our approach, called COPRA, repeatedly asks a high-capacity, general-purpose large language model (GPT-4) to propose tactic applications from within a stateful backtracking search. Proposed tactics are executed in the underlying proof environment. Feedback from the execution is used to build the prompt for the next model query, along with selected information from the search history and lemmas retrieved from an external database. We evaluate our implementation of COPRA on the miniF2F benchmark for Lean and a set of Coq tasks from the CompCert project. On these benchmarks, COPRA significantly outperforms few-shot invocations of GPT-4. It also compares favorably against finetuning-based approaches, outperforming ReProver, a state-of-the-art finetuned approach for Lean, in terms of the pass@1 metric. Our code and data are available at https://github.com/trishullab/copra.

📄 PDF Abstract BibTeX arXiv:2310.04353

Code (1)

trishullab/copra 공식 구현

Tasks

Automated Theorem ProvingIn-Context LearningLanguage ModelingLanguage ModellingLarge Language Model

Methods 이 논문이 사용한 방법론

Multi-Head Attention 설명 없음
Attention 설명 없음
Linear Layer A Linear Layer is a projection $\mathbf{XW + b}$.
Position-Wise Feed-Forward Layer 설명 없음
BPE Byte Pair Encoding, or BPE, is a subword segmentation algorithm that encodes rare and unknown words as sequences of subword units. The intuition is that various word…
Dense Connections Dense Connections, or Fully Connected Connections, are a type of layer in a deep neural network that use a linear operation where every input is connected to every output…
Label Smoothing Label Smoothing is a regularization technique that introduces noise for the labels. This accounts for the fact that datasets may have mistakes in them, so maximizing the…
Adam 설명 없음

Similar Papers 제목 키워드 기반

OProver: A Unified Framework for Agentic Formal Theorem Proving

2026-05-17 · David Ma, Kaijing Ma, Shawn Guo, Yunfeng Shi 외 arxiv

Recent progress in formal theorem proving has benefited from large-scale proof generation and verifier-aware training, but agentic proving is rarely integrated into prover training, appearing only at inference time. We p…

Ax-Prover: A Deep Reasoning Agentic Framework for Theorem Proving in Mathematics and Quantum Physics

2025-10-14 · Benjamin Breen, Marco Del Tredici, Jacob McCarran, Javier Aspuru Mijares 외 arxiv

We present Ax-Prover, a multi-agent system for automated theorem proving in Lean that can solve problems across diverse scientific domains and operate either autonomously or collaboratively with human experts. To achieve…

Automated Theorem ProvingAbstract Algebra

LeanAgent: Lifelong Learning for Formal Theorem Proving

2024-10-08 · Adarsh Kumarappan, Mo Tiwari, Peiyang Song, Robert Joseph George 외

Large Language Models (LLMs) have been successful in mathematical reasoning tasks such as formal theorem proving when integrated with interactive proof assistants like Lean. Existing approaches involve training or fine-t…

Abstract AlgebraAutomated Theorem ProvingLifelong learningMathematical Reasoning

miniCTX: Neural Theorem Proving with (Long-)Contexts

2024-08-05 · Jiewen Hu, Thomas Zhu, Sean Welleck

Real-world formal theorem proving often depends on a wealth of context, including definitions, lemmas, comments, file structure, and other information. We introduce miniCTX, which tests a model's ability to prove formal …

Automated Theorem Proving

Discovering New Theorems via LLMs with In-Context Proof Learning in Lean

2025-09-16 · Kazumi Kasaura, Naoto Onda, Yuta Oriike, Masaya Taniguchi 외 arxiv

Large Language Models (LLMs) have demonstrated significant promise in formal theorem proving. In this study, we investigate the ability of LLMs to discover novel theorems and produce verified proofs. We propose a pipelin…