{"id":"W1825657983","doi":"10.1007/978-3-319-13075-0_42","title":"Bounds on Double-Sided Myopic Algorithms for Unconstrained Non-monotoneSubmodular Maximization","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Submodular set function; Constant (computer programming); Randomized algorithm; Computer science; Algorithm; Approximation algorithm; Deterministic algorithm; Matching (statistics); Maximization; Greedy algorithm; Online algorithm; Running time; Simple (philosophy); Mathematics; Combinatorics; Mathematical optimization","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.001216479,0.0008239347,0.0008436553,0.001287361,0.0006214294,0.0009742377,0.003883834,0.0004932039,0.00001663318],"category_scores_gemma":[0.0001071568,0.000794125,0.0003255628,0.0008444262,0.000964076,0.0004631809,0.0008486339,0.0007927875,0.00003352724],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003328614,"about_ca_system_score_gemma":0.0005778164,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002301255,"about_ca_topic_score_gemma":0.00004724936,"domain_scores_codex":[0.9947888,0.00003642038,0.0007782906,0.002275608,0.001149449,0.0009714575],"domain_scores_gemma":[0.9959682,0.0008789143,0.0004431458,0.002015677,0.0004372961,0.0002567857],"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.00003440398,0.00005841379,0.00001272571,0.00007461933,0.00002909238,0.00003162571,0.0003800706,0.04564215,0.00006719932,0.1344805,0.00005834683,0.8191308],"study_design_scores_gemma":[0.001184808,0.0004331961,0.00004261379,0.0003905795,0.00001242367,0.00003525646,1.272749e-7,0.7194167,0.001686887,0.2740667,0.001935775,0.0007949335],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00006847027,0.00007210206,0.9912761,0.0009605003,0.003890869,0.001215108,0.00001637318,0.0002587637,0.002241733],"genre_scores_gemma":[0.07682928,0.00002629124,0.9181257,0.002662594,0.001430428,0.00009951556,0.0000565733,0.0000848706,0.0006846818],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8183359,"threshold_uncertainty_score":0.999451,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02816901447274186,"score_gpt":0.261183686321329,"score_spread":0.2330146718485872,"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."}}