{"id":"W7109950510","doi":"10.4230/lipics.icalp.2025.28","title":"Faster & Deterministic FPT Algorithm for Worst-Case Tensor Decomposition","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Tensor (intrinsic definition); Decomposition; Deterministic algorithm; Rank (graph theory); Cluster analysis; Time complexity; State (computer science); Randomized algorithm","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.0005762505,0.0005067255,0.0005678348,0.000577868,0.0008930588,0.0008994737,0.001425062,0.0002475797,0.00001638283],"category_scores_gemma":[0.00008719592,0.0004856703,0.0004802208,0.0006099653,0.0001726888,0.001535515,0.0006164539,0.000361871,0.00005856081],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001412228,"about_ca_system_score_gemma":0.0001173399,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000111343,"about_ca_topic_score_gemma":0.00001862747,"domain_scores_codex":[0.9968851,0.00004774653,0.001271721,0.0004920845,0.0003586362,0.0009447469],"domain_scores_gemma":[0.9973595,0.0005145998,0.0003722218,0.001079383,0.0004526972,0.0002216233],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000119907,0.0007369196,0.0003786277,0.001030694,0.0003939326,0.0001296084,0.00436612,0.0001209234,0.0000396321,0.05612098,0.009024254,0.9275384],"study_design_scores_gemma":[0.003664676,0.0004125893,0.0001700853,0.0002764852,0.0000908109,0.0007620385,0.0005162042,0.9106129,0.0006664409,0.01344305,0.06867341,0.0007112853],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.008846043,0.00004841225,0.9837723,0.0005040267,0.002177443,0.001800242,0.0007084556,0.0003384889,0.001804602],"genre_scores_gemma":[0.1490587,0.00002058357,0.8442141,0.003945417,0.00031991,0.000788522,0.0004569105,0.00005625975,0.001139554],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9268271,"threshold_uncertainty_score":0.9997595,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01588720773416899,"score_gpt":0.2990740121710311,"score_spread":0.2831868044368621,"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."}}