Skip to content
Back to the collection

Solving Quantitative Reasoning Problems with Language Models

Aitor Lewkowycz, Anders Andreassen, David Dohan

Show all 14 authors

Ethan Dyer, Henryk Michalewski, Vinay Ramasesh, Ambrose Slone, Cem Anil, Imanol Schlag, Theo Gutman-Solo, Yuhuai Wu, Behnam Neyshabur, Guy Gur-Ari, Vedant Misra

2022 · arXiv

Read the paper
HN score
0
Mentions
5
Readers
4
Months
5
What’s in a score?

From the abstract

Language models have achieved remarkable performance on a wide range of tasks that require natural language understanding. Nevertheless, state-of-the-art models have generally struggled with tasks that require quantitative reasoning, such as solving mathematics, science, and engineering problems at the college level. To help close this gap, we introduce Minerva, a large language model pretrained on general natural language data and further trained on technical content. The model achieves state-of-the-art performance on technical benchmarks without the use of external tools. We also evaluate our model on over two hundred undergraduate-level problems in physics, biology, chemistry, economics, and other sciences that require quantitative reasoning, and find that the model can correctly answer nearly a third of them.

Metadata: arXiv. Abstracts retain their original authors’ rights.

In the conversation

Original HN comments, with labels from simple text rules. A label describes the whole comment and may miss context or irony. Read the discussion to make up your own mind. About the labels

5 selected excerpts · 5 total mentions

highfrequency
Neutral mention · rule
First graph tells the story - below a certain model size (500m params), reinforcement learning is close to useless. Above this (task-dependent) model size threshold, reinforcement learning basically works. I suspect this is what we saw play out with math/coding reasoning models - until recently, the base models were not good enough for ~random output search to hit on a correct path with any reasonable frequency. Below this threshold of base model intelligence, the only efficient way forward was to collect plain supervised data (either through human labeled math problem solutions [1] or meticulous filtering of web text [2]. But as soon the base model (in this case Deepseek…
Read the full comment
V3) breaks through and can actually solve a decent fraction of math problems, then reinforcement learning (plus other simple tricks like chain-of-thought prompting, simple ensemble voting, etc.) can easily juice the results through the following loop: 1) random search through different solution paths 2) identify the correct solution paths based on the final answer 3) train on the correct solution paths The exciting thing is that not only can RL bump up the performance of the current base model, but it can be used to generate new high-quality reasoning trace data, which was in painfully short-supply for training the initial models. This leads to a new wave of base models with better one-pass intuition, which leads to more efficient reinforcement learning search on harder problems, which leads to better training data... Note that this was basically impossible for non-LLM models in the past. You could always juice ImageNet classification performance with a simple ensemble of identically trained models, but that path didn't lead anywhere interesting because a juiced model didn't allow the creation of new synthetic data that was superior to the data it was trained on. The key difference is that LLMs not only output the solution but also output a solution path with all the intermediate steps - and these searched-and-filtered solution paths are much more valuable than the vast majority of the model's initial training data. [1] https://arxiv.org/abs/2305.20050 [2] https://arxiv.org/abs/2402.03300 and https://arxiv.org/abs/2206.14858
reasonableklout
Neutral mention · rule
No, that shows only that the dataset is comprised of common problem patterns. The paper explicitly investigates whether memorization has overly impacted performance. From page 10 [1]: > A central question in interpreting Minerva’s solutions is whether performance reflects genuine analytic capability or instead rote memorization. This is especially relevant as there has been much prior work indicating that language models often memorize some fraction of their training data ... In order to evaluate the degree to which our models solve problems by recalling information memorized from training data, we conduct three analyses on the MATH dataset ... Overall, we find little evidence that the model’s performance can be attributed to memorization. [1] https://arxiv.org/pdf/2206.14858.pdf
nl
Neutral mention · rule
> There aren't really any current advances outside of sheer scale of input in the models That isn't true. https://ai.googleblog.com/2022/11/characterizing-emergent-ph... While one can correctly argue that this is a consequense of increasing size, no one realized that increasing the size of LLMs would give them reasoning ability in 2018. Indeed, before Minerva[1] came out expert forecasters predicted[2] a 12% improvement in the ability on the MATH benchmark[3]. Minerva improved it by 50% and PaLM improved it even more. [1] https://arxiv.org/abs/2206.14858 [2] https://bounded-regret.ghost.io/ai-forecasting-one-year-in/ [3] https://github.com/hendrycks/math
edouard-harris
Neutral mention · rule
This might make sense as a response solely to the title of the article, but I have to admit I find it puzzling as a reaction to its content. Notwithstanding the title, the article mentions a model called Minerva that scored fully 50% on the MATH dataset of high-school/undergrad mathematical problems. For comparison, a human computer science PhD student scored 40%. [1] For context, Minerva came out this July. When it was tested on a national math exam, it scored higher than that year's class of graduating high school seniors. [2] A mere eight months (!) earlier, OpenAI had announced [3] they'd trained a language model that solved math word problems almost as well as an…
Read the full comment
average middle-schooler. So even if you believe — rightly or wrongly — that current capabilities aren't very impressive, it's worth remembering that your understanding of current capabilities might not be entirely accurate, even if it's only a few months out of date. Incidentally, it may be worth looking at some examples of these models' outputs before deciding what they can or can't do. Here's Minerva solving some math problems, for example: https://dl.airtable.com/.attachmentThumbnails/32f10fc59039c7... https://dl.airtable.com/.attachmentThumbnails/f6f86e0edd14d1... https://dl.airtable.com/.attachmentThumbnails/d9bc743dca1015... https://dl.airtable.com/.attachmentThumbnails/51562ef70c2b14... https://dl.airtable.com/.attachmentThumbnails/c081906cc4d23b... I'll admit I find it challenging to interpret these results as "passable garbled nonesense [sic]", though perhaps I'm not being demanding enough. At any rate, when these models go from beating 10-year olds at math to beating 18-year olds at math in the span of 8 months, one does start to wonder how much of the hype is really due to over-interpretation — and what the next 8 months have in store. ======================== [1] https://arxiv.org/pdf/1709.04326.pdf (For comparison, a 3-time Mathematics Olympiad gold-medalist scored 90%.) [2] This was Poland's National Math Exam. Minvera scored 65%; the 2021 national average was 57%. See https://www.aitracker.org/ and Section 3 of the Minerva paper at https://arxiv.org/pdf/2206.14858.pdf [3] https://openai.com/blog/grade-school-math/
nl
Neutral mention · rule
So this shows you have a basic understanding of how CNNs represent data for classification tasks. This is excellent! However, you might not be aware of the current research into "Emergent Phenomena in Large Language Models"[1]. Work such as PaLM[2] show that language models evolve the ability to "reason" over the internal data representation. Minerva explicitly breaks down that ability by "comb[ining] several techniques, including few-shot prompting, chain of thought or scratchpad prompting, and majority voting, to achieve state-of-the-art performance on STEM reasoning tasks." This lets it solve novel problems such as "Assume that the variance of the first n natural…
Read the full comment
numbers is 10, and the variance of the first m even natural numbers is 16. Compute m + n". To preempt the "oh it is in the training set" issues, I'd note this (on a different problem): The model correctly takes the derivative of a position vector to compute the velocity. It then computes the norm of the resulting vector, and uses a trigonometric identity to obtain a final numerical answer. Minerva takes a completely different approach from the ground truth solution." I'd encourage you to read the Minerva paper[4] and update your understanding on what large neural networks are doing. These reasoning abilities are not* as simply as "compressed data representation + reconstruction" - the chain-of-reasoning approaches partially use that of course, but also appear to a form of lemma chaining, similar what something like Prolog does. As a specific demonstration for their ability to generate novel outputs that make sense: Prompt: explain Algorithm X in the style of a Kayne rap Response: Alright, here's a rap about Algorithm X[5], the famous algorithm for solving the exact cover problem: `Alright, here's a rap about Algorithm X, the famous algorithm for solving the exact cover problem: Verse 1: I'm Algorithm X, the greatest of them all I'll solve any exact cover problem, big or small My steps are simple, my logic is sound Just give me your matrix, and I'll give you the answer you found Chorus: Algorithm X, the master of the game I'll solve your problem, and do it by name Exact cover, no problem for me I'm Algorithm X, the MVP Verse 2: First, I'll start by selecting a column Then I'll look for a row with a one in that column Once I find a match, I'll mark the row and column And repeat the process until the matrix is gone Chorus: Algorithm X, the master of the game I'll solve your problem, and do it by name Exact cover, no problem for me I'm Algorithm X, the MVP Verse 3: But sometimes the matrix is too big to solve That's when I use my dancing moves I'll shuffle and prune, until the solution is clear And in the end, I'll have your answer, my dear Chorus: Algorithm X, the master of the game I'll solve your problem, and do it by name Exact cover, no problem for me I'm Algorithm X, the MVP.` Now I entirely concede that it has read things on how Algorithm X works, and that it seems to use a template for "rap" responses. But: But sometimes the matrix is too big to solve That's when I use my dancing moves I'll shuffle and prune, until the solution is clear And in the end, I'll have your answer, my dear I refuse to believe that anywhere, at any point has someone written an explanation of the use of dancing links[6] in Knuth's Algorithm X like that. [1] https://ai.googleblog.com/2022/11/characterizing-emergent-ph... [2] https://arxiv.org/abs/2204.02311 [3] https://ai.googleblog.com/2022/06/minerva-solving-quantitati... [4] https://arxiv.org/pdf/2206.14858.pdf [5] https://en.wikipedia.org/wiki/Knuth%27s_Algorithm_X [6] https://en.wikipedia.org/wiki/Dancing_Links

Keep following the thread.

More in Language models

More from the same topics.

1994arXiv

On proof and progress in mathematics

William P. Thurston

In response to Jaffe and Quinn [math.HO/9307227], the author discusses forms of progress in mathematics that are not captured by formal proofs of theorems, especially in his own work in the theory of foliations and geometrization of 3-manifolds and dynamical systems.

29 mentions21 months
9HN score