{"id":"W4255726574","doi":"10.32920/ryerson.14647050","title":"Modeling Hybrid Metaheuristic Optimization Algorithm for Convergence Prediction","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Meta-optimization; Metaheuristic; Imperialist competitive algorithm; Multi-swarm optimization; Derivative-free optimization; Algorithm; Mathematical optimization; Hybrid algorithm (constraint satisfaction); Computer science; Optimization problem; Particle swarm optimization; Test functions for optimization; Continuous optimization; Benchmark (surveying); Convergence (economics); Bees algorithm; Cuckoo search; Ant colony optimization algorithms; Mathematics; Artificial intelligence; Probabilistic logic; Constraint satisfaction","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001260551,0.000486796,0.0006634597,0.0004454562,0.0002763555,0.001281157,0.0018765,0.0002806011,0.0003404752],"category_scores_gemma":[0.000780485,0.0005141356,0.0003193337,0.000531033,0.00005248769,0.0006543041,0.002171969,0.0006281759,0.00001770734],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002111995,"about_ca_system_score_gemma":0.0009822394,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007387979,"about_ca_topic_score_gemma":0.000001757149,"domain_scores_codex":[0.9952008,0.0002933958,0.001019813,0.00174696,0.001122266,0.0006167433],"domain_scores_gemma":[0.9951912,0.0002450384,0.0002539098,0.001703105,0.002301173,0.0003055468],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000002372776,0.00007949841,0.000001573511,0.0001206321,0.0001084031,0.00001414098,0.00006114956,0.9711716,0.000003569087,0.001094286,0.0004730511,0.02686975],"study_design_scores_gemma":[0.0004050995,0.0000448437,0.000001133024,0.0000719556,0.00007081343,0.00002494428,0.00002426469,0.9971999,0.0002920568,0.001317806,0.0001026284,0.0004445571],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00002156832,0.0004797049,0.9927912,0.0003385002,0.003587639,0.001512068,0.0001770396,0.0006147096,0.0004776071],"genre_scores_gemma":[0.002322604,0.0007067679,0.9936228,0.0001412804,0.0003115053,0.0005970901,0.001041928,0.00006146509,0.001194581],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.02642519,"threshold_uncertainty_score":0.9997556,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04353849727071869,"score_gpt":0.2966537671727526,"score_spread":0.2531152699020339,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}