{"id":"W4312949591","doi":"10.1109/tac.2022.3226713","title":"Submodular Maximization With Limited Function Access","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Automatic Control","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Submodular set function; Pairwise comparison; Function (biology); Maximization; Notation; Mathematics; Computer science; Combinatorics; Discrete mathematics; Algorithm; Mathematical optimization; Artificial intelligence","routes":{"ca_aff":true,"ca_fund":true,"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":[],"consensus_categories":[],"category_scores_codex":[0.0002481758,0.000179486,0.0002070374,0.0003655041,0.0008286782,0.0002342938,0.0007504624,0.00003293641,0.0005048733],"category_scores_gemma":[0.000003270284,0.0001703835,0.0001065896,0.001148476,0.00004178193,0.0007509494,0.000006710954,0.0002383845,0.00002173118],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000107827,"about_ca_system_score_gemma":0.00008063511,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003026022,"about_ca_topic_score_gemma":0.00002223424,"domain_scores_codex":[0.9983274,0.0001990647,0.0002614686,0.0003909201,0.0005589938,0.0002621823],"domain_scores_gemma":[0.9989578,0.0001577264,0.000118519,0.0006112235,0.00007315847,0.00008162222],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001585171,0.0008386708,0.00003366212,0.00003371482,0.0002442628,0.00003877867,0.0004367784,0.5604163,0.0002822544,0.005191512,0.0002091574,0.4321164],"study_design_scores_gemma":[0.001814297,0.0005276343,0.0008089155,0.00001252659,0.00005986343,0.00005747133,0.00003296201,0.9933141,0.0002897891,0.002172581,0.0006836712,0.0002261655],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006843629,0.00001760812,0.9896946,0.001130465,0.0008594096,0.0004990161,0.0000203896,0.0007517347,0.0001831416],"genre_scores_gemma":[0.9926785,0.000002512668,0.005776959,0.0009548803,0.00002062642,0.0003895061,0.000003511432,0.00001695764,0.0001564983],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9858349,"threshold_uncertainty_score":0.6948036,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01695164786375509,"score_gpt":0.2266754972831364,"score_spread":0.2097238494193813,"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."}}