- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
The paper presents a new method called WEAVE for extracting patches with arbitrary sizes from gigapixel whole slide images (WSIs). The core idea is to model the patch extraction as an adaptive process where any given WSI is decomposed into variable-sized patches based on their informativeness with less informative WSI regions are represented with larger patches and more informative ones with more. This idea has been adapted for in the literature for natural images for adaptive tokenization. In the paper, the authors propose a Hopfield-energy based measure for assessing informativeness of pathches. The tokens from these variable size patches are then processed by an mLSTM module, introducing further computational efficiency as compared to pairwise self-attention. The experiments demonstrate that the suggested WEAVE method outperforms the evaluated MIL-based baselines on five different classification oriented datasets.
Critical strengths
S1. The paper tackles with an important issue in processing WSIs: As WSIs are gigapixel images, efficient techniques are required. For this purpose, the authors propose an adaptive token merging technique, which is built upon extracting variable-size patches by using a Hopfield-energy based informativeness measure and an mLTSM token aggregation module.
S2. Employing the Hopfield energy as a means for measuring spatial importance of image patches for obtaining arbitrary size patches is an interesting idea, which seems to work for WSIs containing highly sparse informative regions.
S3. Experiments on five different classification-oriented WSI datasets demonstrates the effectiveness of the suggested framework against the evaluated MIL-based baselines in terms of classification performance.
Critical weaknesses
W1. The technical novelty is relatively weak. The proposed adaptive patch extraction method is just DART with its importance mechanism being replaced with a Hopfield-energy based importance scoring.
W2. Experiments were carried out only on classification tasks which demonstrates the effectiveness of the proposed method. However, no experiments are carried out on regression or segmentation-oriented tasks, which are also important for WSI analysis.
W3. The suggested method has close connections with token merging or token compression methods such as ToMe, DivPrune, PruMerge. However, the proposed method is only compared against MIL-based baselines.
W4. Some state-of-the-art models are missing in the evaluations:
- Chen et al., Learnable Token Sparsification for Efficient Gigapixel Whole Slide Image Reasoning, arXiv 2026
- Rahman et al., DTC-WSI: Dynamic Token Compression for Whole-Slide Images, MIDL 2026
W5. Number of learnable prototypes, L, is an hyperparameter of the proposed method, but no analysis is given regarding the effect of L on the model performance.
Questions for authors
Q1. Could the suggested method can be easily extended to multiscale analysis of WSIs as it has been demonstrated in the literature that multiscale analysis could boost the model performances?
Q2. How sensitive the model performance is with respect to the number of learnable prototypes?
Q3. How does the proposed method’s performance compare against those of the missing token merging/pruning methods?
Q4. What is the reason behind poorer performance on the BRACS dataset as compared to other datasets?
Q5. How computationally efficient the suggested framework is as compared to the evaluated MIL baselines?
4 comments
W5 / Q2: Number of prototypes L
"Number of learnable prototypes, L, is an hyperparameter of the proposed method, but no analysis is given regarding the effect of L on the model performance." "How sensitive the model performance is with respect to the number of learnable prototypes?"
We evaluated L ∈ {1, 5, 10, 20, 50, 100, 1000} on DHMC (Appendix C.4 Prototype Sensitivity). To keep the sweep affordable, it uses fewer training epochs than the main experiments, so absolute values are lower than in Table 2 and should be compared only within the sweep. Values are mean ± standard deviation over three runs.
| L | Acc | F1 | AUC |
| 1 | 0.781 ± 0.025 | 0.744 ± 0.012 | 0.964 ± 0.011 |
| 5 | 0.790 ± 0.074 | 0.778 ± 0.078 | 0.960 ± 0.024 |
| 10 (default) | 0.803 ± 0.043 | 0.797 ± 0.068 | 0.970 ± 0.010 |
| 20 | 0.826 ± 0.037 | 0.811 ± 0.019 | 0.973 ± 0.010 |
| 50 | 0.841 ± 0.037 | 0.797 ± 0.048 | 0.968 ± 0.009 |
| 100 | 0.864 ± 0.004 | 0.833 ± 0.010 | 0.972 ± 0.004 |
| 1000 | 0.850 ± 0.039 | 0.801 ± 0.030 | 0.960 ± 0.010 |
| WEAVE is robust to L: AUC varies little across all values (0.960–0.973). Under this training budget, accuracy tends to increase with more prototypes up to L = 100, although most differences lie within one standard deviation. Even a single prototype trains stably and reaches comparable AUC. The default L = 10 was not extensively tuned and is likely not optimal. We kept it fixed for consistency across all experiments. |
Q1: Multiscale extension
"Could the suggested method can be easily extended to multiscale analysis of WSIs [...]?"
Yes, we see two natural directions for WEAVE:
- Multi-scale: apply adaptive patchification independently at each magnification, with one scorer and one token budget per level, and aggregate the resulting tokens jointly, similar to multi-scale MIL approaches such as DSMIL (Li et al., 2021).
- Hierarchical zooming: apply adaptive patchification to the full slide at the lowest magnification, and at each higher magnification only within the regions retained at the previous level, similar to ZoomMIL (Thandiackal et al., 2022) or PathCTM (Ge et al., 2026). We have not evaluated either direction, but added them to the future-work discussion.
Q4: BRACS
"What is the reason behind poorer performance on the BRACS dataset as compared to other datasets?"
We do not have a conclusive explanation, but our new results narrow it down:
- Encoder. With UNI features, the encoder used by the baselines, WEAVE does not reduce the gap on BRACS (Appendix C, Encoder Ablation), so the encoder is unlikely to be the main cause.
- Magnification. Separating atypical from benign and malignant lesions may depend more strongly on magnification than the tasks of the other datasets. Both our RetCCL and UNI variants extract features at 10×, while the baselines use 20×.
- Data regime. BRACS combines one of the smallest training sets (395 slides) with the longest token sequences (13.6k tokens per slide on average).
Q5: Efficiency
"How computationally efficient the suggested framework is as compared to the evaluated MIL baselines?"
We compared WEAVE with 2DMambaMIL, the strongest baseline, on the same features (General Response §4). WEAVE needs 2.5–4.1× fewer inference FLOPs and up to 2.8× less training memory, with 12–31% faster training steps; inference is slower on DHMC due to our unoptimized PyTorch mLSTM. Dense feature extraction dominated the cost of our original pipeline, but it is not necessarily required: on PANDA, reducing the extraction density by about 25× yields comparable performance (Appendix C, Feature Extraction Density).
We hope our response clarifies the novelty of WEAVE and that the new results answer the reviewer's questions. If so, we would be grateful if they would consider updating their assessment. We are happy to answer any further questions.
Thank you for the response.
I still think the proposed method has limited novelty as the replacements mentioned by the authors appear to lack complexity of a certain extent. If a more comprehensive evaluation had been carried out with the experiments including the state-of-the-art models and the experiments being carried out on regression or segmentation-oriented tasks, assessing the contribution of the proposed method could be more convincing.
Based on these, I am keeping my initial rating.
We thank the reviewer for the reply but respectfully disagree with the remaining concerns. In contrast to the reviewer's claims, we would like to point out the following.
WEAVE provides substantial novelty over DART. DART was developed and evaluated on natural images and videos at standard resolution (e.g., 224×224 on ImageNet-1K). Extending it to gigapixel whole-slide images is not a straightforward transfer: in our experiments, DART's scorer did not train stably on WSI features, and its pixel-level re-encoding of each region is infeasible at gigapixel scale. Our energy-based scoring and feature-space tokenization address both. As the other reviewers pointed out, this direction is "under-explored" (pEsr), and our approach offers "a plausible solution" and is "practically relevant" (e8nV).
Our experiments include state-of-the-art methods for WSI classification. We compare against the reported results of nine MIL methods spanning attention-based, Transformer-based and state-space aggregators, the full baseline suite of Zhang et al. (2025), on five benchmarks using their released splits. Chen et al. (2026) addresses vision-language question answering rather than slide classification, and DTC-WSI uses a different evaluation protocol without a public implementation, so neither is directly comparable.
We present a comprehensive and controlled evaluation. Beyond the main benchmark, we evaluate two feature encoders, controlled ablations of both components, the importance scores against pathology annotations, the number of prototypes, the computational cost, and the feature-extraction density. Slide-level classification is the most widely used benchmark task for WSI aggregation methods, and all our baselines are evaluated on it. We state the absence of regression and segmentation tasks in the Limitations.
We appreciate the reviewer's engagement and remain happy to answer further questions.
We thank the reviewer for the feedback and the helpful pointers to related work, which we now discuss in the revised manuscript. Below, we answer each point and summarize the relevant new results. All changes are marked in the revised PDF.
W1: Novelty
WEAVE keeps only one of DART's three components, the differentiable quantile partitioning, and replaces the other two and adds a linear-cost aggregator:
To our knowledge, WEAVE is the first method to apply differentiable adaptive patchification to gigapixel WSIs.
W2: Regression and segmentation
We agree and state this in the Limitations. Slide-level regression, such as survival prediction, would in principle only require a different task head and loss. Dense segmentation fits less naturally, because WEAVE deliberately produces coarse tokens in low-importance regions. We consider both directions for future work.
W3 / Q3: Relation to token merging and pruning
WEAVE shares the goal of these methods, retaining relevant information with fewer tokens, but uses another mechanism. It partitions a feature map into spatially contiguous regions that cover the full WSI. Unlike in pruning, no location is discarded and unlike in merging the resulting regions are spatially contiguous. A direct quantitative comparison was not feasible within the rebuttal period, but we clarified this distinction (Sec. 1 Introduction and Sec. 2 Related work), list DivPrune and PruMerge and state the missing comparison in the Limitations.
W4: Missing methods
Thank you for these pointers, which are both now discussed in the related work. Chen et al. (arXiv, June 2026) addresses a different task: they select a small set of tokens for vision-language slide reasoning and question answering, rather than WSI classification. DTC-WSI (Rahman et al., 2026) is closer to our setting, but its evaluation protocol differs from ours, as they use CONCH features and treat PANDA as a binary rather than 6-class ISUP grading task. Their reported numbers are therefore not comparable to ours. Since no public implementation is available, reproducing it under our protocol was not feasible within the rebuttal period.