{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002411813,0.0008228405,0.0007036485,0.0004257005,0.0002756726,0.0007863164,0.001157998,0.0009766951,0.001268324],"category_scores_gemma":[0.01081435,0.0003636637,0.00043798,0.0007878206,0.001672175,0.001870608,0.001533616,0.001349118,0.000333528],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005035179,"about_ca_system_score_gemma":0.0006890052,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001304216,"about_ca_topic_score_gemma":0.001287341,"domain_scores_codex":[0.9988301,0.0004781398,0.00005159927,0.0002099138,0.000330451,0.00009987537],"domain_scores_gemma":[0.9952145,0.002891074,0.0005678225,0.0008216926,0.0003832422,0.0001217879],"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.0002117348,0.0000705374,0.0008526105,0.0001979982,0.00004979899,0.0003063457,0.0001145741,0.8491834,0.01172985,0.1075911,0.001128947,0.02856301],"study_design_scores_gemma":[0.00001148132,0.0000316124,0.0001346779,0.000006596723,0.000003047623,0.00004622717,0.00001508819,0.9760571,0.002620471,0.02075717,0.0003080946,0.000008504161],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02137734,0.00009696342,0.9774063,0.0001319925,0.00001576724,0.00002436002,0.00004705621,0.00006013314,0.0008400581],"genre_scores_gemma":[0.6205992,0.0005236093,0.3732389,0.0001692611,0.00008677682,0.0001870488,0.0003438366,0.00008695327,0.004764403],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002411813,"threshold_uncertainty_score":0.01275504,"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."}}