{"type":"ScholarlyArticle","title":"Sufficient Decision Proxies for Decision-Focused Learning","authors":[{"name":"Noah Schutte","slug":"noah-schutte","given":"Noah","family":"Schutte","affiliation":""},{"name":"Grigorii Veviurko","slug":"grigorii-veviurko","given":"Grigorii","family":"Veviurko","affiliation":""},{"name":"Krzysztof Postek","slug":"krzysztof-postek","given":"Krzysztof","family":"Postek","affiliation":""},{"name":"Neil Yorke-Smith","slug":"neil-yorke-smith","given":"Neil","family":"Yorke-Smith","affiliation":""}],"abstract":"When solving optimization problems under uncertainty with contextual data, utilizing machine learning to predict the uncertain parameters' values is a popular and effective approach. Decision-focused learning (DFL) aims at learning a predictive model such that decision quality, instead of prediction accuracy, is maximized. Common practice is to predict a single scenario representing the uncertain parameters, implicitly assuming that there exists a deterministic problem approximation (proxy) that allows for optimal decision-making. The opposite has also been considered, where the underlying distribution is estimated with a parameterized distribution. However, little is known about when either choice is valid. This paper investigates for the first time problem properties that justify using a certain decision proxy. Using this, we present alternative decision proxies for DFL, with little or no compromise on the complexity of the learning task. We show the effectiveness of presented approaches in experiments on continuous and discrete problems, as well as problems with uncertainty in the objective function and in the constraints.","doi":"10.24963/ijcai.2026/260","url":"https://ijcai.org/proceedings/2026/260","pdf":"https://ijcai.org/proceedings/2026/0260.pdf","markdown":"https://ijcai.org/proceedings/2026/260.md","bibtex":"https://ijcai.org/proceedings/2026/bibtex/260","volume":{"slug":"2026","title":"Proceedings of the Thirty-Fifth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2026","url":"https://ijcai.org/proceedings/2026/","year":2026,"location":"Bremen, Germany","dates":"15-21 August 2026","editors":"Diego Calvanese","isbn":"978-1-956792-09-6","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2026"},"section":"Constraint Satisfaction and Optimization","track":"Main Track","number":260,"pages":{"first":2337,"last":2345},"keywords":["Machine Learning: Cost-sensitive learning","Constraint Satisfaction and Optimization: Mixed discrete and continuous optimization","Machine Learning: Supervised Learning","Constraint Satisfaction and Optimization: Constraint optimization problems","Machine Learning: Regression"],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}