- Rating
- 2
- Confidence
- 2
- Informativeness
- 1
- Presentation
- 1
- Soundness
- 2
Read review
Paper summary
The paper considers the problem in the following setting:
- Each image is encoded by a frozen DINOv2 model, and its patch features are clustered into 16 categories, giving a 16×16 grid of integers per image. The paper also uses NLCD land-cover maps, 32×32 grids of 16 native land-cover labels.
- Thus, each integer carries some "pattern" / "semantics" or the patch.
- The paper studies the question of whether one can predict the probability of the value of some masked/hidden grid cell value, given all other available cell values.
- The paper proposed a "strip-based" method and it shows this improves over a pairwise pool that combines separate neighbor votes. It also claims that, because the statistics are additive, deleted training records can be removed with a result that exactly matches a fresh rebuild.
Critical strengths
The method improves marginally over the non Neural Network baseline methods.
Critical weaknesses
-
The proposed, "strip-based" method lacks proper motivation and justification. E.g., it is unclear to me why a far-away cell in the nearby strip is considered, yet some other cells with closer distance are ignored.
-
The contribution seems thin: the core idea "COUNT-FITTED STRIP MODELS" seems to be a simple trick.
-
On NLCD, the naive baseline, i.e., 5×5 majority vote, is within about 1.5 points of the best neural model and beats the pairwise baseline. That the proposed method “being close to neural models” in this setting is weak evidence.
Questions for authors
The main evaluations use 16 categories on 16×16 (images) or 32×32 (maps) grids. Would the trade-offs still hold with richer vocabularies or larger grids?