- Rating
- 1
- Confidence
- 4
- Informativeness
- 1
- Presentation
- 1
- Soundness
- 1
Read review
Paper summary
This paper considers the setting of learning constrained optimization problem solutions via supervised learning. Unfortunately, the poor quality of this submission makes it nearly impossible to understand the motivation, contributions, and experiments of this work. From what I can understand, the work is motivated by the fact that learning optimization solutions through supervised learning depends on the quality of the target solutions themselves. The related work is severely underdeveloped, and no comparisons are made with existing work. The authors design three toy optimization problems, generate candidate solutions to these problems using different approaches, then use those candidates as targets for a learned predictor. I could not find a description of this predictor in the paper itself, it seems to be an MLP but that was only mentioned in passing the main text. The mathematical description of the optimization problems is also missing. Moreover, despite thoroughly reading the main text and appendix, I cannot understand the different approaches that were tried or why each was considered. This makes it impossible to evaluate whether the results are valid. The results themselves seem to contradict the assumption that learning is even valuable to begin with in this setting, as the direct task solver outperforms nearly all the learned approaches in terms of time, optimality, and feasibility. The presentation, informativeness, and soundness is well below an acceptable level for one of the top ML conferences in the world. Therefore, my decision is a clear reject.
Critical strengths
None
Critical weaknesses
I believe that the main fundamental weakness of this paper is that it was entirely LLM generated. I cannot enumerate every piece of evidence for this, but I can list some major offenders. Overall, an incredible amount of jargon is used throughout the paper without definition and without any clarifying examples, analogies, etc., and the paper lacks transition sentences that allow ideas to flow naturally from one to the next for a human reader. This makes the text incredibly terse and difficult to parse, and I could not follow the writing even as someone with years of experience in optimization. The introduction immediately jumps into describing the problem statement without any overarching or high-level motivation. The background and related work are severely underdeveloped, and it is clear that the authors did not perform a sufficient literature review before developing the thesis of the work. For example, I would recommend the authors look into the extensive work on learning to optimize, algorithm unrolling, optimization proxies, etc. that have been developed in the past 10-20 years. The entire hypothesis of the paper seems to rest on a “historical five-trial teacher study,” which has no citation and no description in the main text or appendix. The theoretical results are presented as if they are novel, but they are trivial restatements of known facts (e.g., Proposition 1 is just a restatement of feasibility). Acronyms such as ID are never defined, despite being a crucial part of the results. Finally, as stated in the summary, it is impossible to understand what the experiments are meant to demonstrate, and the results seemingly contradict the premise the learning is beneficial in this setting. This makes the work completely unacceptable for a top ML conference such as ICLR.
Questions for authors
-
What is the motivation for studying this to begin with? Can you describe or identify an actual real-world problem and deficiency of the teacher that demonstrates this claim?
-
Why were these optimization problems chosen? What qualities make them worth studying for your setting?
-
What was the motivation for each of the methods considered?
-
What exactly was being learned? What was the architecture?