- Rating
- 1
- Confidence
- 3
- Informativeness
- 1
- Presentation
- 1
- Soundness
- 1
Read review
Paper summary
TACA addresses incomplete multi-view clustering (IMVC) via anchor-based contrastive learning, bypassing explicit imputation. It employs Cross-Scale Consistency (CSC) for multi-scale graph alignment and a hard-threshold Negative Decoupling (ND) strategy to filter false negatives, claiming linear computational scaling across five evaluated datasets.
Critical strengths
-
By bypassing explicit imputation and directly aligning available observations at the anchor level, the method prevents noise accumulation from unreliable imputations at high missing rates.
-
The CSC mechanism utilize multi-scale anchor graphs (e.g., ) to enhance structural supervision beyond standard single-resolution approaches.
Critical weaknesses
-
TACA is merely a mechanical amalgamation of mature, conventional techniques (multi-scale graphs, contrastive alignment, hard-threshold filtering ) patched together via interpolation weights () and regularizations.
-
Relying on "shared observed landmarks" to define cross-view anchors is a fundamental flaw. Under severe missing rates (e.g., ), finding enough shared landmarks is highly impractical, leaving disconnected views unaligned and severely restricting the method's real-world applicability.
-
The theoretical claims (Theorems 3.1–3.3) appear hollow. The authors explicitly concede in the appendix that their proofs regarding spectral stability and gradient bounds neither guarantee improved clustering accuracy nor certify false-negative removal, severely undermining the genuine theoretical backing for the method's effectiveness.
-
The claimed linear scalability misleadingly relies on a fixed anchor budget . Table 15 shows severe non-linear computational growth as anchors increase, meaning for large datasets, the model must either sacrifice representational capacity by fixing , or entirely invalidate its own efficiency claims by increasing it.
Questions for authors
-
Does TACA's anchor mechanism collapse at extreme missing rates (e.g., ) due to disconnected view graphs?
-
Relying on a fixed hard threshold () for negative decoupling is highly risky. Early in training, immature features may cause this hard truncation to permanently discard genuine "hard negatives," trapping the model in a suboptimal local minimum.
-
Since the appendix concedes Theorems 3.2 and 3.3 guarantee neither improved clustering nor accurate false-negative filtering, what is their core value? Can these theoretical bounds be meaningfully linked to actual clustering recoverability?
-
Since computational costs surge with the anchor count (Table 15), and a small, fixed cannot capture complex structures in massive datasets, how does TACA genuinely justify its claimed "high scalability" in practice?
Without the authors' reply, I maintain my original score.