FLARE: Verifying MILP Reformulations with LLM-Based Theorem Proving
3 experts across 3 network communities independently surfaced this.
“Paper: arxiv.org/abs/2608.25220 Code + benchmark: flare.henryrobbins.com Led by my student Henry Robbins, with @lawlessopt.bsky.social and Madeleine Udell. Benchmark: 20 problems, 109 formulations, 63 valid pairs with Lean proofs, and 26 invalid pairs.”
“FLARE is a framework that uses large language models and automated theorem proving to verify mixed-integer linear programming reformulations with 100% accuracy on NP-hard problems, transforming optimization modeling and enhancing trust in AI solutions. http…”