Will mathematical theorem proving solved by scaling laws?
Add to your list(s)
Download to your calendar using vCal
If you have a question about this talk, please contact nobody.
BPRW03 - Big proof: formalizing mathematics at scale
Recent advances in generative models and reinforcement learning have enabled automatic theorem proving beyond the capabilities of classical methods. Scaling up data, model size, and inference compute has undeniably allowed us to prove more theorems. But is scaling alone enough to solve mathematical theorem proving? If not, what essential components might still be missing?
This talk is part of the Isaac Newton Institute Seminar Series series.
This talk is included in these lists:
Note that ex-directory lists are not shown.
|