y0news
AnalyticsDigestsSourcesTopicsRSSAICrypto

#lean4 News & Analysis

5 articles tagged with #lean4. AI-curated summaries with sentiment analysis and key takeaways from 50+ sources.

5 articles
AIBullisharXiv – CS AI · Jun 87/10
🧠

Lean4Agent: Formal Modeling and Verification for Agent Workflow and Trajectory

Lean4Agent introduces a formal verification framework using Lean4, a dependent-type language, to model and verify LLM agent workflows. The system demonstrates 11.94% performance improvement for verification-passing workflows and 7.47% additional gains through LeanEvolve optimization, establishing a new approach to ensuring AI agent reliability.

AIBullisharXiv – CS AI · Jun 17/10
🧠

Distilling LLM Feedback for Lean Theorem Proving

Researchers propose Feedback Distillation, a novel post-training method for language models that improves reasoning tasks by having models learn from their own feedback at the token level. Applied to Lean4 theorem-proving, the approach outperforms standard GRPO methods in trajectory diversity and scalability while complementing existing reinforcement learning approaches.

AINeutralarXiv – CS AI · Jun 236/10
🧠

ForEx: A Formal Verification Framework for Explainable Reasoning in Logical Fallacy Detection and Annotation

Researchers introduce ForEx, a framework that translates LLM-generated explanations into formal logic (Lean4) to verify whether reasoning actually supports predicted labels on logical fallacy detection tasks. The study reveals a critical gap: while 90% of LLM outputs can be formally verified as logically sound, agreement with human annotations remains around 20%, exposing that formal correctness differs fundamentally from label accuracy.

AINeutralarXiv – CS AI · Jun 96/10
🧠

TheoremBench: Evaluating LLMs on Theorem Proving in Formal Mathematics

Researchers introduce TheoremBench, a comprehensive Lean4 benchmark for evaluating large language models on formal mathematics theorem proving. Unlike existing competition-focused benchmarks, TheoremBench assesses how LLMs handle longer, dependency-rich mathematical proofs through both standalone theorems and structured families of related subtasks, revealing that current models remain inefficient and biased toward simpler problems.