Earlier quoted context omitted.
So finding Lean proofs can be conceptualized as a zero-sum game? Another basic requirement is that valid moves / inference steps and the winning condition can be efficiently verified using some non-AI algorithm. Otherwise there would not be a reward signal for the reinforcement learning algorithm. This is different from answering most natural language questions, where the answer can't be checked trivially.
I don't think AlphaZero is related to this work, apart from both being NN-based. AlphaZero and its training pipeline fundamentally only works for "chess-like" two-player games, where the agent can play against itself and slowly improve through MCTS.
AI solves International Math Olympiad problems at silver medal level
491–500 of 564 posts
Re: AI solves International Math Olympiad problems at silver medal level
#492This is certainly impressive, but whenever IMO is brought up, a caveat should be put out: medals are awarded to 50% of the participants (high school students), with 1:2:3 ratio between gold, silver and bronze. That puts all gold and silver medalists among the top 25% of the participants. That means that "AI solves IMO problems better than 75% of the students", which is probably even more impressive. But, "minutes for…
Re: AI solves International Math Olympiad problems at silver medal level
#493Earlier quoted context omitted.
It is vastly easier to do the formalization than to actually solve the problem. Any undergraduate with some lean familiarity could do it in minutes.
Disagree! Some problems are much harder than others. If you don't believe me please go formalize P5 in this year imo.
Find n such that p(n) and not p(n-1).
p(n):
exists(f: state -> move) such that solves(f, n)
state: solved | illegal | (k, is_first_move in {T,F}, px in (1,2023), py in (1,2024+1), mapping from x,y to {T,F, ?})
initial_state(n): (n, T, 1, 1, {(x,y) -> ?})
move: U|D|L|R|(x in (1,2023))
power: ((a -> a), integer) -> (a->a)
power(h, 0)(x) = h(x)
power(h, k)(x) = h(power(k-1))(x)
solves(f, n): exists l such that for every board, power(make_move(board, f), l)(initial_state(n)) = solved
board: permutation of (1, 2, 3, ..., 2022+1)
make_move: (board, (state -> move)) -> (state -> state)
make_move(board, f)(solved): solved
make_move(board, f)(illegal): illegal
make_move(board, f)(s = (k, is_first_move, px, py, m))
if is_first_move = T:
if k = 0:
illegal
else if f(s) is a number:
(k, F, f(s), 1, m)
else:
illegal
else:
if f(s) is a number:
illegal
else if py = 2025:
solved
else if board(px) = py and py != 1:
(k - 1, T, px, py, m + {((px, py), T)})
else:
dy = {U:-1,D:1,L:0,R:0}(f(s))
dx = {U:0,D:0,L:-1,R:1}(f(s))
px' = px+dx
py' = py+dy
if px' 2023 or py' 2025:
illegal
(k, F, px', py', m + {((px, py), F)})Re: AI solves International Math Olympiad problems at silver medal level
#494This is certainly impressive, but whenever IMO is brought up, a caveat should be put out: medals are awarded to 50% of the participants (high school students), with 1:2:3 ratio between gold, silver and bronze. That puts all gold and silver medalists among the top 25% of the participants. That means that "AI solves IMO problems better than 75% of the students", which is probably even more impressive. But, "minutes for…
I'd say "welcome to the web" but this was true in 1800s newspapers as well.
Re: AI solves International Math Olympiad problems at silver medal level
#495Theorem proving is a single-player game with an insanely big search space, I always thouht it would be solved long before AGI. IMHO, the largest contributors to AlphaProof were the people behind Lean and Mathlib, who took the daunting task of formalizing the entirety of mathematics to themselves. This lack of formalizing in math papers was what killed any attempt at automation, because AI researcher had to wrestle wi…
> Theorem proving is a single-player game with an insanely big search space, I always thouht it would be solved long before AGI. This seems so weird to me - AGI is undefined as a term imo but why would you expect "producing something generally intelligent" (i.e. median human level intelligence) to be significantly harder than "this thing is better than Terrence Tao at maths"?
In the meantime, while DeepBlue beat the world chess champion, Kasparov, at chess, our best efforts at generalism - LLMs than many (not me!) think are the path to AGI - struggle to play tic tac toe.
Re: AI solves International Math Olympiad problems at silver medal level
#496Re: AI solves International Math Olympiad problems at silver medal level
#497Earlier quoted context omitted.
> need to hold companies accountable by very transparently disclosing those energy costs. And if they do, then what? If it is "too high" do we delay research because we need to keep the world how it is for you? What about all the other problems others face that could be solved by doubling down on compute for AI research?
> And if they do, then what? If it is "too high" do we delay research because we need to keep the world how it is for you? First, it's keeping the world how it is for all of us , not just me. Second, to answer you question, I think that is a decision for all of us to weigh in on, but before we can do that, we must be informed as best as we can. Do sacrifices have to be made for the greater good? Absolutely. Do for-pr…
Re: AI solves International Math Olympiad problems at silver medal level
#498Earlier quoted context omitted.
And while AlphaProof is clearly extremely impressive, it does give the computer an advantage that a human doesn't have in the IMO: nobody's going to be constructing Gröbner bases in their head, but `polyrith` is just eight characters away. I saw AlphaProof used `nlinarith`.
Good. I want my AI to use all the advantages it has to reinvent the landscape of mathematics
The interesting thing about math, or science, and art in general, comparing it to games like chess or go is that science gives you the freedom to continue to excel as a human while in games we have lost the game and/or the league.
Science and art are infinite and no AI can produce infinity.
Re: AI solves International Math Olympiad problems at silver medal level
#499Earlier quoted context omitted.
No. Funny how these discussions too often devolve into semantics lol.
Funny how people don't understand basic logic. If it is a proof in a logic, and the machine checked that proof, it is a proof, no matter that no human actually understands it. A human doesn't need to understand the proof, they just have to understand why the proof is a proof.
Re: AI solves International Math Olympiad problems at silver medal level
#500Earlier quoted context omitted.
I would argue that no actually searchable solution space is really infinite (if only because infinite turing machines can't exist). Finite solution spaces can get more than large enough to be intractable.
What about ℕ? Seems pretty infinite to me, unless with "actually" you mean finite in time and space, which would make your argument a tautology. Or am I missing something?
Even within fairly modest finite limits, you can produce a solution space that cannot be significantly searched with the available finite matter and time available in the observable universe.
Thus, the problem with using search isn't that solution spaces can be infinite, but that finite solution spaces can be unimaginably large.