- Rating
- 4
- Confidence
- 3
- Informativeness
- 3
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
SemReC addresses semantic mixing and fragmentation in multi-view clustering by correcting an existing geometric partition. It selects coverage-oriented representatives, forms frozen local units, and uses two MLLM passes to produce normalized descriptions that are grouped into semantic seeds. A quotient graph retains sample-level connectivity, and a joint objective combines geometric crossing cost with two conditional-entropy terms. The optimizer accepts coupled merge–split moves only when they lower this objective while preserving exactly K nonempty clusters. The paper reports the highest ACC among eight baselines on four visual, image–text, and audio–text benchmarks, averaging 84.97%. Controls examine direct semantic assignment, semantic-seed permutation, auditing, and the application of recomposition to frozen baseline partitions.
Critical strengths
1.The paper introduces semantic evidence to MVC with a concrete motivation, which is correcting fragmentation across clusters and mixing within them. The objective and structural edits follow directly from these two failure modes. 2.SemReC achieves the highest ACC on all four benchmarks, with gains over the strongest baseline ranging from 1.79 points on AwA2 to 41.35 points on Caltech. The improvement extends across visual, image–text, and audio–text settings rather than being confined to one modality. Also, Applying Stages II–III to frozen CorreGen, CANDY, and DIVIDE partitions improves all three metrics in all six reported cases. This supports recomposition as a reusable correction plug-in, which can be useful to future research.
Critical weaknesses
1.The evidence for the two entropy terms is uneven: removing H(S | C) costs 39.17 ACC points on Caltech, whereas removing H(C | S) costs 1.90. Since this ablation is reported only on Caltech, the empirical importance of the reverse term across the other settings is less established. 2.The 30-operation cap may be active in practice. Mean accepted counts reach 28.3 on AwA2 and 27.0 on Fluent. The results do not distinguish runs that exhaust this cap from runs with no remaining improving candidate.
Questions for authors
1.On other datasets, does adding H(C | S) reduce label-based fragmentation relative to the objective without this term, and does that reduction translate into higher ACC?
2.How many runs terminate at the 30-operation cap, and does increasing this cap change the final objective or evaluation scores?
3.What fraction of representatives, and separately of sample coverage, is marked uncertain on each dataset, and how accurately are those unsupported units clustered after recomposition?
Thanks to the authors for the responses, which address the questions and concerns I raised earlier. SemReC puts mixing and fragmentation into a single objective instead of handling them separately, and it corrects an existing partition by merge–split moves that keep the number of clusters K fixed. More importantly, it can serve as a plug-and-play correction module on top of existing methods. Overall, this paper gives the community something worth thinking about, and I recommend acceptance.