{"id":"W1853318468","doi":"10.48550/arxiv.1305.3803","title":"A fast randomized Kaczmarz algorithm for sparse solutions of consistent linear systems","year":2013,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"","keywords":"Overdetermined system; Underdetermined system; Linear system; Compressed sensing; Mathematics; Solver; Convergence (economics); Speedup; System of linear equations; Algorithm; Mathematical optimization; Applied mathematics; Computer science; Mathematical analysis","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.001429929,0.001035994,0.000885756,0.0009430179,0.0007278215,0.00101444,0.001453958,0.001491044,0.005695831],"category_scores_gemma":[0.00635939,0.000578469,0.00072272,0.0009816688,0.0009182597,0.001459673,0.001952441,0.002113403,0.002233084],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006375302,"about_ca_system_score_gemma":0.002546155,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003042848,"about_ca_topic_score_gemma":0.005730814,"domain_scores_codex":[0.998843,0.0003431409,0.00005947952,0.0001874531,0.000471952,0.00009484925],"domain_scores_gemma":[0.9986259,0.0007167393,0.0001317307,0.0002221379,0.0002563564,0.00004712466],"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.0003408433,0.0001673791,0.0006931308,0.0002014564,0.0000870312,0.0002125999,0.0001783725,0.4316773,0.01953807,0.1190178,0.01264769,0.4152383],"study_design_scores_gemma":[0.00005999199,0.00004623728,0.00009498274,0.00001181397,0.000007228218,0.00008169943,0.00001797432,0.9742531,0.00344766,0.01772096,0.004237749,0.00002066087],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001567701,0.00005958736,0.9971862,0.0001105771,0.00002155119,0.00003632176,0.00003247628,0.0003724366,0.0006130706],"genre_scores_gemma":[0.05427393,0.0001276666,0.942634,0.0001620371,0.00006192181,0.000234455,0.0002303065,0.000206894,0.002068592],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005695831,"threshold_uncertainty_score":0.01905441,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06109026281954108,"score_gpt":0.2576122065992608,"score_spread":0.1965219437797197,"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."}}