- Rating
- 2(+1)
- Confidence
- 3
- Informativeness
- 1
- Presentation
- 1
- Soundness
- 1
Read review
Paper summary
The paper addresses the problem of estimating the drift of a semimartingale having access to its marginal flow. It provides two different formulations of the problem. In the first the drift is parametrized as a linear function of the position of the process and some auxiliary variables . In the second. the drift is seen as a function of the current state of the process and a hidden variable.
The first formulation leads to a convex optimization problem, whereas the second leads to a quadratically constrained programme. These problems can be solved using classical algorithms for non-linear optimization.
Critical strengths
The problem is interesting and potentially has applications in flow matching and beyond. The proposed formulations have the advantage of leading to simple optimization problems.
Critical weaknesses
- I am sorry to say this, but the paper is extremely challenging to be read by a human with background in stochastic calculus. There are plenty of meaningless convoluted sentences obscuring the simple messages they aim at conveying. Many key concepts on the contrary are not explained.
- Despite this abundance of text, the two optimization problems (9) and (10) are not derived rigorously or justified with a convincing heuristic calculation.
- The main Theorems in section 4 is about NP-hardness of the proposed models which is in my view not at all the natural results one looks for in this context.
The list of issues is not complete but frankly I have the strong feeling that the authors do not put enough effort in reviewing what LLMs produce. If this is the case, reviewers should not do this part of the job for them.
Questions for authors
- Can you justify the objective functions in (9) and (10)? What does it represent in terms of the underlying stochastic process?
3 comments
I thank the author for the detailed answer. Overall, the paper has improved and I am inclined to (slightly) increase my score.
Thank you!
Thank you! We genuinely appreciate your +1.
If there were any further details we could add, please let us know before the deadline in circa 20 hours.
Response
We accept the criticism of the writing. The revision rewrites the abstract and introduction, removes the convoluted passages you objected to in Sections 1–3, 6 and 7, and adds the overview figure. On the use of AI tools: the paper discloses that they were used to aid writing and drafting, and that all AI-assisted work was reviewed by the authors. Your review shows the prose was not reviewed hard enough, and we have now done so.
Can you justify the objective functions in (9) and (10)? What do they represent in terms of the underlying stochastic process? This was missing from the main text. New Section 4.3 (proofs in Appendix G) derives it from one property of the process. Let π_k be the joint law of (X_{t_k}, X_{t_{k+1}}). It is a coupling of the two observed marginals, and by the Doob decomposition its conditional mean increment is the drift b_k(·; θ⋆). So the true joint law satisfies the constraint of (9) at θ⋆ with zero slack. Three facts follow.
NP-hardness is not the natural result in this context. We agree. The natural statistical results are identification, consistency and rates; in the paper these are Proposition 6.1, Corollary Q.1 and Theorem R.10 (Eq. 17). The hardness result shows that the hidden state, not the transport, makes the problem hard, and so justifies a certified global solver (Section 7) and the cheaper decomposition. The theorem has moved to Appendix S. Section 4.3 keeps one paragraph that states this purpose and the result's scope: the experiments use a fixed affine basis and are not in the hard family.
Key concepts not explained. Section 1 now explains the three nested σ-fields in words: everything at t_k, what marginal-law data can reveal, and its rounding to the grid. Section 3 explains why a coupling must be posited. Appendix A collects the stochastic-calculus definitions. If there are specific concepts you found undefined, we would be grateful for a list, and we will address each.