- Rating
- 1
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 1
- Soundness
- 2
Read review
Paper summary
This paper proposes an AI–Math–AI framework that searches over mathematical formulations and solution procedures for automated algorithm discovery. Experiments on visual-token reduction demonstrate improvements over evolutionary baselines and existing token-selection methods across multiple benchmarks and model backbones.
Critical strengths
-
The AI–Math–AI framework is well structured, connecting mathematical formulations, solution procedures, and executable algorithms in a clear workflow.
-
The framework achieves better discovery scores than the evaluated evolutionary baselines, while the discovered algorithms consistently outperform existing visual-token reduction methods across multiple benchmarks and token budgets.
-
The discovered algorithms demonstrate improvements across different model backbones and have interpretable mathematical mechanisms.
Critical weaknesses
-
Its methodological novelty appears limited, as the main components largely build on existing techniques. The discovered algorithms also largely build on established mathematical methods, leaving the distinctive methodological contribution insufficiently demonstrated.
-
The direct-mutation ablation removes multiple components simultaneously, making it difficult to isolate the contribution of mathematical formulation search, which is the paper's central methodological contribution.
-
The search comparisons are matched by the number of attempts but not by total computational cost, and the evolutionary baselines lack comparable extended-budget evaluations. Furthermore, the reliance on single search runs makes it difficult to assess the stability of the reported improvements.
-
The writing is fragmented, and the overall presentation would benefit from further improvement in clarity and coherence.
Questions for authors
-
To isolate the contribution of mathematical formulation search, I encourage the authors to include a controlled ablation that removes only the formulation-search step while keeping all other components unchanged.
-
The paper uses different search budgets across experiments, and the connection between the algorithm discovery results and the final downstream evaluation requires further clarification. The comparison with existing discovery methods is limited to 150 attempts, whereas the final evaluated algorithms were obtained from substantially longer searches. Could the authors clarify whether the proposed framework would still outperform competing discovery methods under comparable extended search budgets?
-
How does the framework compare with the evolutionary baselines under matched total computational cost (e.g., tokens, API calls, or wall-clock time), including extended-budget runs for the baselines? Results averaged over multiple independent search runs, with variance reported, would also help establish whether the improvements are stable.