定理证明论文趋势 2023–2026
自动证明
统计范围：NeurIPS、ICLR、ICML、CVPR 四个会议，2023–2026 年，共 80 篇被归入该主题的论文。
主要结论
- 定理证明论文从 2023 年的 3 篇增长到 2026 年的 38 篇，三年间扩大到约 13 倍。
- ICLR 是发定理证明论文最多的会议，2023–2026 年共 32 篇，占四个会议总量的 40%。
- 交叉方向里涨得最快的是数学推理：同时属于两个主题的论文从 2023 年的 1 篇增至 2026 年的 16 篇。
- 在「程序综合」的 5 个主题里，它的 2026 年论文数排第 3；同组增长最快的形式验证 ML是 3.7 倍，定理证明是 13 倍。
各会议论文数
按年份和会议统计
| 年份 | NeurIPS | ICLR | ICML | CVPR | 合计 |
|---|---|---|---|---|---|
| 2023 | 0 | 2 | 1 | 0 | 3 |
| 2024 | 8 | 8 | 3 | 0 | 19 |
| 2025 | 9 | 7 | 3 | 1 | 20 |
| 2026 | 6 | 15 | 17 | 0 | 38 |
代表论文
按年份和会议均匀挑选，方便快速看到每一届的样貌
- NeurIPS 2026A Theoretical Framework for Self-Play Theorem Proving Algorithms
- ICML 2026Automated Formal Proofs of Combinatorial Identities via Wilf–Zeilberger Guidance and LLMs
- ICLR 2026LoC-Decomp: LLM Autoformalization via Logical Concept Decomposition and Iterative Feedback Correction
- NeurIPS 20253D-Prover: Diversity Driven Theorem Proving With Determinantal Point Processes
- ICML 2025Position: Trustworthy AI Agents Require the Integration of Large Language Models and Formal Methods
- ICLR 2025Alchemy: Amplifying Theorem-Proving Capability Through Symbolic Mutation
- CVPR 2025Automated Proof of Polynomial Inequalities via Reinforcement Learning
- NeurIPS 2024FVEL: Interactive Formal Verification Environment with Large Language Models via Theorem Proving
- ICML 2024Position: The No Free Lunch Theorem, Kolmogorov Complexity, and the Role of Inductive Biases in Machine Learning
- ICLR 2024A Characterization Theorem for Equivariant Networks with Point-wise Activations
- ICML 2023Extending Conformal Prediction to Hidden Markov Models with Exact Validity via de Finetti's Theorem for Markov Chains
- ICLR 2023Formal Mathematics Statement Curriculum Learning
- NeurIPS 2026Compositional Generalization Certificates via the Van Kampen Theorem
- ICML 2026Editable Proof Sketch for Automated Theorem Proving
- ICLR 2026Premise Selection for a Lean Hammer
- NeurIPS 2025Ineq-Comp: Benchmarking Human-Intuitive Compositional Reasoning in Automated Theorem Proving of Inequalities
- ICML 2025ProofAug: Efficient Neural Theorem Proving via Fine-grained Proof Structure Analysis
- ICLR 2025ImProver: Agent-Based Automated Proof Optimization
- NeurIPS 2024Proving Olympiad Algebraic Inequalities without Human Demonstrations
- ICML 2024Subgoal-based Demonstration Learning for Formal Theorem Proving
全部定理证明论文
共 9 篇，第 1 / 1 页
- NeurIPS 20253D-Prover: Diversity Driven Theorem Proving With Determinantal Point Processes
- NeurIPS 2025ATLAS: Autoformalizing Theorems through Lifting, Augmentation, and Synthesis of Data
- NeurIPS 2025Bootstrapping Hierarchical Autoregressive Formal Reasoner with Chain-of-Proxy-Autoformalization
- NeurIPS 2025CLEVER: A Curated Benchmark for Formally Verified Code Generation
- NeurIPS 2025Ineq-Comp: Benchmarking Human-Intuitive Compositional Reasoning in Automated Theorem Proving of Inequalities
- NeurIPS 2025miniF2F-Lean Revisited: Reviewing Limitations and Charting a Path Forward
- NeurIPS 2025MPS-Prover: Advancing Stepwise Theorem Proving by Multi-Perspective Search and Data Curation
- NeurIPS 2025Reviving DSP for Advanced Theorem Proving in the Era of Reasoning Models
- NeurIPS 2025Tree-Based Premise Selection for Lean4
在 Claude、Cursor 里直接问这个趋势
接上 Paperlist MCP 后，写综述、挑方向或准备投稿时，不用离开对话框就能拿到这页的数字：每年各会议的论文数、增长倍数、涨得最快的子方向和代表论文，AI 会按你的问题整理。
可以直接复制这句话问 AI
用 paperlist 查定理证明在 ICLR 2023–2026 的论文趋势，哪一年涨得最快？
AI 会调用的工具：get_topic_stats {"topic": "theorem-proving"}
常见问题
- 2023–2026 年四大会议一共有多少篇定理证明论文？
- 共 80 篇，按年份分别是 2023 年 3 篇、2024 年 19 篇、2025 年 20 篇、2026 年 38 篇。
- NeurIPS 2026 有多少篇定理证明论文？
- NeurIPS 2026 有 6 篇定理证明论文，上一届是 9 篇。
- ICLR 2026 有多少篇定理证明论文？
- ICLR 2026 有 15 篇定理证明论文，上一届是 7 篇。
- ICML 2026 有多少篇定理证明论文？
- ICML 2026 有 17 篇定理证明论文，上一届是 3 篇。
- CVPR 2025 有多少篇定理证明论文？
- CVPR 2025 有 1 篇定理证明论文。
- 哪个会议的定理证明论文最多？
- ICLR，2023–2026 年共 32 篇。