acceptodds
Under review as a conference paper at ICLR 2027

Incomplete Multi-view Partial Label Feature Selection

Abstract

Partial-label feature selection can simultaneously disambiguate candidate labels and select discriminative features when each training instance is associated with multiple candidate labels, and it has proved effective for conventional single-view partial-label problems. However, data in many real-world applications are naturally described by multiple views and may contain missing views, rendering existing methods inadequate. To address this issue, we propose IMPLFS, an incomplete multi-view partial-label feature selection method based on complementary learning.Three key issues need to be addressed: how to learn reliable sample similarities from incomplete views, how to fully exploit complementary information across views, and how to reduce the adverse effect of candidate-label ambiguity on feature evaluation. First, IMPLFS develops a complementary-learning-guided similarity-matrix model that uses observed within-view relations and cross-view complementary relations to complete and enhance the sample-similarity structure of each view. Second, it dynamically integrates the complementary information supplied by different views into a fused graph through graph learning and adaptive view weighting. Finally, it constructs a joint optimization framework for label-confidence estimation and feature selection, allowing label disambiguation and feature evaluation to be updated collaboratively. Experimental results on multiple benchmark datasets demonstrate that IMPLFS outperforms competing feature selection methods and can effectively address the incomplete multi-view partial-label feature selection problem.

Primary area:
unsupervised, self-supervised, semi-supervised, and supervised representation learning
Keywords:
Incomplete Multi-view Learning, Multi-view Feature Selection, Partial-label Learning, Complementary learning.

Reviews

Among:
Shape:
1234this paper, Bottom 10%
Figure 1. Mean review rating of the reviewed papers at ICLR 2027. This paper averages 1.67 over 3 reviews, above 10% of the others.
Reviewer_PLbvOpenReview ↗
Rating
2
Confidence
3
Informativeness
2
Presentation
2
Soundness
2
Read review
Paper summary

This article investigates the feature selection problem for incomplete multi-view partial-label data, where each sample's candidate label set contains exactly one real label. Faced with the problem that traditional single view biased methods may not be effective in multi-view scenario. The article proposes the IMPLFS method, which jointly learns view-specific similarity graphs, cross-view graph reconstruction coefficients, an instance-adaptive fused graph, label confidences constrained to the candidate sets, and sparse feature-selection matrices. In the feature distance and label reconstruction term, missing observation data is masked, while the cross view graph reconstruction mechanism achieves the transfer of structural information between views. The objective function is optimized by alternately solving the simplex constrained quadratic programming problem and iteratively reweighting the feature update process. The experiment was conducted on four benchmark datasets, combined with four downstream label classifiers, to examine the feature selection performance under different view loss rates and feature retention ratios. The results show that among all 16 combinations of classifiers and datasets, this method achieved the highest average accuracy; The ablation experiment also validated the effectiveness of complementary reconstruction and label disambiguation mechanisms.

Critical strengths

1.The modules are logically interconnected, and the overall framework is coherent.

This paper constructs a unified optimization framework to address three interrelated challenges: missing views, candidate label ambiguity, and feature redundancy. Cross-view graph reconstruction leverages relational information from other views to refine intra-view structures; the fused graph provides neighborhood information for label confidence estimation, which in turn supervises sparse feature learning. Clear information flow exists between these modules, enabling structural learning, label disambiguation, and feature selection to work in concert rather than being handled in isolation. From a modeling perspective, there is a clear correspondence between the individual objective terms and the specific problems being addressed. 2.The experimental analysis covers a wide range of dimensions, examining the effectiveness of the method from multiple perspectives.

The paper not only compares the classification performance of various feature selection methods but also evaluates the suitability of the selected features using four downstream partial-label classifiers, thereby reducing reliance on any single specific classifier. Furthermore, the experiments encompass a range of missingness rates, feature retention ratios, parameter settings, and component ablations. As shown in Table 2, the proposed method achieves the highest average accuracy across all 16 combinations of classifiers and datasets; ablation studies also demonstrate that removing either the complementary reconstruction component or the label disambiguation component leads to a decline in performance. These results provide consistent empirical support for the method's effectiveness and the roles of its two primary components.

Critical weaknesses

1.The substantive methodological innovations have not been sufficiently distinguished or substantiated.

While the research problem holds practical significance, the proposed method primarily integrates cross-view graph reconstruction, adaptive graph fusion, graph-smoothing label disambiguation, and row-sparse feature learning into a unified objective. The main text fails to adequately articulate the specific technical contributions—whether in modeling or optimization—that the proposed framework offers compared to existing applications of these mechanisms.

In particular, both cross-view reconstruction and adaptive fusion operate by constraining inter-graph relationships; although they serve distinct functions, their roles may overlap. While the ablation studies validate the benefits of complementary reconstruction and label disambiguation, they do not directly demonstrate the necessity of sample-level adaptive fusion, nor do they sufficiently distinguish the effects of joint optimization from the simple concatenation of existing modules. Consequently, the current evidence supports the effectiveness of the combination, yet the justification for its unique methodological contributions remains insufficient.

2.There is insufficient analysis and validation regarding graph learning biases and label disambiguation errors caused by missing data and unreliable structural information.

In Equation (1), the feature distance is weighted by the view availability indicator variable wi(v)wj(v)w_i^{(v)}w_j^{(v)}. Consequently, if either endpoint is missing in the current view, the distance cost for that sample pair is set to zero. For an observed sample, connections to observed endpoints with positive feature distances incur a cost, whereas connections to missing endpoints do not.

This treatment may make edges involving missing endpoints more likely to be assigned similarity weights, thereby influencing subsequent label disambiguation. Although the model incorporates label information via the constraint 0≤F≤Y0 \leq F \leq Y, the differentiation between candidate labels relies primarily on graph smoothness and feature fitting. If the handling of missing data creates erroneous neighborhoods—or if noisy features and structural conflicts across views cause neighborhood relationships to span across true class boundaries—label confidence may skew toward incorrect candidates. Since label confidence also influences the integrated graph learning and feature selection processes, these errors can be further amplified during joint optimization.

While cross-view reconstruction, sparse regularization, and other objective terms might mitigate these issues, the paper fails to adequately explain how these mechanisms suppress the connection bias associated with missing endpoints, nor does it provide diagnostics of the graph structure or experiments involving structural perturbations. Consequently, the existing experiments involving random data loss are insufficient to demonstrate whether the method can maintain graph quality and prevent erroneous disambiguation—and its subsequent propagation—when structural information is unreliable.

Questions for authors

1.On Innovation and Module Necessity.

Please clearly articulate the novel technical contributions of this paper compared to existing mechanisms for graph reconstruction, graph fusion, and sparse feature learning. Under identical experimental conditions, does joint optimization yield additional benefits over a staged processing approach? What degree of improvement does sample-level adaptive fusion offer compared to uniform fusion or global view-weighting fusion?

2.On the Sufficiency of Comparisons.

Could you include comparisons with suitably adapted recent methods for partial-label feature selection and incomplete multi-view feature selection, ensuring consistent missingness settings, feature budgets, and comparable parameter choices? Additionally, how do baseline approaches—such as using the full feature set or performing feature selection after missing-view imputation—perform? These comparisons would help assess the actual benefits of the proposed joint mechanism.

3.On Handling Missing Data and Structural Reliability

In Equation (1), setting the distance cost associated with missing endpoints to zero might assign them disproportionately high similarity weights, potentially affecting label disambiguation; how do the cross-view reconstruction and other regularization terms mitigate this bias and the resulting erroneous feedback? Could you combine connection weight statistics with controlled structural perturbation experiments to report metrics on graph quality, label disambiguation quality, and classification performance, thereby evaluating the method's robustness against missing endpoints, noisy views, or erroneous neighborhood structures?

1 comment
AuthorsOpenReview ↗

Response to Reviewer PLbv on Joint Optimization, Baseline Comparisons, and HOG Perturbation

Thank you for reading our manuscript carefully and identifying which conclusions needed further experimental support. Your suggestions helped us strengthen the evaluation and clarify what the results say about our design.

Q1. Our contribution is a joint feature-selection objective for incomplete multi-view partial-label data. Cross-view reconstruction recovers view-specific sample relations, and the fused graph guides candidate-label disambiguation. The resulting label confidences then inform the graph updates and supervise sparse feature selection.

Following your suggestion, we added two comparisons in Section 4.7 (Table 5), both at 30% missingness and a 40% feature budget. The first compares full IMPLFS with staged optimization. Staged recovers and fuses the view graphs first, then performs label disambiguation and feature selection with the fused graph fixed. The second compares sample-specific, uniform, and global fusion. These schemes learn weights for each sample, assign equal weights to the views, and share one set of weights across all samples, respectively.

The results show that compared to the staged baseline, complete IMPLFS learns substantially cleaner fused graphs across all datasets: without joint supervisory feedback from label confidences, the staged variant retains 86.53%86.53\%--93.87%93.87\% off-diagonal cross-class edge weight in LL, whereas joint IMPLFS reduces it to 21.38%21.38\%--74.87%74.87\% (a reduction of over 65 percentage points on both Yahoo!News100 and Yahoo!News50) while achieving higher classification accuracy on most datasets. Comparing the fusion strategies , sample-level fusion outperforms uniform fusion on all four datasets, and performs comparably to global fusion overall with slight gains on most datasets. Together with the ablation and extended comparison results in the revised manuscript (Tables 3–5), these findings confirm that the performance gains stem primarily from end-to-end joint coupling rather than trivial stacking of individual components.

Q2. We evaluated IMPLFS against recent feature selectors, using all features, and selecting features after imputation.

Following your suggestion, we added TIME-FS, TRUST-FS, and TERUIMUFS to Table 2, along with PLFS, a partial-label feature-selection control obtained by removing missing-view reconstruction and multi-view processing from IMPLFS. The methods use matched data splits, missingness masks, and feature budgets. The three incomplete multi-view baselines use their authors' example settings. Section 4.6 (Table 3) adds the all-feature and two-stage comparisons. In the two-stage comparisons, we impute the missing views using either cross-view kk-NN or graphs learned by the IMPLFS graph module, then use PLFS for feature selection.

Across the expanded comparisons in Table 2, IMPLFS achieves the highest mean accuracy in the vast majority of settings. In Table 3, IMPLFS-graph imputation outperforms cross-view kk-NN imputation in 7/8 settings; however, even when assisted by the IMPLFS graph module for imputation, the two-stage pipeline still trails complete IMPLFS across all 8/8 settings (by 1.50 to 17.03 percentage points) under the same feature budget. Moreover, using only 40% of the features, complete IMPLFS matches or outperforms using 100% full features in 5/8 settings.

These results further confirm the clear advantage of end-to-end joint optimization over decoupled imputation and feature selection.

Q3. As you noted, zero distance costs for pairs with missing endpoints in Eq. (1) can bias the learned edge weights and affect label disambiguation. The cross-view reconstruction term still constrains these weights through the other view graphs, and the squared Frobenius penalty discourages weight concentration. We checked whether the preference remains and whether it grows when HOG features are shuffled.

Following your suggestion, we added missing-endpoint edge-weight diagnostics and controlled HOG perturbation experiments (Appendix Table F.2). Under the same 30% missingness setting, we randomly permuted the HOG feature rows of 30% of observed training instances and compared original IMPLFS before and after perturbation. Across all four datasets, the edge-weight preference toward missing targets is slightly positive yet negligible in magnitude (Δw\Delta w ranges from +0.0008+0.0008 to +0.0042+0.0042). Within the reported precision of Table F.2, both Δw\Delta w and training label disambiguation accuracy remain unchanged after perturbation; the off-diagonal cross-class edge weight share of the fused graph shifts by at most 0.02 percentage points, and the mean test accuracies of SAFE-PLL and PL-A-kkNN vary by at most 1.13 and 0.79 percentage points, respectively.

These results confirm that the missing-endpoint bias is effectively controlled within a negligible range, and IMPLFS maintains strong stability in graph quality, label disambiguation, and downstream classification under this structural perturbation.

Reviewer_5Y9nOpenReview ↗
Rating
2
Confidence
3
Informativeness
2
Presentation
3
Soundness
2
Read review
Paper summary

An incomplete multi-view partial-label feature selection method named IMPLFS is proposed in a unified framework. It employs complementary-learning-guided similarity modeling to embed within-view relations and cross-view complementary relations, uses adaptive weighting to obtain a fused graph, and learns label confidence and discriminative features collaboratively. Experiments on four datasets verify its effectiveness and robustness.

Critical strengths

This study addresses an issue at a new setting of incomplete multi-view partial-label feature selection, which is of significant value in practical applications.

Critical weaknesses

In section 4 Experiments, detail statements about comparison methods can be put into Appendix but deep analysis on results is more expected. The current version is much like a phenomenon presentation rather than a feedback argumentation on the proposed method.

Questions for authors

1.The collected optimization variables incorporate F, H, and α, but why the author(s) do not introduce how to optimize them? 2.How efficient is the proposed method’s execution?

1 comment
AuthorsOpenReview ↗

Response to Reviewer 5Y9n on Optimization, Runtime, and Experimental Analysis

Thank you for pointing out where the optimization and experimental presentation could be clearer.

1. We moved the detailed descriptions of the comparison methods from Section 4.1.2 to Appendix B. Section 3.3 now presents the subproblems and updates for HH, FF, and α\boldsymbol{\alpha} in Eqs. (10), (11), and (14). Appendix A provides the full derivations. The revised text also includes the imputation-assisted and fusion comparisons in Sections 4.6 and 4.7.

2. Appendix A.3 breaks down the computational cost of each variable update and gives the overall time complexity. Table F.1 reports the mean feature-selection runtimes measured on the same CPU. With fixed numbers of views and classes, the dense graph updates take O(n2log⁡n)\mathcal{O}(n^2 \log n) per outer iteration for nn training samples. Updating FF requires solving a constrained convex quadratic program whose cost depends on the solver. In each IRLS step for the feature weights, the matrix factorization scales cubically with the corresponding view's feature dimension. On Yahoo!News50, IMPLFS has a feature-selection runtime comparable to that of TERUIMUFS and achieves higher mean accuracy across all six classifiers (Tables 2 and F.1).

Reviewer_Yyq5OpenReview ↗
Rating
1
Confidence
4
Informativeness
2
Presentation
2
Soundness
2
Read review
Paper summary

This paper proposes an incomplete multi-view feature selection method based on complementary learning. The method firstly develops a complementary-learning-guided similarity-matrix model that uses observed within-view relations and cross-view complementary relations to complete and enhance the sample-similarity structure of each view. Secondly, it dynamically integrates the complementary information supplied by different views into a fused graph through graph learning and adaptive view weighting. Finally, it constructs a joint optimization framework for label confidence estimation and feature selection, allowing label disambiguation and feature evaluation to be updated collaboratively.

Critical strengths
  1. The method proposes a complementary-learning-guided similarity-matrix model to complete and enhance the sample-similarity structure of each view.
  2. The method integrates the complementary information from different views into a fused graph by graph learning and adaptive view weighting.
Critical weaknesses
  1. The title is "Incomplete multi-view partial-label feature selection". But the paper not gives how to use the partial-label. There is no information about the ambiguous labels in the objective function.
  2. There are 9 parameters to tune, which limits the method's application.
Questions for authors

In the objective function Eq(5), how do you use the ambiguous labels?

1 comment
AuthorsOpenReview ↗

Response to Reviewer Yyq5 on Partial-Label Modeling and Parameter Sensitivity

1. In partial-label learning, each sample is given a set of candidate labels containing its true label, whose identity is unknown during training. To distinguish among the candidates, we introduce a latent label-confidence matrix FF in Eq. (3), where fikf_{ik} is the confidence that sample ii belongs to class kk. The constraint 0≤fik≤yik0 \leq f_{ik} \leq y_{ik} sets the confidence of non-candidate labels to zero, and ∑k=1mfik=1\sum_{k=1}^{m} f_{ik}=1 makes the confidence sum to one across each sample's candidates. In Eq. (5), graph smoothness on the fused graph and fitting on observed features jointly guide the estimation of FF. The estimated confidences then supervise feature selection. In the revised manuscript, we list both constraints explicitly below Eq. (5).

2. The one-factor sensitivity analysis in Figure 4 and Appendix D shows that accuracy changes relatively little for most of the nine hyperparameters over the tested settings. The clearest sensitivity is to the sparsity parameter γ\gamma, and the graph-fusion parameter β\beta also affects performance. We use the same parameter configuration across all four datasets in the main comparisons, as listed in Table D.1.

From OpenReview, CC BY 4.0. Authors as signed there; shown unedited.

Related papers

Loading the map…

Discussion (0)

Sign in to comment.