arXiv (All)
open access
Peppy: An AI-Assisted Workflow for Tight Convergence Analysis of Optimization Algorithms
This paper presents Peppy, an AI-assisted workflow for discovering tight, analytic convergence proofs for first-order optimization algorithms. Generic approaches to using LLMs to conduct mathematical research target an unspecified, broad spectrum of problems and sometimes use the Lean 4 proof assist
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Growing an Agent/Prover Interface: Evolutionary Tool Design for Cost-Efficient Theorem Proving in Rocq and Lean#1144511
- LLMs as Adaptive Meta-Solvers: Strategy-Diverse RL for Industrial-Scale Optimization#1128697
- Presolve heuristics in HiGHS: implementation and computational study#1037621
- Official Review · NEURIPS 2024#787054
- Double Preconditioning (DoPr): Optimization for Test-Time Performance, not Validation Loss#259467
Record · ID 1130407
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive