- Rating
- 1
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper considers a constrained monotone optimization problem where oracle access to the objective function but some constraint functions are not directly accessible and are only available through data. The goal is to globally solve this nonconvex problem using the Polyblock Outer Approximation (POA) algorithm. While a direct adaptation can be done by using data to learn the unavailable constraint function, this involves repeated inner bisection loop to evaluate radial projections. The paper proposes to instead learn the so-called radial inverse, which they showed to be directly related to the radial projection. The proposed Homogeneous-Monotone Radial Inverse (HM-RI) networks learn the radial inverse using structured min-max models, which are used within POA. HM-RI is shown to improve solution quality across synthetic problems and a cellular transmit-power application.
Critical strengths
The observation in Proposition 2 that connects the radial projection to the radial inverse, and the recognition that positive-homogeneity, monotonicity and right-continuity properties are sufficient to construct a radial inverse (Proposition 3) are simple observations. Nevertheless, this led to the development of the paper's framework to apply POA by learning radial inverses as a surrogate for learning the constraint functions.
Critical weaknesses
-
One of the main concerns is that this paper's theoretical guarantees are insufficient. Propositions 1 to 3 are basic properties that are likely well known. Proposition 4 is also not a surprising result given the construction of . Theorem 1 provides a known guarantee for POA, while Propositions 5 and 6 establish error bounds. However, a theoretical guarantee that the resulting overall algorithm (that includes the training to learn the radial inverse) converges to the (approximate) global solution of the original optimization problem is lacking. Overall, the paper offers only marginal contributions and may not meet the high standards expected at this conference.
-
Another major issue is the evaluation metric. The paper's goal is to globally solve the monotone optimization problem where some constraint functions are not available directly. However, the authors used an evaluation metric that projects the obtained solution to the true feasible set using ground-truth constraint functions. Hence, feasibility is not guaranteed. Figure 3 provides some partial answers, but the proportion of feasible solutions obtained by the algorithms (if any) is not reported. The sizes of the experiments are also very small, and limited applicability to practical machine learning problems is a concern.
Questions for authors
- The approach is only applied to the g_i's. Is it possible to extend it to when the h_j's are also not directly available?
- The experiments are too small and most of them are synthetic. What is the largest size that can be reasonably handled? What are other applications that can be tackled?
- What is the proportion of the returned solutions that are feasible for the original problem?
- Does the runtime comparison in Section 5 include training costs? While reporting optimization time separately is reasonable when the learned models are reused across multiple problem instances, it would be helpful to report the training times for HM-RI and M-Net and discuss how many instances would be needed to amortize these costs.