- Rating
- 3
- Confidence
- 4
- Informativeness
- 3
- Presentation
- 3
- Soundness
- 3
Read review
Paper summary
This paper proposes Decoupled Neighborhood-Induced Multi-Modal Clustering (DNI-MMC) for mitigating modality conflicts in multi-modal clustering. The key idea is to decouple multi-modal graphs into multiple edge-disjoint frequency-aware graphs according to the cross-modal occurrence frequency of edges. High-frequency edges are treated as more reliable and are expected to capture shared consensus, while lower-frequency edges are treated as auxiliary or less reliable information. Based on this decoupling, the paper introduces a structure alignment loss and a tractable surrogate objective consisting of a soft ranking loss, a variance penalty, and a negative constraint. Theoretical results include an upper bound relating the alignment loss to the surrogate loss, a k-means cost bound, and a mini-batch variant. Experiments are conducted on five multi-modal datasets and several multi-modal attributed graph datasets, with comparisons against a number of shallow and deep baselines.
Critical strengths
The paper proposes a simple and intuitive frequency-based neighborhood decoupling strategy to mitigate modality conflicts in multi-modal clustering.
The structure alignment loss and its surrogate ranking-based formulation provide a reasonable way to inject hierarchical neighborhood information into the modality-joint representation.
The paper provides theoretical analyses, including an upper bound for the alignment loss and a k-means cost bound.
The method is evaluated on both multi-modal clustering and multi-modal attributed graph clustering tasks, showing competitive performance on several benchmarks.
Ablation studies, hyperparameter sensitivity analysis, and visualization are provided.
Critical weaknesses
The assumption that cross-modal edge frequency is a reliable proxy for semantic consistency is not sufficiently validated. The paper only states that statistical analysis reveals a strong positive correlation between edge frequency and the homophily ratio, but does not report correlation coefficients, significance tests, or per-dataset details. High-frequency edges may also arise from shared noise or common biases across modalities, rather than true semantic agreement.
The proof of Theorem1 appears to contain formatting and derivation issues. For example, in Case2, the expression
seems to be missing an operator, and the constants in the final bound need to be carefully checked against the definition of $\mathcal{L}_{tra}$. The statement
should be verified with all coefficients and assumptions explicitly stated.
Theorem2 and Corollary1 depend on the true cluster indicator vector , which is unavailable in unsupervised clustering. This is acceptable as an oracle-style theoretical analysis, but the paper should clearly state this limitation and avoid implying that the bound is directly computable or optimizable in practice.
The experimental tables are poorly formatted and difficult to verify. In Table~1, method names and numerical values are concatenated (e.g., ``AWPEEMVCCAMVC''), several columns appear missing, and the reported improvements are not always consistent with the claim of consistent superiority. For instance, the NMI improvement on nuswide is negative (), and the ARI improvement on Photo is also negative (). The paper should report complete results, standard deviations, and statistical significance tests.
The paper claims state-of-the-art performance, but several improvements are very small. For example, on Reuters, the ACC improvement is only , and on nuswide, the NMI is slightly worse than the best baseline. The claims should be softened or supported by significance testing.
Hyperparameter and implementation details are insufficient. The sequence is only constrained by , but the actual values or learning strategy are not specified. The learning rate is written as ``-01'', which is clearly a typo. The choice of 2,500 training epochs, early stopping, batch size, network architecture, loss weights, random seeds, and number of repeated runs are not adequately described.
The scalability and computational complexity of the proposed method are not sufficiently analyzed. The negative term in sums over , i.e., samples outside the nearest neighborhoods across all modalities, which can be in a naive implementation. Although mini-batch training is mentioned, no complexity analysis or large-scale experiments are provided. The GPU memory entry in Table~6, ``2552.47 for N(0)'', is unclear.
The ablation study in Table~2 contains duplicated or mislabeled rows, such as ``Lrank + Lreg'' appearing twice. It is therefore difficult to determine the individual contributions of , , and . A corrected and more detailed ablation is needed.
The multi-modal attributed graph clustering section does not clearly explain how the graph edges are combined with the modality-specific graphs constructed from attributes. The statement ``obtain the decoupled neighborhoods from them and '' lacks algorithmic detail. In addition, the dataset statistics in Table5 are inconsistent with the main text: Grocery-S is used in experiments but does not appear in Table5.
The paper positions its frequency-based decoupling as fundamentally different from binary consistency-specificity decomposition, but frequency stratification is still a heuristic. Low-frequency edges may contain useful complementary information, and the ranking-based surrogate may overly suppress them. More analysis is needed to justify why the proposed hierarchy is preferable.
Questions for authors
Can you provide quantitative statistics for the relationship between edge frequency and edge homophily ratio, including correlation coefficients, significance tests, and per-dataset results?
Can you correct or clarify the proof of Theorem1 and Theorem2, including all constants, assumptions, and the precise definition of ? How should the dependence on the true cluster labels be interpreted in an unsupervised setting?
Can you provide complete and correctly formatted tables for all experiments, including all baseline results, standard deviations, and statistical significance tests?
How are the weights set in practice? How are the loss weights, learning rate, batch size, network architecture, and number of training epochs selected? Is early stopping used?
Can you provide a computational complexity analysis of the proposed method and scalability experiments on larger datasets?
Can you correct the ablation study in Table~2 and clearly report the individual effects of , , and ?
In the multi-modal attributed graph clustering task, how are the modality-specific graphs constructed and combined with the given graph edges ? Why is Grocery-S missing from Table~5?
Will code and preprocessing scripts be released to support reproducibility?
4 comments
6. Ablation study and the contribution of each loss term
We rechecked Table 2 and did not find duplicated rows in the manuscript version we checked. Nevertheless, we will improve the labels and formatting to make each configuration unambiguous.
To study the individual effects of each loss term, we add a baseline for and report the clustering performance in the following table.
| Dataset | Objective | ACC | NMI | ARI | F-score |
|---|---|---|---|---|---|
| YouTube | 59.90 | 45.16 | 38.51 | 45.50 | |
| YouTube | 43.86 | 30.35 | 22.54 | 31.52 | |
| YouTube | 45.28 | 30.29 | 22.97 | 30.73 | |
| YouTube | Full objective | 61.31 | 45.57 | 39.55 | 46.27 |
| AWA | 68.74 | 75.91 | 60.53 | 61.63 | |
| AWA | 67.71 | 74.66 | 59.71 | 60.37 | |
| AWA | 40.36 | 57.36 | 31.86 | 33.70 | |
| AWA | Full objective | 69.51 | 75.99 | 61.91 | 61.81 |
| Reuters | 53.48 | 35.37 | 28.24 | 45.75 | |
| Reuters | 46.28 | 28.11 | 20.41 | 41.39 | |
| Reuters | 54.95 | 36.63 | 30.06 | 44.65 | |
| Reuters | Full objective | 55.86 | 36.97 | 31.05 | 46.39 |
The results demonstrate the effectiveness of , and , supporting the use of the full objective .
7. Details for Multi-modal attributed graph clustering
In our paper, we first use heat kernel diffusion on the original graph to incorporate topological information into the attributes of both modalities (image and text). We then construct a modality-specific kNN graph from the diffused attributes of each modality and use the resulting two graphs to construct the decoupled neighborhood graphs.
Thank you for pointing out the omission of Grocery-S from Table 5. We will add the missing entry to Table 5 and correct the table in the final manuscript upon acceptance.
8. Reproducibility
We will release the implementation and data preprocessing scripts upon acceptance of our paper.
9. Why use a frequency hierarchy, and how are low-frequency edges treated?
We agree that frequency stratification is a heuristic informed by empirical observations. Our claim is that it provides a useful way to represent differences in average reliability across neighborhoods. The distinction from binary consistency–specificity decomposition is that our method retains multiple frequency levels and models their relative relationships. Low-frequency neighborhoods remain part of the learning objective, allowing their potentially useful complementary information to contribute. More specifically, the ranking surrogate constrains average similarities across frequency-specific neighborhoods. It does not require every high-frequency pair to have greater similarity than every low-frequency pair, nor does it treat all low-frequency edges as negative pairs. Individual relations can therefore deviate from the average ordering. This design provides flexibility to retain useful low-frequency relations.
The manuscript has been substantially improved after revision and, in my view, now meets the standard of ICLR. However, to ensure transparency and reproducibility, the authors must add the public code link as the final sentence of the Abstract. In addition, the authors must ensure that the released code is complete and runnable, including all necessary scripts/instructions to reproduce the reported experiments and figures.
Thank you for taking the time to review the response and for your positive assessment. We appreciate your suggestions for improving transparency and reproducibility. We will release the complete, runnable code in a public repository and add the repository link as the final sentence of the abstract upon acceptance of our paper.
We thank the reviewer for their positive and supportive assessment of our work, as well as their constructive feedback. We address the concerns below.
1. Quantitative evidence linking edge frequency to edge homophily
Our paper reports frequency-specific edge homophily on all five multimodal datasets: CUB, YouTube, NUS-WIDE, AWA, and Reuters in Figure 1 (b). In this part, we add the Pearson correlations between edge-frequency levels and their corresponding homophily ratios in the following table.
These observations support edge frequency as an empirical prior for average semantic reliability for the motivation of neighborhood decoupling.
2. Theorem 1 and the role of ground-truth labels
We have rechecked the proof of Theorem 1 in our manuscript and confirmed that Case 2 already includes the addition operator and that the constants associated with Ltra are correct. Specifically, Ltra consists of three components, each derived from the upper bound on the alignment loss. Our paper discusses these components immediately after introducing Ltra.
Our theoretical analysis evaluates the within-cluster compactness of the learned representations using the k-means cost with respect to the ground-truth partition. To further characterize the quality of the multi-modal data, we introduce the edge homophily ratio, which measures the semantic consistency of graph edges with the ground-truth clusters. These quantities are used solely for theoretical analysis to connect the optimization objective with within-cluster compactness. Specifically, our results upper-bound the k-means cost in terms of the training objective and the edge homophily ratios of individual modalities. Ground-truth labels are not required to train or apply our method.
3. Experimental tables
Upon acceptance, we will improve column spacing, separate method names clearly, and include the corresponding standard deviations and statistical significance tests in the final manuscript.
4. Practical treatment of β and implementation details
An important clarification is that our proposed surrogate loss does not require explicitly setting or learning β. These weights appear in the idealized alignment objective and its theoretical analysis, whereas the ranking surrogate replaces exact similarity targets with ordinal constraints.
In the ablation study, we implement a learnable version of β in Lalig by introducing trainable parameters and applying the softplus function to ensure positivity and range constraints. As discussed in our paper, β is related to the edge homophily ratio and is difficult to determine reliably without ground-truth cluster labels. The ablation results show that Lalig with learnable β yields worse clustering performance than our proposed surrogate loss, supporting the effectiveness of the surrogate formulation.
We use a learning rate of 10−4, a batch size of 4096, and 2500 training epochs, without early stopping. All modality-specific encoders use fully connected architectures, with layer dimensions Di–196–128–64 and 64–128–196–Di, respectively, where Di denotes the feature dimension of the i-th modality. The feature fusion layer is implemented using a single MLP.
5. Computational complexity and scalability
Our method uses mini-batch training to handle large-scale datasets. Let b denote the batch size, D the sum of the input dimensions across modalities, and d the dimension of the fused representation. With brute-force exact neighborhood construction, computing pairwise distances takes O(b2D) time, with an additional cost for neighbor selection. Computing fused similarities takes O(b2d) time, while evaluating the proposed surrogate loss takes O(ℓ2b2) time, where ℓ is the number of modalities. The combined computational complexity of these components per batch is therefore O(ℓ2b2+b2D+b2d).
Our experiments include five datasets with more than 10,000 samples: AWA, Reuters, Reddit-S, Photo, and Grocery-S. The results on these datasets provide empirical support for the scalability of our method.