An improved example for an autoconvolution inequality
Christopher Boyer, Zane Kun Li

TL;DR
This paper presents a new nonnegative step function with 575 intervals that improves the lower bound of a specific autoconvolution inequality, surpassing previous results obtained by AlphaEvolve, using optimization techniques.
Contribution
The authors introduce a significantly improved example for an autoconvolution inequality using optimization methods, surpassing prior bounds achieved by AlphaEvolve.
Findings
Achieved a lower bound of 0.901564 for the autoconvolution inequality.
Used simulated annealing and gradient methods instead of large language models.
Demonstrated the effectiveness of optimization techniques in mathematical inequality improvements.
Abstract
We give a nonnegative step function with 575 equally spaced intervals such that This improves upon a recent result of Deepmind's AlphaEvolve, which found a nonnegative step function with 50 equally space intervals for which the left hand side is . Our function was found using simulated annealing and gradient based methods rather than using large language models.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsStochastic Gradient Optimization Techniques · Gaussian Processes and Bayesian Inference · Mathematical Analysis and Transform Methods
