- Rating
- 1
- Confidence
- 2
- Informativeness
- 1
- Presentation
- 1
- Soundness
- 3
Read review
Paper summary
This paper studies first order iterative optimization for optimizing positive definite quadratic objectives, characterizing when different populations of instances use the same optimal solver after -steps, given access to the best solver for -steps where . When such populations do not have the same optimizer, it finds the best compromise and estimates the added error.
Critical strengths
None
Critical weaknesses
Readability: This paper is extremely difficult to parse and understand. The paper introduces countless phrases and terms that have no proper definition, and relies heavily on symbols and jargon. This includes the first sentence of the abstract which mentions a solver, a learned coefficient schedule, and task information, all before we have even been introduced to the motivation behind the problem. This continues in the abstract, "spectra of task laws" has no prior definition and requires reading until page 3 of the paper to understand. This continues with statements like Theorem 1, which uses terms like "fibers", "unresolved moment domains", "local information price", and uses at least 10 unique symbols.
Scope and Novelty: The problem the authors tackle also appears artificial. There is no justification for why one would have access to the first -moments and not more, or less. The mathematical framework has some nice elements, but there is no finite sample or even asymptotic results (which the paper does state in the limitations section). This leads to a paper primarily talking about moments of depth-t programs, rather than learning, which is a different problem than the one mentioned in the abstract. Additionally, it seems difficult to convert these ideas into algorithms, as finding the moments in general is quite difficult.
Questions for authors
See weaknesses section.