{"id":"W2121824931","doi":"","title":"The P-Norm Push: A Simple Convex Ranking Algorithm that Concentrates at the Top of the List","year":2009,"lang":"en","type":"article","venue":"DSpace@MIT (Massachusetts Institute of Technology)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":143,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"York University; National Science Foundation","keywords":"Ranking (information retrieval); Generalization; Computer science; Norm (philosophy); Ranking SVM; Learning to rank; Regular polygon; Boosting (machine learning); Simple (philosophy); Algorithm; Mathematics; Machine learning","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":[],"consensus_categories":[],"category_scores_codex":[0.0006162236,0.0002553512,0.0003386753,0.0001505119,0.000917098,0.0001476211,0.003254893,0.0002439986,0.00002098793],"category_scores_gemma":[0.0002636987,0.0001348756,0.0001757837,0.001380132,0.00156019,0.0004212059,0.000832397,0.0004846073,0.000008069427],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001004499,"about_ca_system_score_gemma":0.0001919262,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004413456,"about_ca_topic_score_gemma":0.0001357705,"domain_scores_codex":[0.9978638,0.00009151358,0.0004462027,0.0004158747,0.000618178,0.0005644483],"domain_scores_gemma":[0.9973584,0.0001422859,0.0004527819,0.001729228,0.0002547177,0.00006257741],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00004479499,0.0003234624,0.02198905,0.00005121923,0.0003492075,0.00002564462,0.001782394,0.00269603,0.004588443,0.5117404,0.0247248,0.4316846],"study_design_scores_gemma":[0.002080177,0.0002681553,0.004126821,0.0001621662,0.00005836344,0.00005357693,0.0003430097,0.05508412,0.07892814,0.02560767,0.8327128,0.0005749778],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"commentary","genre_gemma":"empirical","genre_scores_codex":[0.1138372,0.01007861,0.3478723,0.4983054,0.004406411,0.005645887,0.000218181,0.001859541,0.01777649],"genre_scores_gemma":[0.9826557,0.0004655996,0.01458427,0.0009591678,0.00003906222,0.00003640267,0.000007272586,0.00001584955,0.001236684],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8688185,"threshold_uncertainty_score":0.7053669,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0132587340757605,"score_gpt":0.2457731972886478,"score_spread":0.2325144632128873,"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."}}