← Search

Gaolei He

2 accepted papers

2026

From LLM-Generated Conjectures to Lean Formalizations: Automated Polynomial Inequality Proving via Sum-of-Squares Certificates

ICML 2026poster

Automated proving of polynomial inequalities is a fundamental challenge in automated mathematical reasoning, where rich algebraic structure and a rapidly growing certificate search space hinder scalability. Purely symbolic approaches provide strong guarantees but often scale poorly as the number of …

Cited by 0SourceScholar
2025

QDTSynth: Quality-Driven Formal Theorem Synthesis for Enhancing Proving Performance of LLMs

ACL 2025long

Automated Theorem Proving is an important and challenging task. Although large language models (LLMs) have demonstrated remarkable potential in mathematical reasoning, their performance in formal theorem proving remains constrained by the scarcity of high-quality supervised fine-tuning (SFT) data. T…

Cited by 0SourcePDFScholar