{"id":"W3023705181","doi":"10.36227/techrxiv.12199026.v1","title":"A non-convex optimization framework for large-scale low-rank matrix factorization","year":2020,"lang":"en","type":"preprint","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University","funders":"","keywords":"Non-negative matrix factorization; Dimensionality reduction; Hessian matrix; Matrix decomposition; Rank (graph theory); Matrix (chemical analysis); Mathematics; Factorization; Conjugate gradient method; Low-rank approximation; Algorithm; Mathematical optimization; Convergence (economics); Computer science; Reduction (mathematics); Applied mathematics; Artificial intelligence; Combinatorics","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.001720443,0.00193465,0.001479327,0.0009395768,0.0005359289,0.001297634,0.001497897,0.001431255,0.002936462],"category_scores_gemma":[0.004135299,0.0005832804,0.001221016,0.001535642,0.00136627,0.001578778,0.001559646,0.00312416,0.001705627],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007323361,"about_ca_system_score_gemma":0.001635131,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002893258,"about_ca_topic_score_gemma":0.003130422,"domain_scores_codex":[0.9988124,0.0004807269,0.00005406724,0.0002091592,0.000382657,0.00006097691],"domain_scores_gemma":[0.9987339,0.0006575406,0.0001282676,0.0001366346,0.0002826205,0.00006101691],"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.00006191625,0.00009181136,0.0003336383,0.0005282291,0.0001273802,0.0002197671,0.0001181447,0.6944286,0.007796783,0.1604978,0.01148328,0.1243126],"study_design_scores_gemma":[0.000007598953,0.00002861654,0.00007487213,0.00001495904,0.000006597452,0.00004957598,0.0000128852,0.969892,0.0007755206,0.02567041,0.003456284,0.00001066921],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0002508746,0.0001328322,0.9990005,0.00008709481,0.00002549194,0.00001580851,0.00002161028,0.00004845628,0.000417432],"genre_scores_gemma":[0.0579789,0.001419518,0.9351045,0.0002525774,0.0003931603,0.0003825443,0.0004157704,0.0001901651,0.00386275],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002936462,"threshold_uncertainty_score":0.009823442,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01700254015231117,"score_gpt":0.2685198352883177,"score_spread":0.2515172951360066,"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."}}