{"id":"W2768739050","doi":"10.1093/imaiai/iay019","title":"Near-optimal sample complexity for convex tensor completion","year":2018,"lang":"en","type":"preprint","venue":"Information and Inference A Journal of the IMA","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia Hospital","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Tensor (intrinsic definition); Minimax; Combinatorics; Matrix norm; Rank (graph theory); Norm (philosophy); Matrix completion; Regular polygon; Low-rank approximation; Mathematical optimization; Pure mathematics; Physics; Geometry","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.005165552,0.001482724,0.001868883,0.0007051139,0.0006689197,0.001916243,0.001964977,0.001748035,0.003962801],"category_scores_gemma":[0.02982651,0.000751904,0.0007799675,0.001144019,0.002594152,0.004312447,0.002431323,0.003105557,0.0007883447],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002173203,"about_ca_system_score_gemma":0.002597787,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004242481,"about_ca_topic_score_gemma":0.005022215,"domain_scores_codex":[0.9959204,0.001917393,0.0002002611,0.0007349235,0.0009003664,0.0003265061],"domain_scores_gemma":[0.9739379,0.02034701,0.001210313,0.002511021,0.001405947,0.0005877244],"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.001067238,0.0001918371,0.001640626,0.0004645023,0.0001208814,0.0002193412,0.0001999952,0.8309928,0.007490658,0.09003337,0.005637654,0.06194109],"study_design_scores_gemma":[0.00001482482,0.00004381584,0.0001482505,0.000009285784,0.00000515248,0.00002700816,0.00001794568,0.9684263,0.001129193,0.0298378,0.0003318269,0.000008501568],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03432943,0.0005232854,0.9608089,0.001249196,0.00006140619,0.00006928502,0.0002980982,0.0005731271,0.002087268],"genre_scores_gemma":[0.5417039,0.0005177882,0.4509336,0.0004805108,0.0002318461,0.0002581588,0.001217142,0.0004992994,0.004157697],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005165552,"threshold_uncertainty_score":0.02731836,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04930836521229182,"score_gpt":0.2818386328107859,"score_spread":0.232530267598494,"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."}}