arxiv
PublishedJuly 1, 2026 at 4:00 AM
AI-Assisted Discovery of Convex Relaxations via Dual Agents
Publisher summary· verbatim
arXiv:2606.31182v1 Announce Type: new Abstract: Recent work shows that LLM agents can improve sharp-constant inequalities by searching for extremal constructions, which yield upper bounds. We address the complementary side: a lower bound holds for every admissible function and follows from a convex
Stay posted· Newsletter
A 5-min weekly brief — top movers, price watch, story of the week.
Discussion
No replies yet. Be first.
Related coverage
More from ARXIV
arxivSvarna: An Open Corpus Workbench for Modern Greek14harxivPLURAL: A Global Dataset for Value Alignment14harxivValidating LLMs in social science: Epistemic threats and emerging norms14harxivHow Do I Know What to Say Next? Barenholtz's Autogenerative Theory as an Enrichment of Harrisean Integrationism14hThe Bubble Brief
WEEKLYRead AI insights every Tuesday — top movers, new releases, story of the week.
Originally published on arxiv ↗