- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper proposes MLFN, a multilayer nonstandard tensor latent factor model for representation learning and missing relation-value prediction in extremely sparse multirelational graphs. The method first constructs a third-order node–node–relation tensor using meta-paths and trains a CP latent factor model independently at each layer. It then predicts a subset of unobserved entries, transforms the predictions into pseudo-observations through a nonlinear mapping, and filters samples based on consistency between current predictions and existing pseudo-labels. The retained pseudo-observations augment the training constraints for the next layer. Experiments on several public datasets report competitive predictive performance, and the paper also presents a parallel optimization strategy with empirical speedups.
Critical strengths
-
A coherent training procedure tailored to extreme sparsity. The method retains the original observations while controlling the influence of pseudo-observations through weighting and consistency-based selection. Combining observed-entry reconstruction, pseudo-observation generation, and successive training stages provides a practical approach to strengthening the training signal in sparse tensor completion.
-
Broad empirical evaluation with attention to computational efficiency. The experiments cover four datasets, three data-split settings, and seven baselines, with competitive results and evidence supporting the sample-selection mechanism. The paper also exploits the independence of updates across data blocks when two factor groups are fixed to enable parallel optimization, and reports empirical speedups. Together, these results support the method's practical promise.
Critical weaknesses
- The source of the gains and the necessity of the multilayer procedure remain insufficiently established. The current results more directly support improved parameter estimation through progressive self-training than an expansion of the final prediction function class. Moreover, the layer-count and sample-selection experiments do not fully separate the effects of repeated refinement, the number of pseudo-observations, and cumulative optimization effort. A single-stage CP baseline with pseudo-observation augmentation, evaluated at the same rank and a comparable total optimization budget, would provide a more informative comparison. Reporting the retained and newly added sample counts at each layer would further clarify what drives the improvements. This distinction matters for assessing the method's specific contribution beyond additional data augmentation and optimization.
Questions for authors
-
What evidence shows that repeated pseudo-observation generation and filtering provide benefits beyond a single-stage augmented CP model at the same rank and a comparable total optimization budget?
-
How are the tensor-entry values constructed from meta-path-induced relations?
2 comments
Response to Reviewer Y8Sr
Q2: Meta-path-based tensor values.
For each relation, we multiply the adjacency/incidence matrices along its meta-path to obtain the path-count matrix . After removing self-connections, positive counts are standardized relation-wise and mapped to :
The resulting matrices are stacked as a node–node–relation tensor; zero path counts remain unobserved coordinates rather than observed zeros. The complete construction and examples are now provided in Appendix C.1.
We thank the reviewer again for the helpful feedback. We believe these additions clarify both the source of MLFN's gains and the construction of its input tensors.
Response to Reviewer Y8Sr
We thank the reviewer for the constructive comments and for recognizing the practical promise of MLFN. We have added controlled experiments and clarified the tensor-construction procedure in the revised manuscript.
Q1: Does repeated pseudo-observation generation and filtering provide benefits beyond a single-stage augmented CP model?
To isolate the contribution of progressive multilayer refinement, we introduced Single-EFC (Equal Final Count), a single-stage augmented CP baseline. It uses the same CP rank, nonlinear mapping, confidence screening rule, final retained pseudo-observation count, and total entry-update budget as MLFN. The only substantive difference is that Single-EFC generates and screens pseudo-observations once, whereas MLFN progressively regenerates, screens, and refines them across layers.
Here, each positive value denotes the relative error increase of Single-EFC over MLFN. Across all dataset–split–metric cases, MLFN wins 30 of 36 comparisons, with an average error reduction of 14.61%. Under the most sparse 3:1:6 setting, MLFN wins all 12 comparisons. Single-EFC remains competitive in a few higher-training-ratio cases, which is consistent with our motivation: when sufficient observations are available, one-shot parameter estimation becomes more reliable, whereas progressive generation and repeated screening are particularly beneficial under extreme sparsity. Since the pseudo-observation count, rank, and optimization budget are controlled, these gains cannot be attributed merely to more generated data or additional updates. The complete protocol and results are provided in Section 4.6 and Appendix C.4 of the revised manuscript.