- Rating
- 3
- Confidence
- 3
- Informativeness
- 3
- Presentation
- 3
- Soundness
- 3
Read review
Paper summary
This paper presents Peppy, an AI-assisted workflow for discovering tight analytic convergence proofs for first-order optimization algorithms. Peppy combines numerical PEP certificates, the PEP-to-Lyapunov framework, specialized structural-recovery utilities, and a five-stage agent workflow that progresses from PEP implementation. The paper evaluates Peppy on several known optimization results and reports that the generated proofs pass mathematical verification. More importantly, the framework is used to derive new tight convergence results for several previously unresolved cases, including conjectures for FGM, OGM, rational FGM, and FISTA. The paper contributes both a domain-specific workflow for AI-assisted proof discovery and a set of substantive new convergence analyses obtained through this workflow.
Critical strengths
-
The paper demonstrates substantive research-level mathematical contributions. Peppy is used to derive tight analytic convergence results for several previously unresolved settings. In particular, the FGM results provide explicit finite-horizon Lyapunov analyses and are shown to match the corresponding lower bounds. The rational FGM and FISTA results are similarly shown to be tight. This goes beyond recovering standard convergence proofs, as Peppy is also applied to problems with apparently novel analytic results.
-
The workflow is well structured and inspectable. Peppy decomposes proof discovery into explicit stages, including PEP implementation, certificate extraction, Lyapunov construction, structural recovery, and final symbolic completion. The paper clearly distinguishes numerical evidence from a valid analytic proof and is transparent about which parts of the workflow remain heuristic. In particular, the Stage-4 utilities operate on fixed numerical instances, while the authors explicitly acknowledge their dependence on numerical tolerances and on the candidate vector family supplied to the basis search.
Critical weaknesses
- The evaluation does not clearly isolate the benefit of the proposed workflow. The full Peppy pipeline is shown to work well, but it is unclear how much of the gain comes from the five-stage workflow itself versus the strong model, PEP machinery, and domain-specific tools.
- The contribution of Stage 4 is not directly validated. The structural-recovery step is presented as a key novel component. However, the paper does not show how much it improves proof discovery compared with using the same PEP certificate and Gram information without the specialized recovery utilities.
Questions for authors
-
Could the authors compare full Peppy with the same model, tools, mathematical information, and computational budget, but using only a high-level prompt for proof generation? This would help isolate the value of the staged workflow.
-
Could the authors provide an ablation of the Stage-4 structural-recovery mechanism? For example, how does proof success or efficiency change when the agent receives the same PEP certificate and numerical structural information but without the dedicated recovery procedure?
4 comments
W2, Q2
W2. The contribution of Stage 4 is not directly validated. The structural-recovery step is presented as a key novel component. However, the paper does not show how much it improves proof discovery compared with using the same PEP certificate and Gram information without the specialized recovery utilities.
Q2. Could the authors provide an ablation of the Stage-4 structural-recovery mechanism? For example, how does proof success or efficiency change when the agent receives the same PEP certificate and numerical structural information but without the dedicated recovery procedure?
We would first like to clarify that, while the outcomes of individual blocks can be verified separately, the role of Block 4 in the overall proof discovery process is not fully separable from Blocks 2 and 3. As described in Appendix D.2.2, failed basis or reconstruction checks can lead back to Block 3 for alternative groupings and, if needed, Block 2 for different certificates.
In this context, we provided the base model with PEP certificates from successful Peppy runs, but not the resulting partial sums or Peppy's instructions. We conducted one fresh trial for each of the five cases in Section 5 using GPT-6 Astra with Ultra reasoning and access to generic PEPFlow tools. The following table presents representative terms from the Lyapunov functions proposed by the base model.
| Case | Representative terms in the base model's output | Simple, summation-free form presented? |
|---|---|---|
| FGM, Conjecture 4 | No | |
| FGM, Conjecture 5 | No | |
| OGM, Conjecture 4 | No | |
| FGM-rational | No | |
| FISTA-rational | Yes |
The full expressions and notation are provided in the case-specific submission/lyapunov.md files under trials/ in conjectures_b3_baseline.zip, along with the original outputs. These results provide concrete evidence of the value of Peppy's structured guidance in recovering the desired simple, summation-free Lyapunov representations from numerical PEP certificates.
For reference, we also include an experiment that additionally provides the partial sums from a successful Peppy run, but without the dedicated recovery procedure. Interestingly, the base model succeeded in numerically reconstructing the supplied partial sums in all five cases, suggesting that the mathematical structure obtained through Peppy's iterative workflow may play an important role in structural recovery. The corresponding experimental records are provided in conjectures_b4_baseline.zip.
We thank the reviewer again for their thoughtful and constructive feedback, which has helped us clarify the contributions of Peppy and provide additional experimental evidence. We hope that our explanations and new experiments address the reviewer's concerns regarding the value of the staged workflow and its structural-recovery mechanism. We would be happy to discuss any remaining questions.
Thank you for your detailed reply. I have no further questions. I will keep my original score.
Thank you again for your positive review and constructive suggestions. We appreciate your feedback.
We are happy to hear that the reviewer recognized our "substantive research-level mathematical contributions" and found our workflow "well structured and inspectable." We particularly appreciate the reviewer's attention to the "PEP-to-Lyapunov framework" and the reviewer's observation that our paper "clearly distinguishes numerical evidence from a valid analytic proof." We thank the reviewer for their detailed and constructive feedback and address their questions below.
W1, Q1
As discussed in our common response, Peppy contributes both the specification of the desired Lyapunov proof structure and concrete verifiable intermediate steps for obtaining it. The staged workflow also enables researchers to inspect and interact with the discovery process through Jupyter notebooks. Since supporting this interactive environment also requires computational resources, we did not aim to match the total computational budget, focusing instead on the resulting proof structures.
To examine whether a high-level prompt alone could produce the desired Lyapunov representations, we conducted one experiment for each of the five cases in Section 5 using the same Astra Ultra model. We provided the problem statements and target convergence bounds, requesting Lyapunov analyses without Peppy's instructions or numerical PEP inputs. All five runs proposed Lyapunov analyses, but four failed to obtain the desired simple, summation-free form, while FISTA-rational yielded such a representation. The following table presents representative terms from the Lyapunov functions proposed by the base model.
The full expressions and notation are provided in
lyapunov_functions.mdwithinconjectures_high_level_prompt_baseline.zip, along with the original outputs. These results highlight the value of Peppy's structured guidance in obtaining the desired simple, summation-free Lyapunov representations.