{"id":"b405fffa-5aa8-4c3f-841c-d8e46de7de02","arxiv_id":"1908.08014","paper_version":1,"verdict":"REJECT","confidence":"MODERATE","novelty_score":5.0,"correctness_risk":"high","formal_verification":"none","parameter_count":5,"one_line_summary":"A graph-based adaptive operator selection mechanism updates strategy transition weights from population diversity changes, yielding benchmark results that are never compared against a baseline.","lead":"This paper proposes an evolutionary algorithm that switches between 20 crossover and mutation strategies using a graph whose edge weights are tuned by how population diversity changes. The authors report near-zero errors on several continuous benchmark functions in 40 dimensions, but provide no comparison to other optimizers.","discovery_kind":"new_method","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Reported exact-zero results in Table 1 are implausible and cannot be reproduced from the underspecified method; the central claim of very good results lacks credible empirical support.","rationale":"The reader's weakest assumption focused on the load-bearing heuristic that increasing Euclidean population diversity improves final solution quality, and on the under-specified selection rule. I agree the algorithm is too underspecified to reproduce. However, the most load-bearing concern about the paper's central empirical claim is not just the heuristic's plausibility but the credibility of Table 1 itself: exact-zero means and standard deviations across 100 runs in D=40 for several nontrivial functions are inconsistent with known difficulty and with the same setup's nonzero results on other functions. This concern is concrete, testable, and, if it lands, directly invalidates the claim that the algorithm 'obtains very good results.' It strengthens the reader's REJECT verdict, but does not require moving to a different verdict category, so I recommend UNCHANGED.","tokens_in":3907,"tokens_out":3876,"duration_ms":43016,"concrete_test":"Obtain the authors' implementation or re-implement the algorithm from Section 2 (requiring resolution of the undefined p and posterior-maximum selection) and run exactly the Table 1 protocol: D=40, pop=50, 40,000 function evaluations, 100 runs, CR=0.7, MU=0.3, delta=20, N=20 strategies. Record the mean and standard deviation of the best-so-far per run at the same precision. If any function reported as 0.000 (0.000) yields a nonzero mean or a nonzero standard deviation, the exact-zero entries are not reproducible. Also verify which statistic is actually reported (best final average individual versus best-so-far) and whether the Michalewicz optimum is correctly shifted to 0 for the variant used.","verdict_should_be":"UNCHANGED","load_bearing_attack":"Table 1 reports 0.000 (0.000) for eight functions, including Sphere, Schwefel 2.21, Elliptic, Griewank, Inverted cosine mixture, Levy and Montalvo 2, and Alpine, over 100 runs in D=40 with only 40,000 function evaluations and pop=50. A mean and standard deviation of exactly 0.000 means every run reached the global optimum to the reported precision. This is not credible for the ill-conditioned Elliptic or the multimodal Griewank/Alpine/Levy-Montalvo 2, especially while the same protocol leaves Neumaier 3 and Periodic far from the optimum. The algorithm description in Section 2 is also incomplete: the update rule refers to an undefined variable p and to bounds max(0,p) and min(p,0), and the 'posterior maximum' selection rule is not specified. Consequently, the reported exact zeros cannot be checked by an independent implementation as written. If these entries arise from a rounding artifact, from a different statistic than claimed, or from a software bug, the central empirical claim of obtaining very good results is unsupported.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper proposes a graph-based adaptive evolutionary algorithm for continuous optimization. The core idea is to model strategies (pairings of crossover and mutation operators) as nodes of a graph, with arc weights updated according to measured changes in population diversity; every δ generations the strategy is re-selected according to a rule described as the 'posterior maximum'. The authors report results on 12 benchmark functions in dimension D=40 with 40,000 function evaluations, claim 'very good results', and briefly compare the computation time of their method with that of a classical evolutionary algorithm.","tokens_in":4093,"tokens_out":2551,"duration_ms":27785,"significance":"If substantiated, the paper would offer a low-complexity adaptive operator-selection mechanism that maintains population diversity without many tunable parameters. However, as presented the contribution is not assessable: the algorithm is underspecified, the empirical evaluation lacks baselines and statistical tests, and several reported results are implausible as stated. The paper does not provide code, proofs, or a parameter-free derivation, and the reported exact-zero results cannot be independently checked from the description. Consequently, the significance of the claimed contribution is low at this stage.","major_comments":[{"comment":"The core mechanism is underspecified. The weight update rule states that diversity difference 'a' is 'bounded between max(0,p) and min(p,0)', but the variable 'p' is never defined, and the rule for increasing or decreasing the weight is not stated in a way that can be implemented. The 'posterior maximum' principle used for strategy selection is mentioned but not formalized. Since this adaptation mechanism is the central contribution, an independent implementation is impossible as written.","section":"Section 2"},{"comment":"The reported exact zeros are not credible as stated. A mean and standard deviation of exactly 0.000 over 100 runs means every run reached the global optimum to the reported precision for eight functions, including the ill-conditioned Elliptic function and the multimodal Griewank, Alpine, and Levy and Montalvo 2 functions, with only 40,000 evaluations in D=40. The same protocol leaves Neumaier 3 and Periodic far from their optima. This inconsistency needs an explanation, such as whether the reported statistic is the best final solution only, whether the function definition was altered, or whether a rounding artifact occurred. Without clarification or independent verification, the main empirical claim is unsupported.","section":"Table 1, Section 3"},{"comment":"The experimental evaluation is inadequate to support the claim of 'very good results'. There is no comparison with the cited Graph-based Evolutionary Algorithm (GEA), with a classical evolutionary algorithm in terms of solution quality, or with any state-of-the-art continuous optimizer. No statistical tests, standard errors beyond the reported standard deviations, success rates, or convergence curves are provided. The computation-time comparison is also not described in sufficient detail: no experimental protocol, platform, or numerical values are given, and Figure 1 is not referenced in the text.","section":"Section 3"},{"comment":"The central heuristic—that reinforcing operator transitions that increase population diversity, measured by Euclidean distance, improves final solution quality—is asserted without justification or validation. No ablation study isolates the effect of the graph-based adaptation, and no analysis connects the diversity-based selection to final optimization error. The reliance on this unexamined heuristic makes the central claim of the paper unsupported even if the reported numbers were reproducible.","section":"Section 2 and Section 3"}],"minor_comments":[{"comment":"The manuscript contains duplicated copies of Section 3 and duplicated reference lists, which makes the paper difficult to read and suggests it was not carefully prepared.","section":"Throughout"},{"comment":"The parameter Δ in the text of Section 3 is inconsistent with δ used elsewhere; please use one consistent symbol.","section":"Section 2"},{"comment":"The sentence 'Based on CEC2015, we computed the computation time...' is unclear: the CEC2015 benchmark is not described, and Figure 1 is placed after the references rather than being cited in the text.","section":"Section 3"},{"comment":"The final sentence 'Finally, the proposed approach to design an evolutionary algorithm through the use of a dynamic graph' is a sentence fragment and should be rephrased.","section":"Section 3"},{"comment":"Reference [2] in the introduction is given as the Graph-based Evolutionary Algorithm, but the bibliography entry [2] is correct; however, reference [3] (Loshchilov, CMA-ES) is described as a memetic or differential evolution algorithm in the introduction, which is inaccurate.","section":"References"}],"recommendation":"reject","confidential_remarks":"The manuscript appears to be an early conference-style draft with duplicated text and an incomplete algorithm description. The empirical results, especially the exact-zero entries in Table 1, are not credible as reported and would require substantial new experiments and a full formalization of the method to become verifiable. These issues are too fundamental for a minor or major revision within the normal scope; a fresh submission with a complete algorithm specification, rigorous comparisons, and realistic empirical reporting would be the appropriate path."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Here's my take on 1908.08014. The short version: there is a kernel of a decent idea here, but the manuscript is not close to publishable. The graph-based mechanism for switching among 20 crossover/mutation strategies, with arc weights updated by measured changes in population diversity, is a real combination I haven't seen in the cited papers. The stated goal—reducing the design complexity of adaptive EAs—is legitimate. So the authors are working on something worth thinking about.\n\nWhat the paper does not supply is evidence. Section 2 defines the weight update using an undefined variable p, a 'posterior maximum' selection rule that is never specified, and bounds max(0,p) and min(p,0) that do not make sense as written. That alone makes the algorithm impossible to reimplement. Then Table 1 reports exact 0.000 means and zero standard deviations on eight of twelve functions at D=40 with 40,000 evaluations and population 50. I find that implausible for Elliptic, Griewank, or Levy-Montalvo 2—all of which are difficult or multimodal. The stress-test note is right: hitting the global optimum on every run to four decimals on those functions, while Neumaier 3 and Periodic stay far away, is not credible. This looks like a rounding artifact, a different statistic than claimed, or a bug, not a real result.\n\nThere is no baseline anywhere. The authors cite GEA but never compare against it. No statistical tests. The 'Results and discussions' section appears twice verbatim, suggesting a hasty assembly. The CEC2015 computation-time comparison points to a figure that is not included. The reference list is thin but not misleading; I don't see a citation-pattern problem.\n\nShould this go to peer review? Not in this form. The missing algorithm definition and the implausible empirical numbers are desk-reject issues, not something a minor revision can fix. The idea itself could support a proper paper: a complete specification, code, comparisons against GEA and standard adaptive operator selection methods, and honest numbers. But this version is not it.","headline":"Interesting operator-adaptation idea, but the manuscript is too incomplete to reproduce and the reported exact-zero results are not credible.","tokens_in":4590,"tokens_out":3366,"would_cite":false,"duration_ms":31544,"reading_group":"no","serious_thinker":"unclear","would_accept_peer_review":false},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":[],"pacs":[],"model":"deepseek-v4-flash","headline":"This paper claims that a graph-based evolutionary algorithm that updates operator-transition weights by population-diversity changes limits premature convergence and finds exact optima on nine of twelve 40-dimensional benchmark functions.","keywords":["evolutionary algorithm","population diversity","graph-based adaptation","operator selection","continuous optimization","premature convergence","benchmark functions"],"falsifier":"Implement the algorithm with the same 20 strategies but replace the diversity-updated arc weights with weights that are randomly initialized and then held fixed (or updated by a random walk); if the final average results on the 12 benchmark functions are statistically indistinguishable from the diversity-driven version, then the diversity update rule is not the cause of the reported performance.","tokens_in":3685,"feed_emoji":"🧬","tokens_out":7415,"duration_ms":66574,"temperature":0.7,"pith_summary":"The paper proposes an evolutionary algorithm that treats each combination of crossover and mutation operators as a node in a graph, with arc weights updated according to how much population diversity is gained or lost when switching from one strategy to another. At regular intervals of δ generations, the algorithm selects the strategy that, according to the graph, is most likely to maximize diversity for the next δ generations. The authors' central claim is that this diversity-driven adaptation limits the premature convergence caused by diversity loss, while keeping the design effort lower than for multi-population or self-tuning alternatives. On 12 continuous benchmark functions in dimension 40, with 40,000 evaluations per run and 100 runs per function, the algorithm finds the global optimum (to four decimal places) on 9 functions and comes close on the remaining difficult ones (Neumaier 3 and Periodic). If this holds, it offers a low-complexity way to automate the choice of search operators during optimization.","feed_headline":"Diversity-triggered operator swaps hit exact optima on 9 of 12 40-D benchmarks","feed_subtitle":"Arc weights update by population-diversity gains, letting the algorithm pick crossover and mutation strategies on its own.","key_machinery":"The central object is a directed graph on N=20 nodes, where each node is one strategy (a crossover operator paired with a mutation operator), and each arc carries a weight that represents the probability of selecting the target strategy after the source strategy. After every δ generations, the algorithm measures population diversity by Euclidean distance and computes a, the diversity change between the start and end of the block, bounded between max(0,p) and min(p,0); if diversity is preserved, the weight on the arc just traversed is increased by a, otherwise decreased by a. A 'posterior maximum' rule then reads these weights to pick the strategy for the next block. This graph is the whole adaptation mechanism: it replaces manual tuning of operator probabilities with an online, diversity-driven update.","core_discovery":"The paper's central discovery is that the problem of selecting which crossover and mutation operators to apply during an evolutionary search can be cast as a path problem on a graph whose edge weights encode empirically measured changes in population diversity. The algorithm computes the Euclidean-distance diversity of the population after each block of δ generations, compares it to the diversity at the start of the block, and uses the signed difference a (bounded by max(0,p) and min(p,0)) to increase or decrease the weight of the arc from the previously used strategy to the candidate strategy. The selection of the next strategy follows the principle of the posterior maximum among these weights. The authors report that this scheme, with N=20 strategies built from five crossover operators and four mutation operators, reaches the global optimum exactly on 9 of 12 test problems in D=40 and comes very close on the other two difficult ones, while consuming more wall-clock time than a classical EA but remaining amenable to parallelization.","pith_inferences":["A direct ablation—running the same operator set with fixed random arc weights instead of diversity-driven updates—would isolate whether the diversity signal, rather than the mere switching of operators, produces the reported optima.","The same graph-adaptation scheme could be tested with other diversity metrics (e.g., fitness-based or distribution-based) to see whether Euclidean-distance diversity is the best proxy for preventing premature convergence on non-separable or ill-conditioned problems.","Since the selection rule is described only as a 'posterior maximum' principle without a formal definition, a reproducible implementation would require specifying that rule and the bounding parameters p and a; this is an implementation detail the paper leaves open.","If the diversity feedback is indeed the driver, the algorithm should also work with a smaller set of operators, reducing the N=20 strategies further and making the graph approach even cheaper."],"forward_implications":["If the reported results generalize, an evolutionary algorithm user no longer needs to preselect and fix crossover and mutation probabilities; the graph adapts them online from diversity feedback.","The approach reaches exact optima on 9 of 12 tested 40-dimensional benchmarks within 40,000 evaluations, suggesting that diversity-guided operator switching can be competitive with more parameter-heavy adaptive schemes on smooth and moderately multimodal landscapes.","Because the diversity signal is measured in parameter space via Euclidean distance, the algorithm's behavior is tied to geometric dispersion of the population, not to fitness-value spread, which makes the update rule simple and cheap.","The two functions where the algorithm struggles (Periodic and Neumaier 3) are known hard cases, so the method does not claim universal superiority but rather a practical trade-off: reduced design effort at some cost in worst-case performance.","Computation time is higher than a classical EA, but the authors note the adaptation procedure is easily parallelizable, so the overhead is not intrinsic."],"supporting_citations":[{"why":"Defines the graph-based evolutionary algorithm that this paper extends; supplies the population-structure modeling on which the operator-switching graph is built.","marker":"[2]"},{"why":"Exemplifies a state-of-the-art self-tuning/multi-population differential evolution whose complexity motivates the proposed reduction in design effort.","marker":"[1]"},{"why":"Represents a high-performance but parameter-heavy optimizer (CMA-ES with restarts) used as a reference point for why simpler adaptive design is desirable.","marker":"[3]"}],"fun_headline_variants":["Graph-based adaptive EA hits exact optima on 9/12 40-D problems","Diversity-driven operator selection wins 9/12 exact optima at D=40","Adaptive graph EA swaps operators by diversity, scores 9/12","Diversity-aware arc weights steer EA to 9/12 exact global optima","Self-tuning graph EA uses diversity feedback to reach 9/12 optima"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The load-bearing premise is that increasing population diversity, measured by Euclidean distance between individuals, is the right signal for improving final solution quality, so that reinforcing operator transitions that raise diversity will steer the search toward the optimum.","fun_headline_variants_meta":{"raw":{"variants":["Graph-based adaptive EA hits exact optima on 9/12 40-D problems","Diversity-driven operator selection wins 9/12 exact optima at D=40","Adaptive graph EA swaps operators by diversity, scores 9/12","Diversity-aware arc weights steer EA to 9/12 exact global optima","Self-tuning graph EA uses diversity feedback to reach 9/12 optima"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000261,"raw_usage":{"total_tokens":1558,"prompt_tokens":876,"completion_tokens":682,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":492,"completion_tokens_details":{"reasoning_tokens":577}},"tokens_in":492,"tokens_out":682,"duration_ms":6411,"temperature":1.0,"reasoning_tokens":577,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-14T15:05:43.573946+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Implement the algorithm with the same 20 strategies but replace the diversity-updated arc weights with weights that are randomly initialized and then held fixed (or updated by a random walk); if the final average results on the 12 benchmark functions are statistically indistinguishable from the diversity-driven version, then the diversity update rule is not the cause of the reported performance.","supporting_citations":[{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Defines the graph-based evolutionary algorithm that this paper extends; supplies the population-structure modeling on which the operator-switching graph is built."},{"cited_title":"Ali, Noor H","cited_arxiv_id":null,"evidence_quote":"Exemplifies a state-of-the-art self-tuning/multi-population differential evolution whose complexity motivates the proposed reduction in design effort."},{"cited_title":"Loshchilov","cited_arxiv_id":null,"evidence_quote":"Represents a high-performance but parameter-heavy optimizer (CMA-ES with restarts) used as a reference point for why simpler adaptive design is desirable."}],"review_version":1}