{"id":"W4318947280","doi":"10.1088/2632-2153/acb895","title":"Supplementing recurrent neural networks with annealing to solve combinatorial optimization problems","year":2023,"lang":"en","type":"article","venue":"Machine Learning Science and Technology","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"ca_institutions":"Vector Institute; University of Waterloo","funders":"Vector Institute","keywords":"Travelling salesman problem; Simulated annealing; Mathematical optimization; Combinatorial optimization; Computer science; Markov chain; Optimization problem; Heuristic; Artificial neural network; Extremal optimization; Scheduling (production processes); Convergence (economics); Mathematics; Algorithm; Artificial intelligence; Machine learning","routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002082431,0.0007210188,0.001001458,0.0007061249,0.0003847032,0.0008969855,0.001196549,0.001425478,0.001251761],"category_scores_gemma":[0.005799501,0.0006655019,0.0006788313,0.0006772914,0.0008072659,0.001112599,0.0007163638,0.001183645,0.0002193753],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009776838,"about_ca_system_score_gemma":0.001061276,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007229474,"about_ca_topic_score_gemma":0.007521889,"domain_scores_codex":[0.9993737,0.0003613837,0.00003127936,0.00007303273,0.0001038771,0.00005671421],"domain_scores_gemma":[0.9969695,0.00236764,0.0001849752,0.0001705588,0.0002545807,0.00005282326],"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.00001746262,0.00002463294,0.0002314156,0.00002202955,0.00002315819,0.00001158323,0.0000132585,0.987007,0.0005228473,0.002203465,0.0001244133,0.009798767],"study_design_scores_gemma":[0.000001683548,0.000007293948,0.00001634472,0.000001315197,0.000001821824,0.000001229135,0.000001178444,0.9992726,0.0001101645,0.0005327407,0.000052688,8.285483e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1212855,0.0008166634,0.8705879,0.0005248481,0.0001229023,0.00007985275,0.00003404923,0.0007578097,0.005790434],"genre_scores_gemma":[0.7997168,0.000255278,0.1982258,0.0001702811,0.00005088527,0.0001454053,0.00007533319,0.00008452646,0.001275787],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007229474,"threshold_uncertainty_score":0.01437479,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01265557304297382,"score_gpt":0.2716609044891043,"score_spread":0.2590053314461305,"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."}}