{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01270206,0.002200359,0.002215241,0.007578496,0.001253866,0.007054924,0.005280117,0.004881737,0.006550768],"category_scores_gemma":[0.08675927,0.0009957606,0.002119689,0.008511138,0.008360517,0.02286227,0.006637299,0.008175636,0.0006881793],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003842753,"about_ca_system_score_gemma":0.001493916,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006686128,"about_ca_topic_score_gemma":0.0007652522,"domain_scores_codex":[0.9901097,0.004700926,0.0006306175,0.001317815,0.002787086,0.0004538606],"domain_scores_gemma":[0.871739,0.0987377,0.006969582,0.01316096,0.006751402,0.002641416],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004769135,0.00006094241,0.0008149332,0.00007838738,0.00003995866,0.00002014328,0.00007695214,0.01240517,0.0001808885,0.9660012,0.001385288,0.0188885],"study_design_scores_gemma":[0.0000104769,0.00003458853,0.0005665496,0.00003228837,0.00002139176,0.00005094071,0.00004407849,0.09499764,0.0001579808,0.9028852,0.001164396,0.00003460655],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0242592,0.002369655,0.9586481,0.002471803,0.0003190977,0.00009542605,0.0002998005,0.0002527811,0.01128421],"genre_scores_gemma":[0.5609161,0.0033818,0.4209113,0.001147562,0.002497381,0.0008215804,0.0007975551,0.0003472378,0.009179388],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01270206,"threshold_uncertainty_score":0.06717575,"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."}}