DePICT: Decision-Preserving Interface for Constrained Downstream Tasks
Not on the map. Why?
Abstract (arXiv)
A constrained optimization problem may involve a parameter in its objective and active constraints, yet the final decision may remain insensitive to small changes in that parameter. This raises a fundamental question: which inputs does a decision making system truly depend on? Building on this question, we introduce DePICT, a procedure for constructing decision preserving interfaces by ranking context directions according to the optimizer's solution sensitivity and aggregating them across an operating regime. We study this problem in a high dimensional setting where primitive context parameterizes a constrained task and the downstream agent observes only a selected subset of context directions. For locally regular constrained programs, we derive a Karush Kuhn Tucker (KKT) based characterization of when a context direction is optimizer relevant. Our analysis shows that appearing in the active optimization problem does not necessarily imply that a variable affects the final decision. Some context directions can alter the KKT conditions while leaving the optimal solution unchanged because their effect is absorbed by the dual variables. DePICT is designed to remove exactly these directions. In a controlled diagnosis, it recovers the decision relevant interface exactly and reduces linear predictor regret to 0.009, compared with 0.475 for the strongest competing baseline.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 27 of its 46 references that are in the map. First posted on arXiv 2 Oct 2026.
Builds on
27 of 46 references.
References · 27
- 2019Mastering Atari, Go, Chess and Shogi by Planning with a Learned Modelcited by 1,353
- 2023Mastering Diverse Domains through World Modelscited by 1,253
- 2017OptNet: Differentiable Optimization as a Layer in Neural Networkscited by 599
- 2019Differentiable Convex Optimization Layerscited by 465
- 2020POMO: Policy Optimization with Multiple Optima for Reinforcement Learningcited by 348
- 2017Smart "Predict, then Optimize"cited by 339
- 2019Differentiation of Blackbox Combinatorial Solverscited by 226
- 2021Efficient and Modular Implicit Differentiationcited by 203
- 2019Learning Improvement Heuristics for Solving Routing Problemscited by 164
- 2020Learning to Dispatch for Job Shop Scheduling via Deep Reinforcement Learningcited by 140
- 2016On Differentiating Parameterized Argmin and Argmax Problems with Application to Bi-level Optimizationcited by 112
- 2019Smart Predict-and-Optimize for Hard Combinatorial Optimization Problemscited by 89
15 more
- 2021Decision-Focused Learning: Through the Lens of Learning to Rankcited by 62
- 2015A PAC Approach to Application-Specific Algorithm Selectioncited by 58
- 2023On the Robustness of Removal-Based Feature Attributionscited by 19
- 2026Position: LLMs Must Use Functor-Based and RAG-Driven Bias Mitigation for Fairnesscited by 10
- 2025What Data Enables Optimal Decisions? An Exact Characterization for Linear Optimizationcited by 9
- 2025Solver-Free Decision-Focused Learning for Linear Optimization Problemscited by 9
- 2026Embodied Foundation Models at the Edge: A Survey of Deployment Constraints and Mitigation Strategiescited by 9
- 2026CatRAG: Functor-Guided Structural Debiasing with Retrieval Augmentation for Fair LLMscited by 9
- 2026RAZOR: Ratio-Aware Layer Editing for Targeted Unlearning in Vision Transformers and Diffusion Modelscited by 8
- 2026G-Drift MIA: Membership Inference via Gradient-Induced Feature Drift in LLMscited by 8
- 2025Feasibility-Aware Decision-Focused Learning for Predicting Parameters in the Constraintscited by 6
- 2026PERSA: Reinforcement Learning for Professor-Style Personalized Feedback with LLMscited by 6
- 2026Listening with Attention: Entropy-Guided Explainability for Transformer-Based Audio Modelscited by 4
- 2019Prediction Focused Topic Models via Feature Selectioncited by 3
- 2023From Principle to Practice: Vertical Data Minimization for Machine Learningcited by 3
Built on by
Citing papers per year: 2026: 1.
1 paper.