{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001122442,0.0007830063,0.0008583447,0.0004085569,0.0002586327,0.0005313932,0.0009215355,0.0009283242,0.0008416309],"category_scores_gemma":[0.002511177,0.0003133361,0.0003867943,0.0004355045,0.000499636,0.001228622,0.0008990566,0.001186552,0.0004809558],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003476398,"about_ca_system_score_gemma":0.0005132021,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002802746,"about_ca_topic_score_gemma":0.0005263546,"domain_scores_codex":[0.9993037,0.0002275713,0.0000479237,0.0001355914,0.0002392518,0.00004607213],"domain_scores_gemma":[0.9992448,0.000284837,0.00009389433,0.00009790916,0.0002283161,0.00005028966],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0007318904,0.0002990922,0.001974534,0.0004319935,0.0002103413,0.0003154202,0.00009722092,0.2290942,0.176597,0.07591134,0.004557753,0.5097792],"study_design_scores_gemma":[0.00001892849,0.00007912192,0.0002641148,0.00001277943,0.00001440252,0.0002030689,0.000004719216,0.9791738,0.01466792,0.003100486,0.002435135,0.00002559541],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004626188,0.0001754713,0.9946792,0.00005979226,0.00003765958,0.0000119504,0.00001145971,0.00009410339,0.0003041605],"genre_scores_gemma":[0.1892658,0.0003333902,0.8073263,0.0001795136,0.00009502589,0.00008499686,0.00009824881,0.0001205739,0.002496254],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001122442,"threshold_uncertainty_score":0.005936146,"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."}}