Search Results for author:
Found 8 papers, 6 papers with code
Mixtral of Experts
In particular, Mixtral vastly outperforms Llama 2 70B on mathematics, code generation, and multilingual benchmarks.
Ranked #9 on
Question Answering
on PIQA
Multilingual Mathematical Autoformalization
In this work, we create $\texttt{MMA}$, a large, flexible, multilingual, and multi-domain dataset of informal-formal pairs, by using a language model to translate in the reverse direction, that is, from formal mathematical statements into corresponding informal ones.
Llemma: An Open Language Model For Mathematics
We present Llemma, a large language model for mathematics.
Ranked #5 on
Automated Theorem Proving
on miniF2F-test
Mistral 7B
We introduce Mistral 7B v0. 1, a 7-billion-parameter language model engineered for superior performance and efficiency.
Ranked #4 on
Zero-Shot Video Question Answer
on NExT-GQA
Evaluating Language Models for Mathematics through Interactions
There is much excitement about the opportunity to harness the power of large language models (LLMs) when building problem-solving assistants.
Draft, Sketch, and Prove: Guiding Formal Theorem Provers with Informal Proofs
In this work, we introduce Draft, Sketch, and Prove (DSP), a method that maps informal proofs to formal proof sketches, and uses the sketches to guide an automated prover by directing its search to easier sub-problems.
Ranked #3 on
Automated Theorem Proving
on miniF2F-valid
(Pass@100 metric)
Autoformalization with Large Language Models
Autoformalization is the process of automatically translating from natural language mathematics to formal specifications and proofs.
Ranked #1 on
Automated Theorem Proving
on miniF2F-test
(using extra training data)
Thor: Wielding Hammers to Integrate Language Models and Automated Theorem Provers
Thor increases a language model's success rate on the PISA dataset from $39\%$ to $57\%$, while solving $8. 2\%$ of problems neither language models nor automated theorem provers are able to solve on their own.
Ranked #2 on
Automated Theorem Proving
on miniF2F-test
