Submodular and strongly submodular functions and diversities
arXiv:2608.11468
2026
Regularization
1 ideas extracted · analyzed Sep 1, 2026
What the math gives to ML
The paper supplies a set-function viewpoint for modeling collections of neural representations, rather than only individual examples or pairs. Its strongest transferable asset is the hierarchy of monotonicity, subadditivity, submodularity, and strong submodularity constraints, which mathematically encode diminishing returns when additional elements are added to a set. This can be used to train token-pruning, patch-selection, retrieval, or mixture-routing modules whose selected elements become complementary instead of redundant. The most practical first transfer is a sampled strong-submodularity regularizer on a learned set utility, combined with greedy selection at inference.
Ideas from this paper
Unverified
2026
Give a token, patch, retrieval-item, or expert-selection module a learned utility f_theta(S) over subsets S, and penalize violations of the paper's submodularity and strong-submodularity inequalities. The resulting selector should prefer complementary elements: the marginal value of adding an item decreases when the current selected set is already rich in similar information. At inference, use greedy marginal-gain selection rather than independently thresholding token scores.
Useful6/10
Difficulty5/10
Novelty6/10