组合结构的强化生成:拉姆齐数 / Reinforced Generation of Combinatorial Structures: Ramsey Numbers
1️⃣ 一句话总结
这篇论文利用一个名为AlphaEvolve的基于大语言模型的代码变异智能体,成功改进了五个经典拉姆齐数的下界,并表明该单一元算法能够有效生成用于求解多种拉姆齐数下界的搜索算法。
We present improved lower bounds for five classical Ramsey numbers: $\mathbf{R}(3, 13)$ is increased from $60$ to $61$, $\mathbf{R}(3, 18)$ from $99$ to $100$, $\mathbf{R}(4, 13)$ from $138$ to $139$, $\mathbf{R}(4, 14)$ from $147$ to $148$, and $\mathbf{R}(4, 15)$ from $158$ to $159$. These results were achieved using~\emph{AlphaEvolve}, an LLM-based code mutation agent. Beyond these new results, we successfully recovered lower bounds for all Ramsey numbers known to be exact, and matched the best known lower bounds across many other cases. These include bounds for which previous work does not detail the algorithms used. Virtually all known Ramsey lower bounds are derived computationally, with bespoke search algorithms each delivering a handful of results. AlphaEvolve is a single meta-algorithm yielding search algorithms for all of our results.
组合结构的强化生成:拉姆齐数 / Reinforced Generation of Combinatorial Structures: Ramsey Numbers
这篇论文利用一个名为AlphaEvolve的基于大语言模型的代码变异智能体,成功改进了五个经典拉姆齐数的下界,并表明该单一元算法能够有效生成用于求解多种拉姆齐数下界的搜索算法。
源自 arXiv: 2603.09172