{"id":"W2788739123","doi":"10.48550/arxiv.1802.06967","title":"Recovery of simultaneous low rank and two-way sparse coefficient matrices, a nonconvex approach","year":2018,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":true,"ca_institutions":"Booth University College","funders":"","keywords":"Minimax; Iterated function; Rate of convergence; Rank (graph theory); Computer science; Thresholding; Convergence (economics); Convex function; Word error rate; Algorithm; Gradient descent; Function (biology); Column (typography); Set (abstract data type); Applied mathematics; Mathematical optimization; Task (project management); Regular polygon; Mathematics; Image (mathematics); Artificial intelligence; Combinatorics; Artificial neural network","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.00182088,0.001211022,0.001168039,0.0008770587,0.0004261043,0.001061322,0.001108237,0.001534891,0.001171126],"category_scores_gemma":[0.008727359,0.0007197044,0.0006648752,0.001158154,0.001870303,0.001637527,0.001725794,0.001469836,0.0004136729],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005001108,"about_ca_system_score_gemma":0.001046155,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002991559,"about_ca_topic_score_gemma":0.002462792,"domain_scores_codex":[0.9992023,0.0002658863,0.00003417063,0.0001758857,0.0002584947,0.00006328774],"domain_scores_gemma":[0.9966758,0.002128789,0.0004236581,0.0003236064,0.0003302581,0.0001177194],"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.0001056197,0.00007235824,0.0006750868,0.000177034,0.00007324127,0.0002878339,0.0001366633,0.9083759,0.01282321,0.02897731,0.001859111,0.04643662],"study_design_scores_gemma":[0.000007482405,0.00002146858,0.00009750631,0.000004301654,0.000004337543,0.00004426096,0.00001083429,0.9900793,0.00157631,0.007748117,0.0003998599,0.000006349211],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.009327023,0.0001175597,0.9894198,0.0002911784,0.00001710894,0.00001866081,0.00004965236,0.0000771474,0.0006818543],"genre_scores_gemma":[0.4326308,0.000621663,0.5596067,0.000326237,0.0002341901,0.0001651882,0.0005546191,0.0001550841,0.005705421],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002991559,"threshold_uncertainty_score":0.009629846,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03300666322999803,"score_gpt":0.1758824210231955,"score_spread":0.1428757577931975,"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."}}