- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper proposes GraphSelect, a representation selection framework for budget-constrained multimodal graph inference. Through an empirical study, the authors demonstrate that different candidate subsets favor different prediction targets, highlighting the relationship between candidate expressiveness and learned graph representations. Building on this observation, GraphSelect employs an iterative selection-and-screening procedure that evaluates candidate replacements and progressively refines the selected subset through recursive exchanges. Experiments across multiple multimodal graph benchmarks demonstrate strong objective recovery and robustness, particularly under restrictive capacity budgets.
Critical strengths
The authors introduce a novel problem formulation for multimodal attributed graph inference: capacity constraints are enforced per modality, node-level candidate representations (text/image vectors) act as decision units, and the goal is to retain full-input predictions. Within this setup, multi-granularity empirical analyses are provided in the paper.
Critical weaknesses
-
The research lacks adequate motivation and in-depth analysis. Building upon the finding that different input modalities contain overlapping information, the authors put forward an algorithm for the selection of useful input signals. The authors need to highlight and empirically verify which practical benefit the proposed approach delivers: improved accuracy, higher efficiency, or better interpretability. If reduced capacity yields higher model efficiency, relevant efficiency metrics such as memory footprint, model size, and inference speed should be adopted to quantify these gains. In addition, the baselines do not include relevant works published in the past two years. The authors need to clarify the core contributions of this study and identify its true competitors.
-
Insufficient computational complexity analysis. Although Appendix C.1 briefly discusses computational costs, a rigorous complexity analysis remains missing. In particular, the impact of recursive replacement and screening steps on the overall time complexity, number of objective evaluations, and memory overhead is not sufficiently characterized. A clearer analysis of how these costs scale with candidate pool size, selection budget, and search depth would strengthen the efficiency claims.
Questions for authors
- Practical motivation and baselines. What problem is this work targeting: improved accuracy, efficiency, or interpretability? Are there relevant contemporary studies published in the past two years?
- Objective recovery exceeding 100%. In Figure 5, GraphSAGE appears to achieve an objective recovery rate exceeding 100%. Could the authors clarify the definition and normalization of this metric and explain under what circumstances recovery can exceed 100%? Does this indicate that the selected subset outperforms the reference configuration?
- Modality-specific selection and cross-modal interactions. The empirical study establishes that different candidate subsets can produce substantially different prediction outcomes. However, it remains unclear how GraphSelect distinguishes the contributions of candidates from different modalities or accounts for their complementary and potentially redundant information. Could the authors elaborate on how the proposed selection mechanism captures cross-modal interactions and whether modality-aware selection could further improve its effectiveness?
7 comments
---1. I would like to confirm the target application scenario: privacy preservation, efficiency improvement, memory reduction, or accuracy gain. For a memory-reduction objective, GPU memory utilization must be adopted to enable fair evaluation against the baselines.
---2. I cannot locate the work "Adaptive Node Feature Selection for Graph Neural Networks" by M. Navarro et al. in the ICML 2026 accepted papers. Please verify this citation.
Thanks for following up.
-
Our goal is to keep fewer node-level text/image representations while preserving performance close to full input. The intended application is storing a compact set of useful historical representations for later graph inference. For example, we can temporarily access complete representations, select which vectors to retain under a storage budget, and then use them for future queries—including new nodes whose predictions could not have been cached beforehand.
The resource we reduce is the amount of original representation data kept in storage. GPU working memory is a separate quantity: our current implementation fills omitted slots with modality means and still uses dense inference, so we do not claim GPU-memory savings. Our comparison with baselines therefore asks which selection preserves more predictive performance at the same representation-storage budget. This captures the value of selecting useful representations while keeping less historical feature data.
-
Here’s the official ICML 2026 proceedings entry for the cited paper.
Thank you for the questions about the practical goal, computation, and cross-modal selection.
W1&Q1. Goal, measured benefit, and competitors. Our goal is to preserve near-full predictive performance with fewer retained original representations under modality budgets. In the expanded six-graph test, replacing approximately 40% of all original graph vectors yields 75.72% mean test accuracy versus 76.32% for complete input: 99.21% retained, with a 0.605 pp drop. Random obtains 71.87%. Objective recovery is 51.16%. New Sec. 5.4/Table 3 compares all methods with frozen additive predictors, seed44, 10%/50% candidate coverage, and 20% within-pool quotas; App. E.3, Tables 13-15, gives detailed results.
Budgeted long-term storage is one application: complete inputs guide planning, then selected historical vectors serve later queries. On four larger neural-pool settings (Grocery/RedditS, GCN/MMGCN, seed44, 10% coverage, 20% within-pool quotas), actual stores save 79.88% of candidate bytes and 7.87% of whole-graph representation bytes, including indices and means. GraphSelect/Random recover 86.44%/26.01%, with accuracy drops of 0.542/1.687 pp. Dense inference fills omitted slots with means. In the original small-pool resource study on shared GPUs, model size, dense input size, and peak GPU allocations were unchanged; the median selected/full-input latency ratio of 0.999 shows no consistent speedup. The benefit is persistent storage reduction with predictive information retained. Sec. 5.4 and App. E.4 add these resource measurements.
Table 1 now compares recent published ANFS [1] and GeoXGNN [2] under the same fixed predictor and whole-vector budgets on six graphs/three splits. At 20%, they recover 45.22%/43.07%, versus GraphSelect's 48.30%. We reimplemented ANFS's published permutation-importance and iterative-pruning procedure using teacher-class loss and whole-vector quotas. GeoXGNN adapts its public geometry and mask-learning pipeline with vector gates. Section 2 adds contemporary related work; App. E.2 specifies the adaptations.
W2. Complexity, search depth, and memory. Each round screens candidates and jointly evaluates shortlisted exchanges; accepted exchanges trigger fresh scores. Let N be candidates per modality, q the common quota, L screen width, r attempted rounds, and B the query allowance. Initialization takes 2N+1 trials. Each round screens at most 2N changes and tests at most 2p pairs, where p=min(L,q)min(L,N−q). Thus
Q≤min{B,2N+1+r(2N+2p)}.
Screening is linear in pool size, pair evaluation is quadratic in shortlist width, and rounds account for search depth. Nonlinear trials run a forward pass; additive trials update affected logits and sum cached target risks. Nonlinear search-state memory is O(Qq+N+B), including selected-set keys and the evaluation trace. App. C.1 now derives time/memory bounds with class count, affected-row supports, and caches. In 18 matched settings, internal Forward/GraphSelect average 0.377/0.865 s and 3,881/8,511 actual evaluations (App. E.1). At 50% coverage, GraphSelect averages 94.68 million sparse evaluations (App. E.3). This cost plans a stored subset for reuse.
Q2. Recovery above 100%. Yes, the selected subset can outperform full input on the stated objective. Recovery is
100R(∅)−R(E)R(∅)−R(S).
R is cross-entropy to the full-input predicted classes; E contains all candidates. All evaluated denominators are positive. GraphSAGE/RedditS/seed44 at 20% has reference/full/selected losses of 1.964669/1.963063/1.962647, giving 125.90%. This means greater geometric mean probability for the original classes; true-label accuracy is measured separately. Sec. 3.2 states the normalization; App. D.5 now adds this numerical example and interpretation.
Q3. Modality contributions and interactions. Each candidate is scored with both retained modalities present. An image is evaluated alongside retained text and graph context, and vice versa; separate quotas enforce each modality's budget. Joint replacement loss captures overlapping or complementary effects at common prediction targets, and an accepted exchange triggers rescoring of both modalities. Even additive logits interact through cross-entropy. SAGE [3] also motivates measuring contributions alongside other features. We clarify these conditional scores and joint tests in Secs. 4.2-4.3; Sec. 4.4 gives the additive mechanism. Learned modality-specific proposals could further improve shortlisting while retaining joint loss as the exchange criterion.
References
[1] M. Navarro et al. Adaptive Node Feature Selection for Graph Neural Networks. ICML, 2026.
[2] M. Diao et al. Local Geometry Improves Explanation Robustness for Graph Neural Networks. IJCAI, 2026.
[3] I. Covert et al. Understanding Global Feature Contributions With Additive Importance Measures. NeurIPS, 2020.