- Rating
- 1
- Confidence
- 2
- Informativeness
- 1
- Presentation
- 1
- Soundness
- 3
Read review
Paper summary
The paper studies the minimum inconsistency achievable when assigning group elements to the vertices of a graph with fixed edge transformations. It derives lower and upper bounds on a weighted squared-distance objective, including an exact solution for a single cycle, and develops numerical certificates to assess how closely these bounds approximate the global minimum. Synthetic experiments illustrate the bounds and related spectral properties.
Critical strengths
-
Computable bounds for the stated optimization problem.
For a given graph with fixed edge transformations and weights, the paper derives lower and upper bounds on the minimum weighted squared geodesic consistency error. It also obtains an exact expression for the single-cycle case, making the dependence on the cycle transformation and edge weights explicit. These are concrete theoretical results for the objective studied in the paper.
-
A principled way to evaluate the quality of the bounds.
The paper develops a procedure to place the global minimum within a narrow, mathematically justified interval. This makes it possible to measure how close the proposed inexpensive lower bounds are to the true optimum.
Critical weaknesses
-
Motivation unclear / not grounded.
The paper motivates its work through local search and the order in which search moves are applied, but its main result is a bound on a consistency error defined on a graph. It doesn't clearly show how this bound explains search behavior or leads to a better algorithm. The bound also depends on a base graph, and it is unclear how an actual search algorithm would determine this graph.
As a synchronization optimization problem, the work has value. But the paper doesn't make clear why the new bounds and certificates matter compared with prior work.
Also the purpose of the separate sheaf-distance construction is unclear, the paper does not explain how it relates to the motivating search problem.
This makes me rate 2 instead of 3.
-
Opaque writing and missing supplementary archive.
-
The paper is difficult to follow. E.g., the abstract lists fractional packing, spectral bounds, tree gauges, cycle-balanced sections, and cohomological certificates before clearly explaining the quantity being bounded. Listing these terms does not explain what each result contributes. This is just one example out of many.
-
The reproducibility statement and Appendix H describe a supplementary archive:
(L507) The supplementary code release provides all JSON records, scripts and one-command verification.
(SM, L1324) The supplementary archive contains the source (
paperB/), all inputs, all JSON results with per-record inputs and certificates, the verification scripts for every certificate layer, the figure script that regenerates every figure of this paper from the JSON, and one-command verification scripts with pre- and post-run provenance manifests.I could not find this archive in the supplied materials. No anonymous download link either.
These further lower my rating from 2 to 1.
-
Questions for authors
-
Given a real search algorithm, how should the base graph be determined, rather than picked by the researcher?
-
Beyond certifying the consistency objective, how do these results help us understand or improve a concrete search algorithm? More broadly speaking, why should ICLR readers care about these results?
-
(L368) So far every statement has been a theorem; we now test each one, ... and a development batch precedes a single confirmation batch (Table 2, Appendix H). Fourteen consistency checks (V0), among them the fixed-space pitfall of Proposition 4, run first and all pass.
What are “development batch” and “confirmation batch”? What is done in each?
-
(SM, L1293) ... the master seed 20260904 ...
What is the point of providing this seed without the code and environment details needed to use it? or, where can reviewers access the supplementary archive?