Learning to Find Proofs and Theorems by Learning to Refine Search Strategies: The Case of Loop Invariant Synthesis
cs.AI
Submitted: 2022-05-27
Updated: 2022-10-17
Journal ref: Advances in Neural Information Processing Systems, volume 35 (2022) 4843--4856
DOI: 10.52202/068431-0350
Project page: https://dselsam.github.io/IMO-GC-battle-of-ideas
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Terminology
Sources
- Learning to Reason in Large Theories without Imitation
- Accelerating Self-Play Learning in Go
- Universal Policies for Software-Defined MDPs
- Learning to Prove from Synthetic Theorems
- Generative Language Modeling for Automated Theorem Proving
Related papers
- MAVEN-T: Reinforced Heterogeneous Distillation for Real-Time Multi-Agent Trajectory Prediction
- Model Discovery Agent: LLM-assisted Bayesian experiment design for data-efficient discovery of mechanistic world models
- The Clinician's Veto: Navigating Trust, Liability, and Uncertainty in Autonomous AI Prescribing
- MindHelper: Closed-Loop Embodied Mental-State Reasoning for Precision Intervention
- Incumbent Advantage: Brand Bias and Cognitive Manipulation Dynamics in LLM Recommendation Systems
- VSAL: A Vision Solver with Adaptive Layouts for Graph Property Detection