{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005621854,0.002310187,0.00335643,0.000717791,0.0006023202,0.001957355,0.00254827,0.00226111,0.003772439],"category_scores_gemma":[0.01819194,0.0008402302,0.00110198,0.001970917,0.001607327,0.004332033,0.002268834,0.002831719,0.0009767839],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001900914,"about_ca_system_score_gemma":0.002065109,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001812208,"about_ca_topic_score_gemma":0.001814494,"domain_scores_codex":[0.996476,0.002030624,0.0001068526,0.0006497258,0.000435156,0.0003015833],"domain_scores_gemma":[0.9873036,0.01019151,0.0006953274,0.001081432,0.0004198367,0.0003082881],"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.0006096977,0.0002749412,0.000903235,0.0003999605,0.0001626271,0.0001696756,0.0001281767,0.8457605,0.002104976,0.07936212,0.005147831,0.0649762],"study_design_scores_gemma":[0.00003723901,0.00007949787,0.0001202178,0.0000156069,0.00001155234,0.00003360138,0.00001288877,0.9464749,0.000701758,0.05201704,0.0004845283,0.00001125633],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04585945,0.001277006,0.9452966,0.001172868,0.00005270195,0.000158306,0.0004395338,0.00073732,0.005006289],"genre_scores_gemma":[0.706748,0.0008834808,0.2854622,0.0006847276,0.0001779117,0.0004886574,0.0007072809,0.0002470314,0.004600598],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005621854,"threshold_uncertainty_score":0.02973157,"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."}}