{"id":"W4289655252","doi":"10.1109/isit50566.2022.9834449","title":"The Optimal Sample Complexity of Matrix Completion with Hierarchical Similarity Graphs","year":2022,"lang":"en","type":"article","venue":"2022 IEEE International Symposium on Information Theory (ISIT)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Kootenay Association for Science & Technology","funders":"National Science Foundation","keywords":"Matrix completion; Computer science; Stochastic block model; Recommender system; Matrix (chemical analysis); Rank (graph theory); Low-rank approximation; Computational complexity theory; Similarity (geometry); Context (archaeology); Sample complexity; Theoretical computer science; Algorithm; Mathematics; Combinatorics; Artificial intelligence; Machine learning; Cluster analysis","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":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001022036,0.0001899343,0.0002245641,0.0001784069,0.0008165217,0.0001260052,0.0007519941,0.0000236038,0.002196594],"category_scores_gemma":[0.00001346755,0.00015178,0.0002068781,0.0003517143,0.0002712054,0.0003836437,0.0002344374,0.0004463277,0.00001679162],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001523197,"about_ca_system_score_gemma":0.00004792387,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001890772,"about_ca_topic_score_gemma":0.000008960052,"domain_scores_codex":[0.9977595,0.000307496,0.0006197013,0.0001763544,0.000916648,0.0002202751],"domain_scores_gemma":[0.9982465,0.0005814899,0.0005187905,0.0003707068,0.0002240851,0.00005841478],"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.0006931378,0.0001453418,0.002973001,0.000004750899,0.0002476781,3.347064e-7,0.0004405959,0.0362035,0.0001791455,0.9543259,0.002718992,0.002067583],"study_design_scores_gemma":[0.002397861,0.001033128,0.00734487,0.00004378681,0.0001656266,0.00002018003,0.002954663,0.2111435,0.004268742,0.6291242,0.1406033,0.0009002435],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4996435,0.00002051552,0.4446167,0.004136541,0.001112406,0.001252724,0.00289554,0.0002906955,0.04603136],"genre_scores_gemma":[0.9971742,0.000004313121,0.001125156,0.0002177846,0.00011414,0.000165293,0.001053012,0.00001271196,0.0001333991],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4975307,"threshold_uncertainty_score":0.9987155,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01200499400515911,"score_gpt":0.2644584007602411,"score_spread":0.252453406755082,"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."}}