Live data from Hacker News

AI solves International Math Olympiad problems at silver medal level

deepmind.google

191–200 of 564 posts

Re: AI solves International Math Olympiad problems at silver medal level

#192
post #181

Earlier quoted context omitted.

A brute force search has perfect knowledge. Calling it "dumb" encourages bad analogies -- it's "dumb" because it doesn't require advanced reasoning. It's also "genius" because it always gets the right answer eventually. It's hugely expensive to run. And you keep shifting the goalpost on what's called "dumb" here.

You might have missed the point.

Tell us what the point was, I think a lot of us are missing it.

Re: AI solves International Math Olympiad problems at silver medal level

#193
post #177

In 1997, machines defeated a World Chess Champion for the first time, using brute-force "dumb search." Critics noted that while "dumb search" worked for chess, it might not necessarily be a general strategy applicable to other cognitive tasks.[a] In 2016, machines defeated a World Go Champion for the first time, using a clever form of "dumb search" that leverages compute, DNNs, reinforcement learning (RL), and self-p…

So all forms of search are dumb in your view?

I think OP is arguing the opposite. In other words, critics of AI innovations call them “dumb search”. The goal post keeps moving.

Re: AI solves International Math Olympiad problems at silver medal level

#194
post #177

In 1997, machines defeated a World Chess Champion for the first time, using brute-force "dumb search." Critics noted that while "dumb search" worked for chess, it might not necessarily be a general strategy applicable to other cognitive tasks.[a] In 2016, machines defeated a World Go Champion for the first time, using a clever form of "dumb search" that leverages compute, DNNs, reinforcement learning (RL), and self-p…

By "dumb" I assume you meant brute-force. Search, as opposed to extrapolation, is what actually produces suprise or creative results, whether it happens in a person's head or on a computer. The issue is to produce the heuristics that can let one push back the combinatorial explosion.

Re: AI solves International Math Olympiad problems at silver medal level

#195
post #177

In 1997, machines defeated a World Chess Champion for the first time, using brute-force "dumb search." Critics noted that while "dumb search" worked for chess, it might not necessarily be a general strategy applicable to other cognitive tasks.[a] In 2016, machines defeated a World Go Champion for the first time, using a clever form of "dumb search" that leverages compute, DNNs, reinforcement learning (RL), and self-p…

The success in Go was very much not dumb search. Where dumb search had failed to achieve the level of even a very weak player, the neural net's "intuition" about good moves without any search was already very strong. Only the combination was superhuman, and that was anything but the dumb search that had been tried before.

Today's announcement is also not about proving Lean theorems by "dumb search". The success is about search + neural networks.

You're attacking critics for criticizing the solution that has failed, while confusing it for the solution that works to this day.

Re: AI solves International Math Olympiad problems at silver medal level

#196

Earlier quoted context omitted.

Can you elaborate on how it makes guesses like this? Does it do experiments before? Is it raw LLM? Is it feedback loop based on partial progress?

"AlphaProof is a system that trains itself to prove mathematical statements in the formal language Lean. It couples a pre-trained language model with the AlphaZero reinforcement learning algorithm, which previously taught itself how to master the games of chess, shogi and Go."

Yeah I am not clear the degree to which this system and LLMs are related. Are they related? Or is AlphaProof a complete tangent to CHatGPT and its ilk?

Re: AI solves International Math Olympiad problems at silver medal level

#198
post #182

Earlier quoted context omitted.

There's no problem with search. The goal is to search most efficiently.

You mean that by improving search we can solve any problem? What if solution field is infinite, even if we make search algo 10x100 more performant, solution field will still be infinite, no?

Gradient descent is a search. Where does it say the search space has to be small?

Re: AI solves International Math Olympiad problems at silver medal level

#199

Earlier quoted context omitted.

The point isn't IMO rules. It's that we are living in a period of time where there are very real consequences of nearly a century of unchecked CO2 due to human industry. And AI (like crypto before it) requires considerable energy consumption. Because of which, I believe we (people who believe in AI) need to hold companies accountable by very transparently disclosing those energy costs.

What if at some point AI figures out a solution to climate change?

[deleted]

Re: AI solves International Math Olympiad problems at silver medal level

#200
post #181
post #177

In 1997, machines defeated a World Chess Champion for the first time, using brute-force "dumb search." Critics noted that while "dumb search" worked for chess, it might not necessarily be a general strategy applicable to other cognitive tasks.[a] In 2016, machines defeated a World Go Champion for the first time, using a clever form of "dumb search" that leverages compute, DNNs, reinforcement learning (RL), and self-p…

A brute force search has perfect knowledge. Calling it "dumb" encourages bad analogies -- it's "dumb" because it doesn't require advanced reasoning. It's also "genius" because it always gets the right answer eventually. It's hugely expensive to run. And you keep shifting the goalpost on what's called "dumb" here.

None of the above are brute force search.
Post reply on HN