{"id":"W2547457306","doi":"10.1109/ccece.2016.7726815","title":"Penalty convex-concave procedure for source localization problem","year":2016,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematical optimization; Regular polygon; Focus (optics); Convex optimization; Norm (philosophy); Computer science; Convex function; Residual; Path (computing); Mathematics; Algorithm","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":[],"consensus_categories":[],"category_scores_codex":[0.00003794606,0.00008723779,0.00008877376,0.00003061053,0.00003148563,0.00001563126,0.00006309074,0.00005831255,0.00003541563],"category_scores_gemma":[0.00001400469,0.00005697766,0.00003039325,0.00004487313,0.00001759925,0.00006981161,0.00001128345,0.00002352678,0.00001786947],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002409142,"about_ca_system_score_gemma":0.000009191519,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003455889,"about_ca_topic_score_gemma":0.000006694434,"domain_scores_codex":[0.9995822,0.000004362226,0.0001054441,0.0001084305,0.00005620508,0.0001433769],"domain_scores_gemma":[0.9997399,0.00003295949,0.00001626652,0.0001113817,0.00006704714,0.00003243766],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00007269211,0.00007045595,0.001882407,0.0003964514,0.0001848971,0.000004383419,0.000824844,0.01106813,0.2434555,0.02836387,0.4911425,0.2225339],"study_design_scores_gemma":[0.0005905611,0.00008052185,0.00009324461,0.0002104111,0.0000199754,0.00001148308,0.00004879479,0.1361876,0.710059,0.01075919,0.141589,0.0003502975],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004216462,0.00004478972,0.9854174,0.0001530828,0.00004912615,0.0003259966,0.000002563008,0.001306156,0.008484371],"genre_scores_gemma":[0.9914151,0.0000153523,0.006673206,0.0001619973,0.00006761451,0.00004829003,0.000003669626,0.00003012196,0.001584593],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9871987,"threshold_uncertainty_score":0.2323481,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01099519778969767,"score_gpt":0.2139833127232169,"score_spread":0.2029881149335192,"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."}}