wellecks / llemma_formal2formal Goto Github PK

Is that all greedy decoding?

Thank you for your valuable contribution to formal theorem proving. I would like to cite your work but I didn't find a reported result on the pass rate of minif2f-valid. I am sorry I don't have enough resources now to reproduce the results. So I wonder if you have done any evaluation on minif2f-valid. What is the performance? Thank you in advance!

A better architecture might be that the language model can determine possible methods to solve mathematical problems, then perform specific operations to transform the solution of the mathematical problem into a series of thoughts, fill the thought chain, and add generality in the transformation part to make the thinking more divergent, and then the part of filling the thought chain needs to be more accurate

It's a bit like the architecture of chatgpt+mathematica, but the problem with the chatgpt+mathematica architecture is that mathematica is too biased towards hard coding and often reports errors, and chatgpt does not specifically train to split the input of a mathematical problem into step-by-step solutions

I wanted code like this one https://github.com/wellecks/llemma_formal2formal/blob/f96fdb1642b2f21bed85c19640b6f1511abb1116/proofsearch.py but for other proof search algs, any exist?