{"id":"W4409365321","doi":"10.1609/aaai.v39i11.33208","title":"Learning Valid Dual Bounds in Constraint Programming: Boosted Lagrangian Decomposition with Self-Supervised Learning","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Dual (grammatical number); Decomposition; Lagrangian; Constraint (computer-aided design); Computer science; Mathematical optimization; Constraint programming; Artificial intelligence; Mathematics; Applied mathematics; Stochastic programming; Chemistry","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.002502265,0.001530915,0.001550586,0.0009019846,0.0004913765,0.001450386,0.002161305,0.001760419,0.00267739],"category_scores_gemma":[0.008517969,0.0009118527,0.001064206,0.001015663,0.001510739,0.002205614,0.002456378,0.003968706,0.0008744102],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001351407,"about_ca_system_score_gemma":0.002190568,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003460007,"about_ca_topic_score_gemma":0.004152602,"domain_scores_codex":[0.99873,0.0004913867,0.00005235353,0.0002235073,0.0003685863,0.0001340894],"domain_scores_gemma":[0.9956467,0.00250392,0.0004690807,0.0005194234,0.000661915,0.0001990056],"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.00006953102,0.0001175175,0.000788411,0.0001114183,0.00005037735,0.00006170355,0.00008452073,0.8922548,0.001115753,0.02148375,0.004111285,0.07975096],"study_design_scores_gemma":[0.000004879336,0.000006639987,0.00001892868,0.000006694503,0.00000177615,0.000003597132,0.000002764811,0.9956474,0.0001568081,0.003927201,0.0002212015,0.000002096532],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005493869,0.0002554987,0.9916306,0.0001946121,0.0000351892,0.0000397892,0.00003966319,0.0005251636,0.001785528],"genre_scores_gemma":[0.3358532,0.0004265782,0.6581241,0.0006199359,0.0001660252,0.0003886179,0.000518147,0.0006051413,0.003298206],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003460007,"threshold_uncertainty_score":0.01323336,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02759433636576968,"score_gpt":0.2845751334361449,"score_spread":0.2569807970703752,"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."}}