apricot implements submodular optimization for the purpose of selecting subsets of massive data sets to train machine learning models quickly. See the documentation page: https://apricot-select.readthedocs.io/en/latest/index.html
Submodular optimization for context engineering: query fan-out, text selection, passage reranking
A collection of optimization algorithms for maximizing unconstrained submodular set functions.
Personalized knowledge graph summarization based on historical queries
Non-Uniform Subset Selection for Active Learning in Structured Data
A GPU accelerated Submodular Optimization toolkit.
Probabilistic Gas Leak Rate Estimation using Submodular Function Maximization with Routing Constraints
Routines for submodular set function minimization
Code for our AISTATS '22 paper: Improving Attribution Methods by Learning Submodular Functions.
A partial Benders decomposition (PBD) for solving choice-based competitive facility location problems (CBCFLP)
delta-submodular work codes
Active learning & submodularity: selecting an informative subset of training data and comparing classifier accuracy (KNN, Logistic Regression, SVM, Random Forest) on the subset vs. the full dataset.
Randomized Greedy Learning Under Full-bandit Feedback
《选择的代价》——完备、可组合与可传递的三维权衡：任何有限复杂度的知识系统都不能同时满格拥有 C、A、T，至多两个；选择哪两个，就在第三个上留下一处可定位的缺口。附四个战场的现实诊断、优雅降级与可证伪登记簿。 The Price of Choice — the impossibility triangle of Completeness, Composability, and Transfer: how complex knowledge systems form, evolve, and renew. Text CC BY 4.0; code MIT.
Another blog, another platform
To associate your repository with the submodularity topic, visit your repo's landing page and select "manage topics."