{"id":"W4211198679","doi":"10.1007/978-981-16-8113-4_1","title":"Finding Simple Solutions to Multi-Task Visual Reinforcement Learning Problems with Tangled Program Graphs","year":2022,"lang":"en","type":"book-chapter","venue":"Genetic and evolutionary computation","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Reinforcement learning; Task (project management); Benchmark (surveying); Computer science; Modularity (biology); Artificial intelligence; Population; Benchmarking; Action (physics); Machine learning; Simple (philosophy); Theoretical computer science; Biology; Engineering","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","sts"],"consensus_categories":[],"category_scores_codex":[0.0001766721,0.0004065467,0.0002997704,0.0004132892,0.001606832,0.0001308369,0.0003596642,0.0001375373,0.00008288305],"category_scores_gemma":[0.000008013525,0.0004286183,0.0001023298,0.000344933,0.0001155584,0.000261182,0.0005767288,0.0004261254,0.00004436806],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002786406,"about_ca_system_score_gemma":0.0002433481,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004874558,"about_ca_topic_score_gemma":0.00001454326,"domain_scores_codex":[0.9974509,0.00005406377,0.000507141,0.0008976264,0.0006101209,0.000480143],"domain_scores_gemma":[0.9988642,0.00008020551,0.0003050504,0.0002922409,0.0002239177,0.0002343962],"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.00001430897,0.0001654803,0.0001378531,0.00004996784,0.0001255694,0.000012457,0.00049404,0.848611,0.00002178533,0.08446577,0.001935276,0.06396651],"study_design_scores_gemma":[0.0006828904,0.001414434,0.006170846,0.00007930621,0.00007416327,0.000135571,0.0000559644,0.8670252,7.055608e-7,0.02220475,0.1013985,0.0007577245],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000487421,0.001078304,0.9901428,0.0004664609,0.0001356882,0.001902025,0.00002036561,0.0004601783,0.005306782],"genre_scores_gemma":[0.2823584,0.0006043072,0.6636645,0.0003213533,0.000300898,0.002330184,0.002294016,0.0001609298,0.04796541],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3264782,"threshold_uncertainty_score":0.9998165,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0228751579642623,"score_gpt":0.2598006715739276,"score_spread":0.2369255136096653,"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."}}