Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Exact accuracies on miniF2F be presented more clearly? #123

Open
brando90 opened this issue Nov 1, 2022 · 4 comments
Open

Exact accuracies on miniF2F be presented more clearly? #123

brando90 opened this issue Nov 1, 2022 · 4 comments

Comments

@brando90
Copy link

brando90 commented Nov 1, 2022

No description provided.

@brando90
Copy link
Author

brando90 commented Nov 1, 2022

  • autoform: https://arxiv.org/abs/2205.12615 Our methodology results in a new state-of-the-art result on the MiniF2F theorem proving benchmark, improving the proof rate from 29.6% to 35.2%.
  • Guiding an automated prover with these sketches enhances its performance from 20.9% to 39.3% on a collection of mathematical competition problems.

@DyeKuu
Copy link
Contributor

DyeKuu commented Nov 2, 2022

Hi Brando! By exact accuracy you means the accuracy breaking down to each statement, or the sota accuracy like the paper you mentioned here?

@brando90
Copy link
Author

brando90 commented Nov 2, 2022 via email

@DyeKuu
Copy link
Contributor

DyeKuu commented Nov 3, 2022

I can provide several paper that I know reporting accuracies on miniF2F, more or less in chronological order. The list may be incomplete and any fix welcome!

As the accuracies (pass-rate) are usually subject to the computation budget and the language. I only put the number on test split here, for the number of validation split it worth taking a look at the details in these paper.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

2 participants