{"id":"W3035379790","doi":"","title":"On the unreasonable effectiveness of the greedy algorithm: Greedy adapts to sharpness","year":2020,"lang":"en","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Submodular set function; Greedy algorithm; Cardinality (data modeling); Mathematical optimization; Convexity; Monotone polygon; Computer science; Constraint (computer-aided design); Maximization; Convergence (economics); Algorithm; Function (biology); Greedy randomized adaptive search procedure; Mathematics; Data mining","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.001256293,0.0003836788,0.0004316321,0.0001715544,0.0004925443,0.0002374675,0.003869315,0.0001526271,0.00002488586],"category_scores_gemma":[0.0004834625,0.0002551641,0.0003115678,0.002348768,0.0001721318,0.000326232,0.001448085,0.0005835384,0.00003077822],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001660715,"about_ca_system_score_gemma":0.0002114477,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002900113,"about_ca_topic_score_gemma":0.0002663332,"domain_scores_codex":[0.9968364,0.000608163,0.0004086618,0.0006985202,0.0007773545,0.0006709214],"domain_scores_gemma":[0.9966575,0.0009112483,0.0002077418,0.001697206,0.000191629,0.0003346949],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001542153,0.0003952812,0.002618308,0.0001131631,0.0001162276,0.00004001264,0.001092795,0.006349419,0.006054907,0.9005414,0.0037277,0.07879663],"study_design_scores_gemma":[0.0007916046,0.0008032435,0.06991349,0.0004038359,0.00003756353,0.00005835277,0.0001148656,0.7871346,0.06903914,0.0677317,0.003176991,0.0007946086],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03386073,0.0002166331,0.942398,0.02074866,0.0003033607,0.00142384,0.0000591833,0.0004392499,0.0005503794],"genre_scores_gemma":[0.9266734,0.00001388434,0.06471863,0.007809688,0.0001376591,0.0004802141,0.000003381101,0.00004574766,0.0001174408],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8928126,"threshold_uncertainty_score":0.99999,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01826483245907823,"score_gpt":0.2251249324402157,"score_spread":0.2068600999811374,"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."}}