{"id":"W2149333620","doi":"10.1109/tcomm.2004.842001","title":"A New Choice of Penalty Function for Robust Multiuser Detection Based on<tex>$M$</tex>-Estimation","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Power Line Communications and Noise","field":"Engineering","cited_by":22,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Minimax; Detector; Gaussian noise; Algorithm; Noise (video); Gaussian; Multiuser detection; Parametric statistics; Mathematics; Function (biology); Control theory (sociology); Mathematical optimization; Computer science; Applied mathematics; Statistics; Telecommunications; Physics; Artificial intelligence","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.0005215118,0.000533588,0.0004887158,0.0007931027,0.001041406,0.0001102885,0.001269924,0.000355746,0.0004934734],"category_scores_gemma":[0.0001340075,0.0006098984,0.0004447856,0.001135625,0.0001524377,0.0006286169,0.00001737369,0.0008899841,0.0004587352],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004739028,"about_ca_system_score_gemma":0.0001483246,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002116441,"about_ca_topic_score_gemma":0.01866197,"domain_scores_codex":[0.9972718,0.0002642559,0.001081606,0.0004551579,0.0004270438,0.000500098],"domain_scores_gemma":[0.9926512,0.001483066,0.0002907476,0.00484563,0.0004492157,0.0002801216],"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.0001567799,0.0008863298,0.00001035328,0.00007650974,0.0001701611,2.72859e-8,0.0003834495,0.8761363,0.02055061,0.0001211756,0.003594094,0.09791422],"study_design_scores_gemma":[0.00220367,0.0001540894,0.0008341821,0.0002564382,0.0004770297,0.000006047241,0.00002225381,0.5583744,0.004532643,0.0001182955,0.4323024,0.0007185071],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006491978,0.0006649513,0.9862018,0.001632235,0.0005856311,0.001183727,0.0003173655,0.0008303572,0.002091924],"genre_scores_gemma":[0.758111,0.0005225504,0.23818,0.0001533043,0.0001156844,0.0006901295,0.0004234295,0.0001356083,0.00166828],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.751619,"threshold_uncertainty_score":0.9996352,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06852001951557384,"score_gpt":0.2966875188117007,"score_spread":0.2281674992961269,"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."}}