- Rating
- 4(+1)
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 3
Read review
Paper summary
This paper presents DePICT, a sensitivity-based method for identifying the most relevant context variables that a downstream optimizer's decision actually depends on. The authors refer to subsets of context variables as an interface, and DePICT identifies a top- interface by ranking coordinates based on solution sensitivities computed through implicit differentiation of the KKT conditions (Theorem 1 and follow-on discussion). This relies on identifying the active set of constraints, and reducible coordinates can fall under two types: (1) the coordinate does not affect the active set (Layer 1), and (2) the coordinate affects the active set but does not change the optimal primal solution, as its effect can be absorbed into the dual variables via e.g. rescaling (Layer 2). The authors derive theoretical properties of irreducible directions (e.g. Theorem 7) and of their top- interface (Proposition 10). The method is benchmarked against baselines on knapsack, shortest path, and Warcraft problems, and a Fama-French (FF25) portfolio task, along with additional studies analyzing the stability and runtime cost.
Critical strengths
This work presents a sound theoretical framework for designing optimization problem interfaces as a subcomponent of learned decision-making systems. The analysis on the symbolic support vs. optimizer relevance is helpful and can be directly useful for a practitioner working with optimization embedded in learning pipelines through e.g. differentiable optimization layers. Example 4 in particular is a common scenario with learned constraints and provides a useful insight on the scale invariance of constraints with a particular linear structure.
Critical weaknesses
The main motivation for this method is somewhat weak in my opinion. The framework requires the model , but in order to design such a model, the designer already needs to know which constraints and corresponding context are important. In particular, if the active set of constraints is already known, then the designer can remove the inactive constraints from the model to get a smaller problem to solve. Yet a large benefit of using constrained optimization is that we don't necessarily know a priori which constraints will be binding at the solution, and solving the problem gives us that information. Moreover, small perturbations of the context may not affect the optimum, but large perturbations could still affect it. For example, in linear programs, changing a cost may not affect the solution until above a certain threshold, where the new solution then jumps to a different vertex. Thus using just local information might e.g. incorrectly decide to remove a sensor that was actually important. I think what is missing that would support the main motivation is a full application that demonstrates the actual cost savings of removing some portion of the context on some downstream task.
Edit for rebuttal: the authors' answers have addressed my concerns substantially, and the new experimental results provide a compelling real-world use case that demonstrates the benefits of the approach. I believe the work is strong and good fit for ICLR, and have raised my score from 3 4 accordingly.
Questions for authors
Can you provide an application that directly demonstrates a cost-savings vs. decision quality comparison for DePICT?
4 comments
Thank you again for your detailed review. As the discussion closes on 18 November, we have uploaded a revised PDF with the new cost vs. decision quality study (Sec. 3.6, Figure 6), added references on sensing and communication costs, the clarification that DePICT does not need the active set in advance, and the first-order scope stated as a limitation.
The other reviewers also recognized the value of the work. Reviewer BCyp noted that “the controlled diagnostics provide convincing examples” and that the paper “evaluates actual decision outcomes rather than prediction accuracy alone”, and after our response wrote “I do recognize that there would be an advantage of your method. I will raise my score.” Reviewer bamJ found “the question is clear and relevant” and that Example 4 explains “clearly why appearing in the active KKT system does not imply relevance.”
If our responses address your concerns, we would be grateful if you would consider adjusting your score.
Thank you and apologies for the late response. I appreciate your detailed answers, which have clarified the majority of my concerns regarding the motivation. Overall, I find the methodology sound and the new results are compelling and demonstrate the practical advantages of the method. I believe the work is strong and good fit for ICLR. I am willing to raise my score from 3 4.
We are delighted to know that the revisions and clarifications have adequately addressed your concerns. Your positive assessment meant a great deal to us. We appreciate the time and consideration you have devoted to reviewing our manuscript.
We sincerely thank the reviewer for the positive assessment, and for noting that Example 4 reflects a common scenario with learned constraints.
Table R1. Full-input pipeline → DePICT pipeline, under the same decision-focused training (regret is the mean over 10 seeds).
[W1] We strengthened the motivation in two ways. The introduction now cites work on the cost of sensing, communication and maintaining inputs (Sec. 1, lines 37–42). A new study shows cost savings together with decision quality (Sec. 3.6, lines 480–515; Table R1). Moreover, DePICT requires only the objective and the constraints of the problem (Sec. 1, lines 55–57; Eq. 1, lines 83–86). The model describes how each candidate input enters the problem, and DePICT finds which constraints and which context are important for moving the constrained optimum. DePICT does not assume that the active set is known. Removing inactive constraints is also not enough: a variable can appear in an active constraint and still be irrelevant (Example 4, Sec. 2.3, lines 186–202). Several existing selectors keep such variables (Sec. 3.3, lines 417–419). Our analysis is first-order, so we focus on local rather than global guarantees, and the paper states this as a limitation (Sec. 4, lines 527–528). The linear-program case is discussed in Sec. 2.3 (lines 229–233): a cost change does not move the solution while the active basis remains unchanged. DePICT combines the sensitivities from many representative contexts (Algorithm 1, lines 270–281), so an input that matters somewhere in the operating regime is kept (Sec. 2.1, lines 107–110). A stability analysis under perturbations is reported in Sec. 3.4. Reviewer BCyp, also emphasized missing experiments about cost saving and practical usage, hence we also added a study with a cost analysis of the full pipeline on two downstream tasks (Sec. 3.6, lines 480–515; Figure 6). Removing about two-thirds of the context lowers storage by 67–70% and the projected cost by 24–40%, and decisions are as good or better (Table R1). The tasks are controlled benchmarks, and the costs are projections under an assumed AWS deployment (App. D.1.19, lines 2666–2667).
[Q1] Sec. 3.6 (lines 480–515) and Figure 6 give the cost-savings vs. decision quality comparison for DePICT, and Table R1 shows the cost savings and the decision quality side by side. Full details are in Table 8 (App. D.1.19, line 2681).