{"id":"W2152116910","doi":"","title":"Rank-One Matrix Pursuit for Matrix Completion","year":2014,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":57,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Matrix completion; Eight-point algorithm; Singular value decomposition; Low-rank approximation; Computer science; Algorithm; Matrix (chemical analysis); Scalability; Rank (graph theory); Matching pursuit; Convergence (economics); Sparse matrix; Matrix decomposition; Mathematical optimization; State-transition matrix; Mathematics; Symmetric matrix; Compressed sensing","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001654683,0.001452325,0.001177514,0.0008440643,0.0005702111,0.0008303584,0.001098999,0.001131274,0.002831328],"category_scores_gemma":[0.006348778,0.0004902785,0.0007535115,0.001589314,0.001351701,0.00161774,0.001769406,0.002812695,0.001642591],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006364614,"about_ca_system_score_gemma":0.001623438,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002905719,"about_ca_topic_score_gemma":0.003064857,"domain_scores_codex":[0.9987475,0.0003922889,0.00006678901,0.000224704,0.0004855247,0.00008315777],"domain_scores_gemma":[0.9980528,0.00100357,0.0001764274,0.0003399318,0.0003509358,0.00007619783],"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.0002487521,0.0001751254,0.0005052764,0.0004371076,0.0001011717,0.0001712612,0.0001915516,0.5109071,0.01959378,0.1505466,0.009734653,0.3073876],"study_design_scores_gemma":[0.00001795825,0.00005372195,0.00006632705,0.000008215922,0.000004469703,0.00003580633,0.00001169665,0.9744428,0.002390498,0.02083735,0.002120409,0.0000107064],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001660489,0.0001397945,0.9971702,0.0000823537,0.00002221444,0.00003031406,0.00002906766,0.0001999654,0.0006656357],"genre_scores_gemma":[0.130541,0.0008500745,0.8628271,0.0001514635,0.0001585436,0.0003584686,0.0004358233,0.0001743645,0.004503149],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002905719,"threshold_uncertainty_score":0.009471774,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01993682330091582,"score_gpt":0.2622091324008272,"score_spread":0.2422723090999113,"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."}}