{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000377763,0.0009815141,0.000808995,0.0004722495,0.0003434597,0.000683604,0.001058362,0.001574806,0.006724116],"category_scores_gemma":[0.002336509,0.0005683581,0.0005884741,0.0005174966,0.0007606575,0.001181441,0.001186957,0.00116821,0.0004550027],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005701823,"about_ca_system_score_gemma":0.0006013156,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002034968,"about_ca_topic_score_gemma":0.003213149,"domain_scores_codex":[0.9998685,0.00003345251,0.000007603402,0.00004502472,0.00002170499,0.00002367189],"domain_scores_gemma":[0.9993039,0.0005179933,0.0000674402,0.00003106824,0.00003503052,0.00004459566],"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.000108204,0.00009425921,0.000272117,0.0002253216,0.00003938244,0.0001201915,0.0001107826,0.9031634,0.002679457,0.01986768,0.001920173,0.07139897],"study_design_scores_gemma":[0.00003183484,0.00005746848,0.00007461192,0.00001419442,0.000007269815,0.00002268997,0.00002064071,0.9727769,0.0004401652,0.0260211,0.0005273486,0.000005670507],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0958375,0.0004181562,0.8893353,0.000268507,0.00005513451,0.0001780703,0.0001201463,0.000751272,0.01303593],"genre_scores_gemma":[0.6450329,0.0003466536,0.3403035,0.0001127524,0.00003692635,0.0003732893,0.0002106125,0.0002256435,0.01335772],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006724116,"threshold_uncertainty_score":0.02249444,"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."}}