InfoDPP-PAC: Principled Patch Selection for Whole Slide Image Analysis
arXiv:2608.23574
2026
Memory
1 ideas extracted · analyzed Sep 1, 2026
What the math gives to ML
The paper combines Gaussian-process posterior uncertainty with determinantal diversity, turning subset selection into an information-gain problem rather than a classifier-specific attention heuristic. The transferable asset is a decomposable objective whose log-determinant term rewards genuinely new information and whose greedy marginal gains naturally support variable-length selection. A practical neural-network adaptation is to use a frozen teacher to score candidate tokens, patches, or retrieved items, fit a GP covariance in embedding space, and greedily retain items while the posterior information gain remains above a calibrated threshold. This can reduce attention or memory costs while preserving coverage, although the GP and DPP machinery itself is established and the main novelty is the principled integration and stopping rule.
Ideas from this paper
Unverified
2026
Replace fixed-budget token or patch pruning with greedy selection that combines a teacher-derived relevance score and Gaussian-process mutual information. Select an item when it is both relevant and non-redundant, and stop when the largest remaining information gain falls below a calibrated threshold instead of retaining a fixed number of items.
Useful6/10
Difficulty5/10
Novelty5/10