{"id":"W4414360635","doi":"10.24963/ijcai.2025/285","title":"Learning Optimal Oblique Decision Trees with (Max)SAT","year":2025,"lang":"en","type":"article","venue":"","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Interpretability; Oblique case; Decision tree; Optimal decision; Representation (politics); Benchmark (surveying); Greedy algorithm; Computational complexity theory; Partition (number theory)","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001910056,0.001655909,0.001897183,0.001019435,0.0006832366,0.001946351,0.001562857,0.001759233,0.00607953],"category_scores_gemma":[0.00915346,0.0009082919,0.002327863,0.00196901,0.001018025,0.002638574,0.002130326,0.0029805,0.001200506],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009821815,"about_ca_system_score_gemma":0.001921946,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001868724,"about_ca_topic_score_gemma":0.004488474,"domain_scores_codex":[0.9983909,0.0007106665,0.0001058842,0.0003628144,0.0002451701,0.0001844764],"domain_scores_gemma":[0.9949344,0.004208415,0.000211041,0.000260334,0.0002828334,0.0001029788],"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.0002333731,0.000244491,0.002723933,0.0005369649,0.000136604,0.0002947735,0.000216434,0.6659569,0.001357589,0.08459253,0.01727717,0.2264292],"study_design_scores_gemma":[0.00005182904,0.0000495792,0.0001433165,0.0000431378,0.00002519354,0.00004880212,0.00005888822,0.8796842,0.0004691489,0.117907,0.00150961,0.000009410584],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02899401,0.000765501,0.9624083,0.0007756022,0.00008876863,0.0001732956,0.0007263834,0.0009746517,0.005093594],"genre_scores_gemma":[0.3209221,0.0006217314,0.6701541,0.0007675923,0.0001603708,0.0005979053,0.003569157,0.0003815898,0.002825429],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00607953,"threshold_uncertainty_score":0.02033806,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.006439992787888944,"score_gpt":0.2327816183805852,"score_spread":0.2263416255926963,"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."}}