{"id":"d5c0823c-16fc-4b4f-b874-1d8769fa6b51","arxiv_id":"2411.16509","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":3.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"The Jaya R package provides an implementation of the parameter-free Jaya optimization algorithm with support for single- and multi-objective problems, demonstrated on benchmarks and an energy case study.","lead":"This paper introduces a new R package implementing the Jaya optimization algorithm, a parameter-free method for single and multi-objective problems. The package adds features like constraint handling, adaptive population, and Pareto front tracking, and the paper demonstrates it on benchmark functions and a renewable energy case study.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Multi-objective core claim is unsupported: the paper never specifies how jaya_multi generalizes Jaya's best/worst update rule to Pareto-front computation, and the case study lacks quantitative validation.","rationale":"The paper's central claim is that the package is a 'robust and versatile implementation' for both single- and multi-objective optimization. The single-objective part is at least described with a concrete update rule, and the benchmark, while lacking statistical rigor, provides some quantitative evidence. The multi-objective part, however, is a black box: the transition from single-objective Jaya to Pareto-front computation is the core algorithm, and it is entirely missing from the manuscript. The word 'Pareto front tracking' appears in the feature list, but no mechanism is specified. Without this description, the claim is not just weakly evidenced; it is unverifiable from the paper. The case study's qualitative statements about wind/solar contributions cannot substitute for a correctness check. If the implementation is actually naive (e.g., it merely collects all evaluated solutions and filters non-dominated ones without any selection pressure), the returned 'Pareto front' could be a poor approximation, undermining the practical utility claimed. Our proposed test, source inspection plus a ZDT1 benchmark with front-quality metrics, would settle this directly. We therefore agree with the reader's CONDITIONAL verdict, though for a more fundamental reason than the single-objective benchmark statistics.","tokens_in":7493,"tokens_out":8754,"duration_ms":84857,"concrete_test":"Inspect the jaya_multi source code in the linked GitHub repository to verify a real multi-objective mechanism (e.g., non-dominated sorting or an explicitly maintained archive). Then run jaya_multi on the bi-objective ZDT1 problem with default settings and compare the resulting front to the true Pareto front using hypervolume or inverted generational distance. If the source contains no dominance-based selection and the front quality metric is poor, the multi-objective claim fails.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The central claim includes multi-objective capability, yet the manuscript provides no algorithm for it. The single-objective Jaya update (Section 2, Eq. 1) depends on identifying a unique xbest and xworst, which do not exist in multi-objective optimization. The 'Multi-Objective Optimization' subsection merely demonstrates a call to jaya_multi and shows a scatter plot; it never states how the algorithm selects best/worst, maintains an archive, or handles dominance. The case study (Figures 4-7) plots a 3D Pareto front but reports no metrics (hypervolume, IGD) and no comparison with established multi-objective algorithms. Thus the abstract's claim 'suitable for solving ... multi-objective optimization problems' is unsubstantiated. A reader cannot distinguish a genuine Pareto front from a random sample of evaluated solutions.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper presents the R package Jaya, an implementation of the parameter-free Jaya optimization algorithm. It describes the jaya() function for single-objective optimization and the jaya_multi() function for multi-objective problems, and it discusses features such as constraint handling, adaptive population size, early stopping, and parallel processing. The package is demonstrated with a sphere-function example, a two-objective example, a five-benchmark comparison table, and a qualitative energy-system case study. The central claim is that the package provides a robust and versatile parameter-free optimizer for both single- and multi-objective optimization problems.","tokens_in":7646,"tokens_out":3903,"duration_ms":41521,"significance":"If the claims are substantiated, the package would be a useful addition to the R optimization ecosystem, because Jaya has no algorithm-specific control parameters and the package provides convenience functions for summaries and plots. The public code repository, the runnable examples, and the attempt at benchmark comparisons are concrete strengths. However, the multi-objective capability is not algorithmically specified, and the performance comparisons are not quantitatively validated, so the current evidence does not yet support the stated scope of the package.","major_comments":[{"comment":"The manuscript never specifies how jaya_multi() generalizes the Jaya update rule to multiple objectives. Equation (1) requires a unique xbest and xworst, but in multi-objective optimization there is generally no single best and worst solution. The text only says that 'Pareto front tracking' is used; it does not describe how non-dominated solutions are selected, how an archive is maintained, how dominance is defined, or how the best/worst solutions are chosen for the update. As a result, the Pareto_Front output cannot be distinguished from an arbitrary set of evaluated points. Please provide the exact algorithmic variant implemented, including a formal description or pseudocode, and validate the output on a problem with a known Pareto front.","section":"Multi-Objective Optimization (near Fig. 3)"},{"comment":"The benchmark comparison reports only single achieved values for each algorithm. It does not state the dimension n, the bounds of the search space, the population sizes, the number of iterations, the convergence tolerances, or the number of independent runs for Jaya and each comparator. Without this experimental protocol and without repeated-run statistics, the claim of competitive performance is unsupported. In addition, exact zeros reported for SA, PSO, and NM on several benchmarks require explanation (for example, analytical solutions or tight tolerances). Please report the full setup, provide mean and standard deviation over multiple runs, and include the script used to generate the table.","section":"Table 1 and 'Performance Comparison of Optimization Algorithms'"},{"comment":"The energy case study is qualitative only. The objectives (carbon emissions, total costs, reliability) and the constraints (renewable contribution above 70%, variable bounds of 10-40%) are described in words, but no mathematical definitions are given for the objective functions, the reliability index, or the cost models. No numerical results are reported, and no comparison is made with other multi-objective optimizers or with a known baseline. The text around Figures 4-7 draws conclusions about wind, solar, and hydro contributions, yet the figures are not embedded and no quantitative summary of the Pareto front is provided. Please add the complete problem formulation, data sources, simulation parameters, quantitative results, and reproducibility instructions.","section":"Application of the Jaya Package in Multi-Objective Energy Optimization"},{"comment":"The abstract and title state that the package is 'parameter-free' and 'suitable for solving both single-objective and multi-objective optimization problems.' The multi-objective part of this claim is not supported by the algorithmic description, and the single-objective performance claim is not supported by the under-specified benchmark. These are not merely presentation issues; they affect the central contribution of the paper and should be corrected before publication.","section":"Overall claim in the abstract"}],"minor_comments":[{"comment":"The phrase 'parameter-free' is presented absolutely, while the package API includes popSize, maxiter, tolerance, patience, and an adaptive population range. Consider clarifying that the algorithm has no algorithm-specific parameters, while the implementation still requires user-specified population and termination settings.","section":"Title and Section 'Overview of the Jaya R Package'"},{"comment":"Equation (1) uses |xold| without stating that the absolute value is applied componentwise to the decision-variable vector; adding this clarification would avoid ambiguity for readers implementing the update.","section":"Equation (1)"},{"comment":"The benchmark equations are typeset inside a single wide table cell with line breaks; splitting the equations into separate rows or using display math would improve readability.","section":"Table 1"},{"comment":"The manuscript cites GitHub repositories for the package and case-study code, but does not provide a versioned archive or DOI. A persistent archival reference, such as a CRAN submission or Zenodo DOI, would improve reproducibility for readers.","section":"Reproducibility"},{"comment":"Figures 4-7 are referenced with captions but the figures do not appear in the manuscript text. If this is a formatting issue, please ensure all figures are embedded; otherwise the case-study discussion is difficult to follow.","section":"Figures 4-7"}],"recommendation":"major_revision","confidential_remarks":"This is a software-description paper, and the R Journal can accommodate such papers, but the current manuscript needs substantial strengthening. The unsupported multi-objective claim is the most serious issue, followed by the unverifiable benchmark table. The author's reliance on personal GitHub repositories for both the package and the case-study code is acceptable at the preprint stage, but a persistent archival version would increase confidence. I recommend major revision and a careful re-review of the revised benchmark and multi-objective sections."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Quick take: this is a plausible software paper with a real R package, but the multi-objective claims outrun the evidence, and the benchmark section needs statistical work before it can support the abstract's language.\n\nThe genuine contribution is the package itself: a parameter-free Jaya implementation in R with constraint handling, adaptive population, early stopping, parallel evaluation, and plotting helpers. The single-objective example is clean and reproducible, and the author points to public code for both the benchmarks and the energy case study. That is the right way to write a software paper, and the package looks like it could be useful to R users who want a tuning-free optimizer.\n\nThe soft spots are where the paper starts claiming more than it shows. The multi-objective section is the weakest. The paper says jaya_multi does 'Pareto front tracking' but never states how the best/worst update rule from Eq. (1) is generalized when there is no unique xbest or xworst. No archive, no dominance relation, no selection rule is given. The example shows a scatter plot of two sphere objectives, but a reader cannot tell whether the output is a genuine Pareto front or just a cloud of evaluated solutions. The same gap appears in the energy case study: it plots 3D fronts and discusses wind, solar, and hydro trade-offs, but gives no objective functions, no equations, no data, and no metrics (hypervolume, IGD, etc.) to quantify front quality. The stress-test note is right: the core multi-objective claim is unsubstantiated in the manuscript.\n\nThe benchmark table for single-objective problems is also thin. There are no repeated runs, no error bars, no explicit statement of dimensions or bounds, and no parameter settings for the comparators (DE, GA, SA, PSO, NM). Single runs can look nice by luck. That said, the Jaya numbers on Sphere and Rastrigin are so small that the qualitative point—Jaya is competitive—probably survives a proper comparison. This is a moderate weakness, not a fatal one.\n\nNo circularity issues: the self-citations are to the author's package and data repo, which is normal for software papers. The paper does not try to pass fitted values off as predictions.\n\nThe bottom line: the single-objective package is a legitimate, modest contribution. The multi-objective capability may exist in the code, but the paper does not show it. I would send this to peer review with clear requests: add the multi-objective algorithm description, provide a statistical benchmark protocol, and either add equations/data for the energy case study or cut it down to a brief illustration. A serious referee can fix this; the package itself seems real.","headline":"Reasonable R package, but multi-objective claims outrun the evidence; benchmark needs statistical rigor.","tokens_in":8104,"tokens_out":3209,"would_cite":false,"duration_ms":28774,"reading_group":"no","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":[],"pacs":[],"model":"deepseek-v4-flash","headline":"The Jaya R package claims parameter-free single- and multi-objective optimization.","keywords":["Jaya algorithm","parameter-free optimization","multi-objective optimization","Pareto front","R package","constraint handling","benchmark functions","renewable energy optimization"],"falsifier":"Run each benchmark problem (for example, 30 independent runs) with Jaya and with DE, GA, SA, PSO, and NM using their standard recommended settings, then compare mean best objective values and their variances; if Jaya is not statistically competitive on Rosenbrock or Ackley, the reported performance claim fails. For the multi-objective claim, compare jaya_multi()'s Pareto front against a known reference front on a standard test problem such as ZDT1 or DTLZ1.","tokens_in":7323,"feed_emoji":"⚙️","tokens_out":3741,"duration_ms":32530,"temperature":0.7,"pith_summary":"The paper introduces an R package that implements the Jaya algorithm, a population-based optimizer with no algorithm-specific parameters. It claims the package solves single-objective problems and, through Pareto front tracking, multi-objective problems, while offering constraint handling, adaptive population sizing, early stopping, and parallel evaluation. The authors demonstrate the package on standard benchmark functions and on a renewable-energy mix case study. If the claims hold, users get a tuning-free optimizer that returns a set of trade-off solutions for conflicting objectives.","feed_headline":"Zero tuning: Jaya R package handles single and multi-objective optimization","feed_subtitle":"A new R package applies the parameter-free Jaya algorithm with constraints, Pareto fronts, and parallel runs.","key_machinery":"The load-bearing mechanism is the update rule $$x_{\\text{new}} = x_{\\text{old}} + r_1 \\cdot (x_{\\text{best}} - |x_{\\text{old}}|) - r_2 \\cdot (x_{\\text{worst}} - |x_{\\text{old}}|)$$ with $r_1, r_2$ uniform in $[0,1]$. The rule requires no tuning parameters. In the multi-objective variant, the package tracks the set of non-dominated solutions, which becomes the reported Pareto front.","core_discovery":"The central claim is that the Jaya update rule, which iteratively moves each candidate toward the current best solution and away from the current worst solution using two uniform random coefficients, is sufficient to handle a wide range of constrained and multi-objective problems. The paper packages this rule into the jaya() and jaya_multi() functions, where jaya_multi() maintains a Pareto front of non-dominated solutions and returns them together with their decision variables and objective values.","pith_inferences":["A natural next test is to compare jaya_multi() against established multi-objective algorithms such as NSGA-II or SPEA2 using statistical replicates and standard performance indicators; the paper's single-run benchmark does not establish dominance.","The 'parameter-free' claim applies to the core update rule, but users must still choose population size, iteration count, and convergence tolerance, so the practical tuning burden is reduced rather than eliminated.","The energy case study could be extended with real cost and capacity data to see whether the reported Pareto front persists under actual engineering constraints and stochastic supply profiles."],"forward_implications":["Users can run optimization in R without setting crossover rates, mutation probabilities, inertia weights, or other algorithm-specific hyperparameters.","Multi-objective problems return a Pareto front, letting decision-makers choose among trade-off solutions rather than a single compromise.","The renewable-energy case study suggests the package can balance carbon emissions, cost, and reliability in a policy-relevant energy mix problem.","Parallel evaluation and early stopping are claimed to reduce computation time on large-scale problems.","Benchmark results on Sphere, Rastrigin, Rosenbrock, Ackley, and Griewank support the claim that Jaya is competitive with DE, GA, SA, PSO, and Nelder-Mead."],"supporting_citations":[{"why":"Introduces the Jaya algorithm and its parameter-free update rule, which the package implements.","marker":"Rao, 2016"},{"why":"Provides the DEoptim implementation used as a comparison baseline in the benchmark study.","marker":"Mullen et al., 2011"},{"why":"Provides the GA package implementation used as a comparison baseline in the benchmark study.","marker":"Scrucca, 2013"},{"why":"Provides the PSO package implementation used as a comparison baseline.","marker":"Bendtsen., 2022"},{"why":"Supplies R's built-in Simulated Annealing and Nelder-Mead implementations used as baselines.","marker":"R Core Team, 2024"},{"why":"Supplies the Sphere benchmark function used in the comparison table.","marker":"de JONG Kenneth, 1975"},{"why":"Supplies the Rastrigin benchmark function used in the comparison table.","marker":"Rastrigin, 1974"},{"why":"Supplies the Rosenbrock benchmark function used in the comparison table.","marker":"Rosenbrock, 1960"},{"why":"Supplies the Ackley benchmark function used in the comparison table.","marker":"Ackley, 2012"},{"why":"Supplies the Griewank benchmark function used in the comparison table.","marker":"Griewank, 1981"}],"fun_headline_variants":["Zero parameters: Jaya R solves single and multi-objective","Jaya R: zero-parameter optimizer for single and multi-objective","No tuning: Jaya R optimizes single and multi-objective","Parameter-free Jaya R: one algorithm, both optimization types","Jaya R: parameter-free, handles single & multi-objective"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The benchmark comparison assumes that a single run of each algorithm, with unspecified parameter settings and no statistical analysis, is a fair and representative measure of performance.","fun_headline_variants_meta":{"raw":{"variants":["Zero parameters: Jaya R solves single and multi-objective","Jaya R: zero-parameter optimizer for single and multi-objective","No tuning: Jaya R optimizes single and multi-objective","Parameter-free Jaya R: one algorithm, both optimization types","Jaya R: parameter-free, handles single & multi-objective"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.00156,"raw_usage":{"total_tokens":6138,"prompt_tokens":759,"completion_tokens":5379,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":375,"completion_tokens_details":{"reasoning_tokens":5289}},"tokens_in":375,"tokens_out":5379,"duration_ms":30209,"temperature":1.0,"reasoning_tokens":5289,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-12T13:00:37.066302+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Run each benchmark problem (for example, 30 independent runs) with Jaya and with DE, GA, SA, PSO, and NM using their standard recommended settings, then compare mean best objective values and their variances; if Jaya is not statistically competitive on Rosenbrock or Ackley, the reported performance claim fails. For the multi-objective claim, compare jaya_multi()'s Pareto front against a known reference front on a standard test problem such as ZDT1 or DTLZ1.","supporting_citations":[],"review_version":1}