{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01324884,0.002058807,0.002382898,0.001607764,0.001377393,0.003190341,0.002561763,0.00317508,0.004039635],"category_scores_gemma":[0.08002435,0.0008650042,0.001739267,0.001970762,0.005797143,0.00720612,0.003257059,0.004697206,0.001108976],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002338479,"about_ca_system_score_gemma":0.002792145,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001781956,"about_ca_topic_score_gemma":0.001813309,"domain_scores_codex":[0.9933566,0.003661204,0.0002301975,0.0009665149,0.001154573,0.0006307964],"domain_scores_gemma":[0.9241073,0.06357631,0.002364384,0.007184689,0.001777027,0.0009902633],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00130275,0.0002967555,0.007905323,0.0007231206,0.0004647499,0.0003622233,0.000428539,0.5733563,0.008723645,0.2640441,0.01192448,0.1304681],"study_design_scores_gemma":[0.0001297591,0.000418944,0.001168455,0.0001393959,0.00009389699,0.00040187,0.0001300802,0.8037667,0.003652876,0.1872291,0.002818253,0.00005083593],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1137823,0.005602848,0.8547518,0.005405773,0.0003765289,0.000220766,0.0001956512,0.001262104,0.01840219],"genre_scores_gemma":[0.7783571,0.002556644,0.213071,0.001770671,0.0003701341,0.0002299486,0.0002281448,0.0006649388,0.002751436],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01324884,"threshold_uncertainty_score":0.07006741,"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."}}