{"id":"W4377231387","doi":"10.1007/978-3-031-33271-5_2","title":"Objective-Based Counterfactual Explanations for Linear Discrete Optimization","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Auction Theory and Applications","field":"Decision Sciences","cited_by":4,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Counterfactual thinking; Computer science; Mathematical optimization; Linear programming; Quadratic equation; Optimization problem; Convex optimization; Quadratic programming; Regular polygon; Discrete optimization; Algorithm; Mathematics","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":[],"consensus_categories":[],"category_scores_codex":[0.002150656,0.0002942522,0.0003558544,0.001022022,0.0005939831,0.0003827667,0.001444715,0.0002274448,0.0001736651],"category_scores_gemma":[0.001342687,0.0002413085,0.000156351,0.0009606405,0.0007001966,0.0003415396,0.0001965852,0.0003266144,0.0001859257],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001635261,"about_ca_system_score_gemma":0.0004612745,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004406591,"about_ca_topic_score_gemma":0.00004733379,"domain_scores_codex":[0.9965875,0.00004184824,0.0006436898,0.001175044,0.00122372,0.0003282372],"domain_scores_gemma":[0.9938779,0.00403788,0.0003986229,0.000852004,0.0007244811,0.0001091536],"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.00001536271,0.00001009362,0.000007102297,0.000003996402,0.000004455756,0.00000114313,0.0002068601,0.9376127,0.00001137558,0.01582801,0.00009572442,0.0462032],"study_design_scores_gemma":[0.0001884314,0.00007122217,0.00001703964,0.00005353287,0.000008498565,0.000002806347,0.000002151086,0.7510137,0.0003923417,0.24364,0.004355361,0.0002549046],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00001734181,0.0000182684,0.995247,0.001336035,0.001115642,0.0006601097,0.0001838973,0.000128619,0.001293072],"genre_scores_gemma":[0.2048362,0.00002568879,0.7752792,0.002578527,0.001967407,0.0003162763,0.0002922135,0.0001589592,0.01454561],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.227812,"threshold_uncertainty_score":0.9840274,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07926726354595628,"score_gpt":0.3599297858864661,"score_spread":0.2806625223405098,"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."}}