- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper proposes ReLaS, a framework for incomplete multi-view learning that focuses on recovering missing relations between samples. It includes three main components: direct relation estimation, cross-view relation recovery, and latent consensus graph learning. The method uses information from overlapping views to recover missing relations and estimate their reliability. Experiments on eight benchmark datasets show promising classification results, and ablation studies evaluate the contributions of different components.
Critical strengths
1.The paper addresses an important problem by considering missing relations, not just missing features.
2.The framework combines relation recovery and reliability estimation, and the experiments cover multiple datasets and missing-view rates.
Critical weaknesses
1.The paper does not clearly explain how it differs from existing relation recovery methods.
2.The method relies on overlapping nodes across views, but its limitations under low overlap or inconsistent structures are not well studied.
3.The reliability calibration method may not accurately reflect the correctness of recovered relations.
4.The experiments lack sufficient statistical analysis, such as results across repeated runs and significance tests.
5.The paper provides limited analysis of computational cost and scalability to large datasets.
Questions for authors
Please refer to "Critical Weaknesses".
2 comments
Response to Reviewer s7JA (Part 2/2)
4. Repeated-run statistics and performance variability.
Thank you for highlighting the need for more complete statistical reporting. In addition to the main ACC/Macro-F1 comparison in Table 1, the revised Appendix B.3 (Tables 4 and 5) presents ACC and Macro-F1 means and standard deviations across all eight benchmark datasets at VMR , , and , with 10% labeled samples.
These supplementary results display performance variability alongside average classification results, providing additional information on robustness across experimental settings. The main manuscript also presents results over a wider range of VMRs in Fig. 3 and component-level comparisons in Tables 2 and 3.
Revision: Appendix B.3 (Additional Classification Results), including Tables 4 and 5, has been added.
5. Computational cost and scalability.
ReLaS employs a sparse computational design. CRR generates relation candidates by transferring local neighborhoods through shared bridge nodes rather than exhaustively enumerating all sample pairs. Reliability-based admission limits the recovered set, while LCGL optimizes admitted undirected-edge variables instead of a dense affinity matrix. These choices help control the cost of relation recovery and structure estimation.
The new Appendix B.2 (Fig. 7) reports runtime comparisons of nine methods across eight datasets at VMR and LAR . ReLaS records the shortest runtime on six datasets and the second-shortest on the remaining two. On ALOI-100 (10,800 samples) and Fashion (10,000 samples), mean runtimes are 33.28 s and 40.22 s, respectively.
Datasets with more than 100,000 samples are not currently available within the experimental resources of this study. Nevertheless, sparse candidate generation, edge-variable optimization, and the observed runtime results support the potential of ReLaS for larger-scale incomplete multi-view learning. Further evaluation on larger datasets will be explored in future work.
Revision: Sections 3.2 and 3.3 describe sparse recovery and edge-based optimization; the newly added Appendix B.2 and Fig. 7 provide runtime comparisons.
Thank you again for the constructive comments. The revisions clarify the novelty and applicability of ReLaS and strengthen the evidence concerning reliability-aware recovery, performance variability, and computational efficiency.
Response to Reviewer s7JA (Part 1/2)
Thank you for recognizing the importance of relation-level incompleteness and the combination of recovery and reliability estimation in ReLaS. The comments have helped clarify the methodological distinctions and strengthen the experimental presentation. Relevant revisions are highlighted in red.
1. Distinction from existing relation recovery methods.
Existing approaches address different aspects of incomplete multi-view structure. RTRGC studies similarity-graph completion, ASCR learns and completes anchor-sample similarities, while SFCR and CAL exploit cross-view affinities for structural modeling. More recent methods, including AGF-TI and RCIMVC, further investigate structural information recovery.
ReLaS focuses on the observability and reliability of pairwise evidence under view missingness. DRE distinguishes observation opportunities Oe from edge confirmations Ce and estimates (qe,πe). CRR uses bridge-relative structural correspondence to recover unconfirmed relations and calibrates (re,ηe) through controlled pseudo-missingness. LCGL integrates both evidence sources with reliability-weighted fidelity and relation-profile consistency to learn the latent consensus graph. The contribution lies in jointly modeling direct evidence, uncertain recovery, and reliability-aware graph estimation, rather than treating relation recovery as graph completion alone.
Revision: Section 2 (Related Work) explicitly discusses these distinctions; Sections 3.1–3.3 detail the corresponding mechanisms.
2. Low overlap and inconsistent cross-view structures.
CRR establishes structural correspondence through shared bridge samples Buv=Ωu∩Ωv. Bridge-guided candidate generation transfers local neighborhoods, and controlled pseudo-missingness calibrates recovered-relation scores. Only candidates with positive calibrated reliability ηe>0 are admitted into LCGL, reducing the influence of unsupported transferred evidence.
Importantly, ReLaS does not rely solely on CRR. With limited shared samples, fewer informative cross-view correspondences may be available, but DRE can still estimate the strength and reliability of directly observable relations, and LCGL can learn from the available evidence. If a view pair has no shared bridge samples, recovery through that pair is unavailable; however, DRE and LCGL can still operate on existing direct relations. Thus, the framework retains a direct-evidence pathway when cross-view transfer is limited.
The expanded Fig. 4 reports relation loss and recovery recall on all eight datasets over VMRs of 0.1–0.8. Although recovery rates vary by dataset, CRR continues to recover missing relations as view missingness increases. This analysis complements the method's reliability-aware selection mechanism. The revised conclusion also identifies sufficient bridge information and informative structural correspondence as favorable conditions for ReLaS.
Revision: Section 3.2 describes bridge-guided recovery; Section 4.4 and the updated Fig. 4 extend the relation-level analysis to eight datasets; Section 5 further clarifies the applicability conditions.
3. Reliability calibration and recovered-relation correctness.
Equation (13) does not label unconfirmed relations as semantically incorrect. Its zero target indicates that a specific confirmation-loss event did not occur under controlled pseudo-missingness, not that the underlying relation is false. Isotonic regression calibrates recovered scores against these events; ηe measures the relative trustworthiness of recovered evidence beyond the pseudo-recovery base rate, rather than a semantic-correctness probability.
The new Table 3 supports the practical value of reliability-aware recovery. At VMR =0.5 and LAR =0.1, Full CRR outperforms No CRR and CRR (Oe=0 only) in ACC and Macro-F1 on all eight datasets. Relative to strict-only recovery, the dataset-averaged gains are 0.73 and 0.76 percentage points, respectively. These results demonstrate the downstream benefit of admitting informative, reliability-filtered relations beyond the strictly unobservable set.
Revision: Section 3.2 clarifies pseudo-missingness targets and ηe; Section 4.3 and the newly added Table 3 provide the CRR ablation.