- Rating
- 1
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 1
- Soundness
- 1
Read review
Paper summary
The paper concerns constrained neural fields, where constraints are expected to hold throughout the domain described by the field, rather than only at sampled points. The authors propose QP projections in the field's coefficient space, using basis bounds and cover-dependent margins to provide continuous-domain feasibility under representation-specific assumptions. The approach is tested on several problems, including motion-trajectory correction, temperature matching, and topology design.
Critical strengths
- The work addresses an interesting problem. The authors apply bounding principles to neural-field representations, providing a handle for enforcing constraints over an entire continuous domain.
- Independent checks and matched QP controls help distinguish the effects of the constraint construction from those of the solver.
Critical weaknesses
In its current form, I find the paper inadequate for publication at ICLR, primarily because of the presentation issues below.
-
Overall, the exposition is unclear. Concepts and notation are presented with insufficient context, and the paper does not read as self-contained.
- The abstract devotes much of its text to experimental results before making the problem and proposed approach clear.
- The introduction is very short and does not sufficiently explain the problem, how it has been addressed before, or the remaining gap. Equations and notation in lines 033 and 040 appear before adequate explanation.
- The related work section is dense and reads largely as a list of papers, with insufficient technical positioning of the proposed work.
- Section 3 is difficult to follow. Some notation is used without being explicitly defined in the main text, leaving the reader to infer its meaning or consult the appendix. Several key concepts are also used with insufficient explanation. The accompanying figures do not sufficiently clarify the construction.
- The comparisons in Section 4 are confusing, particularly regarding which experiments use pointwise constraints, which use continuous-domain bounds, and which methods receive identical constraints.
- What I could follow relied heavily on my own familiarity with convex-hull bounds and cover-based arguments. The paper uses these concepts without enough explanation to make the exposition self-contained.
-
Overall, the contribution is unclear. The authors acknowledge that the bounding principles, QP projection, and exchange methods are established. What is new in how they are combined or used? The contribution list should distinguish the formulation, application-specific constructions, interface, and empirical analysis more clearly.
-
Convex-hull bounds and enclosures can require stricter constraints, reducing the feasible space. The paper acknowledges and measures this conservatism, but its implications for the results and comparisons need clearer explanation. In particular, the cost of continuous feasibility should be distinguished from the additional cost of a conservative approximation.
-
The benefit of learning is not demonstrated. Direct heat optimization achieves a lower objective, with no consistent inference speedup from the learned encoder. The motion experiments do not train an encoder. The results therefore support the constraint constructions more clearly than the learning component.
Questions for authors
Please address the issues above. In addition, some more granular questions and comments:
- Line 016: What are “enclosure or variation bounds,” and what assumptions do they require?
- Line 031: What does “what part of the field is covered” mean here?
- Line 033: What do these coefficient equalities represent? Please introduce the notation and clarify the restriction to affine coefficient constraints.
- Line 040: What are the mixed field constraints? Please explain the notation.
- Line 043: What does “supply linear rows” mean?
- Line 044: Please explain how “a cover radius times a field-variation bound” supplies sufficient constraints.
- Line 102: Please explain “a QP layer with identical rows has the same feasible set; our experiments include this control.” What does this comparison establish?
- Line 106: Please briefly explain exchange methods and distinguish finite-row exchange from continuous constraint separation.
- Line 107: Please explain the Bernstein convex-hull enclosure and why its constraints are sufficient rather than necessary.
- Table 1: Please explain what is presented, particularly the distinction between field interfaces and algebraic QP rows, and what the feasibility column establishes.
Thank you for your response. Currently I choose to maintain my original score.