{"id":"W3176077280","doi":"10.1016/j.compchemeng.2021.107413","title":"Bounding convex relaxations of process models from below by tractable black-box sampling","year":2021,"lang":"en","type":"article","venue":"Computers & Chemical Engineering","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":11,"is_retracted":false,"has_abstract":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bounding overwatch; Mathematical optimization; Black box; Sampling (signal processing); Convex optimization; Process (computing); Regular polygon; Affine transformation; Minimum bounding box; Computation; Global optimization; Computer science; Mathematics; Algorithm","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.00008257608,0.0001646004,0.0003219853,0.00006210536,0.00004407726,0.00004734299,0.0002195162,0.0001069216,0.0000464157],"category_scores_gemma":[0.0005134513,0.0001939608,0.00006899251,0.0003774391,0.00004243771,0.0002643575,0.000108862,0.0003044387,0.000002504147],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001088288,"about_ca_system_score_gemma":0.00005694109,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002945673,"about_ca_topic_score_gemma":1.023591e-7,"domain_scores_codex":[0.9986873,0.00001173686,0.0003811174,0.000303004,0.0003182601,0.0002986304],"domain_scores_gemma":[0.9985607,0.0007281826,0.00009220522,0.0002645096,0.0002239826,0.0001303895],"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.000004885656,0.0001052705,0.000008699215,0.0002936815,0.00007210905,0.000005521959,0.0008005617,0.8884513,0.1073927,0.001933263,0.0003274263,0.00060455],"study_design_scores_gemma":[0.0003104315,0.000003782072,6.885589e-7,0.0001434463,0.00001322069,0.000003346499,0.00006169167,0.8271306,0.1645758,0.00748055,0.0001160251,0.0001604367],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.05526176,0.0002094352,0.943935,0.00007326081,0.0000944542,0.0001138623,0.00003043615,0.0001501954,0.0001315581],"genre_scores_gemma":[0.3092268,0.00002352669,0.6904436,0.00001772857,0.00007221223,0.00001401995,0.00009497957,0.00005385855,0.0000532848],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2539651,"threshold_uncertainty_score":0.7909492,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03991637493867631,"score_gpt":0.3113688499825047,"score_spread":0.2714524750438284,"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."}}