- Rating
- 2
- Confidence
- 2
- Informativeness
- 1
- Presentation
- 1
- Soundness
- 2
Read review
Paper summary
This paper takes optimization problems which can be written in two stages, and aims to find a compressed relationship between the first and second stage. This is done by evaluating the objective, using autodifferntiation to compute hessians, checking that the ranks of the hessians are consistent, and then finding a summary of the relationship between the stages. They give theoretical results which show that enough random probes reveal the full derivative span, under analyticity and other assumptions. If that span has constant dimension r nearby, then an r-dimensional nonlinear sufficient summary actually exists locally, and no smaller regular summary works. As far as I can tell, the contribution of this paper is theory which specifies conditions under which a low-rank hessian around observed points leads to a low-rank summary being guaranteed to exist. There are some computations done to verify this, but they are very difficult to follow.
Critical strengths
The introduction is well-written. I didn't really understand the purpose of the paper from the abstract but the gravitational example makes it simple and concrete.
Section 2 is mostly clear, and the theory all seems to be correct.
The problem considered in the paper is interesting and not one I had thought about before.
Critical weaknesses
The definition of 'interface' which seems to be completely crucial to the paper is buried in the introduction.
The examples in section 3 all seem to be control problems, but the dynamics are never explicitly written. The reader instead has to figure them out from the prose.
It is extremely hard to understand the experiments of section 4 from the text. There are no subsections, diagrams, results plots, and the details of each experiment are buried in a paragraph of text.
It took me quite a while to understand the actual purpose of the paper. A clearer statement of the aim of the paper near the start would be useful.
All examples considered in the computational experiments are tiny by the standards of optimization papers.
I think this paper needs a significant rewrite. It currently lacks a clear logical flow, and I had to repeatedly go back and forth, rereading parts over and over, to understand what is happening. Almost everything is in long paragraphs of text with no subsection breaks, diagrams or tables. The experimental sections are especially hard to read.
Questions for authors
What is it which prevents larger experiments (such as control problems with larger time horizons) from being possible?
Response to Reviewer Xike
Thank you for the detail of this review and for checking the theory. We worked from your list of where the paper lost you.
You noted that the definition of the interface is crucial to the paper and was hard to find in the introduction. Section 2 now states it as Definition 2.1, followed by the problem. The introduction gives it in words first.
You noted that the dynamics of the examples in Section 3 were never written out. Section 3.1 now displays the simulation's update and objective with every constant and derives the coast time τ in the zero-effort miss q+τq˙−q∗ (the displacement from the target q∗ of the point where the mass would end if it coasted). Each of the three examples has its own subsection.
You found the experiments of Section 4 very hard to follow, with no subsections, diagrams, or results plots and each experiment's details inside one paragraph. Section 4 now opens with the procedure as a numbered list and has a subsection for each experiment (the Feynman formulas, the objectives with hidden interfaces, the two baselines). Table 1 gives each formula's context, probe, rank, and returned summary. To keep the page limit, the baselines' details moved to Appendix B and Section 4.3 summarizes them. We did not add a results plot.
You asked for a clearer statement of the aim near the start. The first paragraph of the introduction now states the aim. The second works it through the point mass of Figure 1. We state the formal problem after Definition 2.1.
We are glad that the gravitational example made the idea concrete. It is still in the first paragraph. Table 1 now lists it with its product m1m2. The point mass leads because its code never computes its interface.
You noted that all our examples are tiny by the standards of optimization papers. They are as small as before, apart from the two runs of a longer simulation described below. We believe that the paper's claims do not rest on larger experiments. The theorems hold at any dimension in exact arithmetic. Each example tests one hypothesis or what the procedure returns. We agree that a demonstration on a large problem would have strengthened the paper. Section 6 says that the evidence lacks a decision program at scale that someone else wrote.
You asked what prevents larger experiments, such as control problems with longer horizons. The horizon enters the rank computation through the number of derivative evaluations. Our implementation takes one Hessian-vector product per probe coordinate (each at a small multiple of a gradient's cost), so a stack of m probes of dimension p costs about mp gradient evaluations however large the context is (Section 2). In the simulation p counts the second phase's thrust coordinates, so it grows with the horizon. With a context of dimension 1000, a synthetic objective takes 3 probes (Section 3.3). In the simulation the zero-effort miss has two coordinates at every horizon. With phases of 100 and 400 steps, 204 context coordinates and 800 probe coordinates, the simulation's rank is still 2 (Appendix B, new).
The horizon also enters through conditioning. With the terminal velocity penalized as well at those phases, the interface is the four-number handoff state. Over 400 damped steps, however, two of the stack's four nonzero singular values are below our cutoff of 10−10, by less than a factor of two, and the computed rank is 2 (Section 6 and Appendix B).
The discovery procedure of Section 4 is more limited. Its first step differentiates in every context coordinate. Its closed-form fit searches over monomials, whose number grows combinatorially with the context dimension and the degree. The largest context we fit has 5 variables (Section 6). We have not yet run the method on a large program written by someone else.
We agree with you that a significant rewrite is due. This revision goes part of the way. It rewrites the abstract and the opening, adds the definition, the problem statement, the simulation's equations, the numbered procedure, the subsections, and Table 1, and simplifies the wording throughout. The order of the argument is as submitted, and several long paragraphs remain. Thank you again for the care in this review.