{"id":"W2982555860","doi":"10.1109/tit.2020.3039308","title":"Weighted Matrix Completion From Non-Random, Non-Uniform Sampling Patterns","year":2020,"lang":"en","type":"preprint","venue":"IEEE Transactions on Information Theory","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Debiasing; Sampling (signal processing); Matrix (chemical analysis); Algorithm; Metric (unit); Simple (philosophy); Matrix completion; Simple random sample; Matching (statistics); Mathematical optimization; Computer science; Mathematics; Function (biology); Projection (relational algebra); Upper and lower bounds; Statistics; Mathematical analysis; Computer vision","routes":{"ca_aff":true,"ca_fund":true,"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.0001736702,0.0004555539,0.0004802267,0.000394751,0.0001825312,0.0002122881,0.0003524894,0.0004214613,0.0002702372],"category_scores_gemma":[0.000003929406,0.0004852163,0.0002812486,0.0001520358,0.00003791029,0.0005412743,0.000009833511,0.001139296,0.0003666758],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001839413,"about_ca_system_score_gemma":0.00004028672,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001072289,"about_ca_topic_score_gemma":0.000009623444,"domain_scores_codex":[0.9984111,0.00004992647,0.0007252724,0.0002239971,0.0003255518,0.0002641219],"domain_scores_gemma":[0.998808,0.0001862949,0.000196478,0.0005651404,0.0001264663,0.0001176083],"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.00034714,0.00004787186,0.000002858266,0.0003363985,0.0004618524,0.000003662619,0.003320049,0.9489071,0.0028683,0.0003021478,0.001031084,0.0423715],"study_design_scores_gemma":[0.001083344,0.00006231167,0.00008559619,0.0008085676,0.0001885474,0.000005333211,0.0003080326,0.8941281,0.08776324,0.01313036,0.001656659,0.0007799339],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02260354,0.00001837731,0.9701712,0.00005914628,0.001884106,0.0006689244,0.000878925,0.001704061,0.002011757],"genre_scores_gemma":[0.9855548,0.000232885,0.01293136,0.0002508495,0.0001694174,0.0001406445,0.0006419985,0.00006220012,0.00001585018],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9629512,"threshold_uncertainty_score":0.99976,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01941709172644644,"score_gpt":0.2473954755517801,"score_spread":0.2279783838253336,"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."}}