{"id":"W3149251347","doi":"10.22215/etd/2020-14211","title":"Sequence Modeling with Linear Complexity","year":2020,"lang":"en","type":"dissertation","venue":"","topic":"Topic Modeling","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Automatic summarization; Kernel (algebra); Sequence (biology); Benchmark (surveying); Autoregressive model; Time complexity; Computational complexity theory; Task (project management); Artificial intelligence; Memory footprint; Quadratic equation; Machine translation; Algorithm; Machine learning; Theoretical computer science; Mathematics","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.00125462,0.001261139,0.001222722,0.001037062,0.0005828789,0.001905621,0.001615344,0.001309762,0.00792749],"category_scores_gemma":[0.009070303,0.0007349135,0.001818069,0.001324912,0.0008808135,0.003064323,0.001595067,0.002600308,0.003664508],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001687829,"about_ca_system_score_gemma":0.001405829,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008046319,"about_ca_topic_score_gemma":0.007450929,"domain_scores_codex":[0.998621,0.0003683724,0.00009315131,0.0003583615,0.0004372521,0.0001219541],"domain_scores_gemma":[0.9956801,0.002917852,0.0002740707,0.0005898148,0.0004558557,0.00008225165],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001424176,0.00006967533,0.0008856501,0.0002947653,0.0001119584,0.0002216026,0.0001597207,0.7192699,0.003541819,0.1581433,0.00832965,0.1088295],"study_design_scores_gemma":[0.000004355691,0.000008637495,0.00005250322,0.000004859879,0.000006190796,0.00002075213,0.000005386234,0.9700398,0.0003977478,0.02800645,0.001448803,0.000004676358],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003068174,0.0003505835,0.9930605,0.0003047183,0.00006872229,0.00004860492,0.0002488255,0.0009535625,0.001896402],"genre_scores_gemma":[0.3197963,0.002100981,0.6472645,0.0005858436,0.0007640714,0.001051183,0.003040879,0.001013475,0.02438279],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008046319,"threshold_uncertainty_score":0.02652007,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1294094577319895,"score_gpt":0.311235620889329,"score_spread":0.1818261631573395,"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."}}