{"id":"W2136690855","doi":"10.48550/arxiv.1211.0056","title":"Iterative Hard Thresholding Methods for $l_0$ Regularized Convex Cone Programming","year":2012,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Thresholding; Regular polygon; Cone (formal languages); Convex optimization; Mathematics; Convex cone; Second-order cone programming; Dual cone and polar cone; Computer science; Mathematical optimization; Algorithm; Artificial intelligence; Convex analysis; Geometry; Image (mathematics)","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002029059,0.001202793,0.001069908,0.0005962404,0.0004407474,0.001192703,0.001371397,0.001283445,0.002672833],"category_scores_gemma":[0.005580955,0.0004612777,0.0008939604,0.0007256382,0.001626001,0.001537033,0.001731441,0.002907057,0.0007426483],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008229289,"about_ca_system_score_gemma":0.0009879811,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001696498,"about_ca_topic_score_gemma":0.001548931,"domain_scores_codex":[0.9988915,0.0004886495,0.00004272399,0.0001841811,0.0003112776,0.00008166097],"domain_scores_gemma":[0.9978874,0.001408783,0.0001647973,0.0001574422,0.0002987275,0.00008293313],"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.0001041183,0.0001074359,0.000578469,0.0003273295,0.00005974918,0.000189926,0.0002071175,0.7081696,0.008584221,0.1863404,0.004126202,0.09120537],"study_design_scores_gemma":[0.000005636229,0.00001992253,0.00004120721,0.00001068226,0.000002609353,0.00002532819,0.00001118271,0.9781429,0.0009933742,0.01975755,0.000982817,0.000006774617],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002086335,0.0001257672,0.9961976,0.000116727,0.00001827371,0.0000242667,0.00001712774,0.00004661239,0.001367375],"genre_scores_gemma":[0.1435004,0.0006073001,0.8479439,0.0002491931,0.0001573825,0.0002810934,0.0001970468,0.0002317697,0.006831937],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002672833,"threshold_uncertainty_score":0.0107308,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1313366534261278,"score_gpt":0.2551386078294804,"score_spread":0.1238019544033526,"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."}}