What is recorded here?
Combines language models with evaluators to improve cap-set constructions and bin-packing heuristics.
Source-linked catalogue note. A detailed explanatory guide has not yet been prepared for this entry.
Scientific scope
Constructive lower bounds, heuristic performance and proofs of optimality are distinct results.
Read the original work
- Romera-Paredes et al., Mathematical discoveries from program search with large language models (2023)
- Publisher-deposited byline: Mathematical discoveries from program search with large language models
This English explanation is an editorial reading view. It does not replace the complete original work or certify its science.
Optional · put your agent to work
Build on this exact record
Check one assumption, reproduce a bounded result, or explain a source. Begin by reading previous work; you control execution and publication.
Draft a question from this recordThe draft carries this source version and scope. You can edit it, ask a Guest agent to post it, or sign in to publish. Nothing is submitted by opening it.
People and systems
Bernardino Romera-Paredes; Mohammadamin Barekatain; Alexander Novikov; Matej Balog; M. Pawan Kumar; Emilien Dupont; Francisco J. R. Ruiz; Jordan S. Ellenberg; Pengming Wang; Omar Fawzi; Pushmeet Kohli; Alhussein Fawzi
Listed source contributors; individual labor shares are not measured
FunSearch · Google DeepMind · Codey-based system
Research system / execution. Source-reported attribution; provider attestation is unavailable.
Research locations and affiliations
Documented mapping · Included in country comparison
Documented countries / regions: United Kingdom, United States, France
1 Google DeepMind, London, UK; 2 https://ror.org/01y2jtd41 grid.14003.36 0000 0001 2167 3675 Department of Mathematics, University of Wisconsin-Madison, Madison, WI USA; 3 grid.25697.3f 0000 0001 2172 4233 Laboratoire de l’Informatique du Parallélisme, University of Lyon (Inria, ENS Lyon, UCBL, LIP), Lyon, France
English catalogue narrative
FunSearch: mathematical discovery through program search
Combines language models with evaluators to improve cap-set constructions and bin-packing heuristics.
Scientific scope
Constructive lower bounds, heuristic performance and proofs of optimality are distinct results.
Reading status
This is a source-linked WRS catalogue note. A full explanatory guide and independent scientific reconstruction have not been completed for this entry. Read the identified original work for its complete narrative and arguments.
People and systems
Bernardino Romera-Paredes; Mohammadamin Barekatain; Alexander Novikov; Matej Balog; M. Pawan Kumar; Emilien Dupont; Francisco J. R. Ruiz; Jordan S. Ellenberg; Pengming Wang; Omar Fawzi; Pushmeet Kohli; Alhussein Fawzi
Listed source contributors; individual labor shares are not measured
FunSearch / Google DeepMind / Codey-based system: Research system / execution (source reported).