REVIEW 13 cited by
PatternBoost: Constructions in Mathematics with a Little Help from AI
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original abstract
We introduce PatternBoost, a flexible method for finding interesting constructions in mathematics. Our algorithm alternates between two phases. In the first ``local'' phase, a classical search algorithm is used to produce many desirable constructions. In the second ``global'' phase, a transformer neural network is trained on the best such constructions. Samples from the trained transformer are then used as seeds for the first phase, and the process is repeated. We give a detailed introduction to this technique, and discuss the results of its application to several problems in extremal combinatorics. The performance of PatternBoost varies across different problems, but there are many situations where its performance is quite impressive. Using our technique, we find the best known solutions to several long-standing problems, including the construction of a counterexample to a conjecture that had remained open for 30 years.
Forward citations
Cited by 13 Pith papers
-
New bounds for double covers of the discrete box {0,1,2}^d
First nontrivial lower bounds for double covers of {0,1,2}^d: f(4)≥19, f(5)≥33, f(6)≥60 (Lean-checked), with upper bounds f(6)≤81 and asymptotic constant improved to 8/7.
-
A ChatGPT-assisted Triangle Characterization of Affine Permutation Inversion Graphs
Weighted tournaments satisfying the zero-weight condition and Boolean triangle condition on shifted edge weights are exactly the affine inversion graphs.
-
The Minkowski grid has robustly many repeated distances
There exist n-point planar sets where every subset A has a distance occurring ≥|A|²/n^{1−δ} times, confirming Erdős's 1980 isosceles-triangle conjecture and answering a repeated-distance question negatively.
-
Improved Upper Bounds for Slicing the Hypercube
All edges of the n-dimensional hypercube can be sliced with at most 4n/5 hyperplanes (with a small odd-multiple-of-5 exception), improving the 1971 Paterson bound of 5n/6 via an explicit 8-hyperplane slicing of Q10.
-
Improved lower bounds on the maximum size of graphs with girth 5
A new hill-climbing algorithm improves the best known lower bounds on ex(n;{C3,C4}) for all n in {74,...,198} except n = 96,97.
-
Neural Discovery in Mathematics: Do Machines Dream of Colored Planes?
A neural network relaxation of geometric coloring constraints produced new plane colorings, including an almost 5-coloring covering all but 3.74% of the plane, improving known bounds for Hadwiger-Nelson variants.
-
A Note on Small Percolating Sets on Hypercubes via Generative AI
New upper bounds for bootstrap percolation on hypercubes: an AI-inspired construction improves the second-order term for r at least 5, and a 122-element percolating set is found for the 13-dimensional cube with threshold 4.
-
LemmaBench: A Live, Research-Level Benchmark to Evaluate LLM Capabilities in Mathematics
A live benchmark auto-extracts self-contained lemmas from recent arXiv papers and finds top LLMs solve only 10–15% at pass@1.
-
Using Reasoning Models to Generate Search Heuristics that Solve Open Instances of Combinatorial Design Problems
LLM-generated search heuristics run through the CPro1 protocol with the reasoning model o3-mini-high produced verified constructions resolving open instances in 7 Handbook design families and newer problems.
-
Self-Improving Transformers Overcome Easy-to-Hard and Length Generalization Challenges
Iterative self-training on a model's own correct outputs, with simple length and voting filters, lets transformers generalize to far longer arithmetic and path-finding problems than they saw in training.
-
Formal Mathematical Reasoning: A New Frontier in AI
Machine-checkable formal proof should become the backbone of AI mathematics, and a five-task, five-level capability roadmap can measure progress toward that goal.
-
LLM Framework for Discovering Major Mathematical Conjectures: AI's Quest for the Next Riemann Hypothesis
The paper's claim of pipeline-validated 'major conjecture' discovery is unsupported: the Lean statements are uninterpreted placeholders and the quality scores are self-assigned by the generating model.
-
Reinforcement learning for graph theory, Parallelizing Wagner's approach
A parallelized RL search over graphs produces three new counterexamples to conjectured Laplacian spectral radius bounds, alongside a speedup claim that is only weakly supported.
Discussion (0). Continue with ORCID to comment.