{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001301081,0.0003713048,0.0005099421,0.0003057186,0.00005775895,0.00003944159,0.0004249525,0.0003229668,0.00002167974],"category_scores_gemma":[0.0000223134,0.0004319099,0.0001560389,0.0003012974,0.0002060012,0.00007315529,0.0005048752,0.0004201924,0.00001497329],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001191887,"about_ca_system_score_gemma":0.00004263647,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001293234,"about_ca_topic_score_gemma":0.000009337816,"domain_scores_codex":[0.9986826,0.00006188512,0.0002450872,0.0006224297,0.00008811351,0.0002998748],"domain_scores_gemma":[0.998676,0.0001391119,0.0001694903,0.0007395643,0.0001582032,0.0001176322],"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.00008932845,0.00008273731,0.0001365675,0.0002878248,0.000168899,0.000195602,0.0001208436,0.9962782,0.0007103402,0.0003893946,0.000672432,0.0008678376],"study_design_scores_gemma":[0.0004823623,0.00007011543,0.00003544532,0.0003139531,0.0001653762,0.00001676487,0.00006326687,0.9904752,0.006166186,0.001456625,0.0002773266,0.0004773786],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.754627,0.0004015715,0.2371584,0.000001783431,0.0003446974,0.0003639303,0.00004408574,0.0005358499,0.006522702],"genre_scores_gemma":[0.9961811,0.0008381518,0.002581444,0.00001455625,0.0001010961,8.191529e-7,0.00002538367,0.00005323342,0.0002042077],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2415541,"threshold_uncertainty_score":0.9998133,"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."}}