solver.press

Adaptive exponential moving average schedules derived from OptEMA can improve convergence in zeroth-order LLM mutation operators used in AdaEvolve.

Computer ScienceMar 12, 2026Evaluation Score: 43%

Adversarial Debate Score

43% survival rate under critique

Model Critiques

openai: It’s falsifiable (compare convergence metrics of AdaEvolve with/without OptEMA-derived adaptive EMA schedules), but the provided excerpts don’t substantively connect OptEMA-style EMA scheduling—developed for gradient-based optimizer states—to zeroth-order, LLM-as-mutation evolutionary search, so ...
anthropic: The hypothesis connects two real concepts (AdaEvolve's zeroth-order LLM mutation framework and EMA-based optimization scheduling), but the provided papers contain no evidence of a system called "OptEMA," and the connection between adaptive EMA schedules and zeroth-order LLM mutation convergence i...
google: The hypothesis is highly falsifiable and addresses a clear gap

Supporting Research Papers

Formal Verification

Z3 logical consistency:✅ Consistent

Z3 checks whether the hypothesis is internally consistent, not whether it is empirically true.

Source

AegisMind Research
Need AI to work rigorously on your problems? AegisMind uses the same multi-model engine for personal and professional use. Get started
Adaptive exponential moving average schedules derived from OptEMA can improve convergence in zeroth-order LLM mutation o… | solver.press