{"id":"W1576063399","doi":"10.1007/11750321_22","title":"Alternative Measures of Computational Complexity with Applications to Agnostic Learning","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Computational complexity theory; Bounded function; Task (project management); Hierarchy; Structural complexity theory; Measure (data warehouse); Time complexity; Asymptotic computational complexity; Theoretical computer science; Polynomial hierarchy; Perspective (graphical); Set (abstract data type); Quantum complexity theory; Worst-case complexity; Computational resource; Probably approximately correct learning; Descriptive complexity theory; Artificial intelligence; Computational learning theory; Complexity class; Algorithm; Mathematics; Data mining; Active learning (machine learning)","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"],"consensus_categories":[],"category_scores_codex":[0.0005753842,0.0004105488,0.0005003563,0.000768494,0.0003004078,0.0002312752,0.002123381,0.000113828,0.000009456367],"category_scores_gemma":[0.00007796507,0.0003561953,0.00008231951,0.0007813926,0.0007003952,0.0002123626,0.0006708376,0.0008173082,0.00002611626],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001529666,"about_ca_system_score_gemma":0.0003806554,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001991703,"about_ca_topic_score_gemma":0.00007766789,"domain_scores_codex":[0.9966313,0.00005992228,0.0004593571,0.00115904,0.001265154,0.0004252441],"domain_scores_gemma":[0.9975502,0.0007176002,0.0003851662,0.00065284,0.000539274,0.0001548998],"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.000003051886,0.00002447002,0.0001440339,0.00001800928,0.000009607713,0.00001140666,0.0002507066,0.7699527,0.00000923286,0.02270485,0.00000851427,0.2068634],"study_design_scores_gemma":[0.0002479604,0.0002907603,0.0008085743,0.0002958164,0.000008709379,0.00004298331,1.462306e-7,0.824421,0.0002021739,0.1714032,0.001793116,0.0004854712],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00007685183,0.00009845573,0.9949837,0.0004895051,0.0002035701,0.0004789685,0.000009048308,0.0001369332,0.003523018],"genre_scores_gemma":[0.2964017,0.000002902696,0.7027001,0.0003256995,0.0002571425,0.00002202611,0.00001735159,0.00002607058,0.0002470111],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2963249,"threshold_uncertainty_score":0.999889,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02815527443318992,"score_gpt":0.2732066595160536,"score_spread":0.2450513850828636,"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."}}