{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004094811,0.0004662302,0.0006472294,0.0002303924,0.000147768,0.00012151,0.0004900416,0.0004810239,0.00002831503],"category_scores_gemma":[0.00004743553,0.0005512355,0.0003254905,0.0002211849,0.0001203245,0.0002231568,0.0004319597,0.0006230371,0.000009167281],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002086784,"about_ca_system_score_gemma":0.00004125398,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002584167,"about_ca_topic_score_gemma":0.000003321564,"domain_scores_codex":[0.9983829,0.0001376511,0.0002562269,0.0006328078,0.0000533823,0.0005370093],"domain_scores_gemma":[0.9985021,0.0002253121,0.0001630327,0.0007411187,0.0002076204,0.000160868],"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.0009926191,0.0005287394,0.002392155,0.002482544,0.00628981,0.0004420076,0.005096972,0.45394,0.1473208,0.2750798,0.01044784,0.09498668],"study_design_scores_gemma":[0.001176246,0.0000670306,0.0001317129,0.000651328,0.0006517718,0.00001024948,0.0002079676,0.8506982,0.08496337,0.03645857,0.02353328,0.001450216],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0619949,0.0005634776,0.9327478,0.0000180308,0.0008411581,0.001066948,0.00002408527,0.001454573,0.001288976],"genre_scores_gemma":[0.8180613,0.0001332161,0.1809715,0.00003527961,0.0001857292,0.00001383603,0.0000611727,0.0000859088,0.000452029],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7560664,"threshold_uncertainty_score":0.9996939,"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."}}