joschout/SubmodularMaximization
A collection of optimization algorithms for maximizing unconstrained submodular set functions.
This project helps operations researchers and data scientists efficiently select an optimal subset of items from a larger collection. You provide a definition of 'value' for any given subset, and the tool outputs the specific subset that maximizes this value. It's designed for users who need to make the best selection from many options, where the value of adding an item changes based on what's already included.
No commits in the last 6 months.
Use this if you need to identify the single best combination of elements from a larger pool, and the benefit of each element depends heavily on other elements already chosen.
Not ideal if your problem involves finding an exact optimal solution rather than a good approximation, or if the value of an item is always independent of other selected items.
Stars
22
Forks
2
Language
Python
License
Apache-2.0
Category
Last pushed
Jan 14, 2021
Commits (30d)
0
Get this data via API
curl "https://pt-edge.onrender.com/api/v1/quality/ml-frameworks/joschout/SubmodularMaximization"
Open to everyone — 100 requests/day, no key needed. Get a free key for 1,000/day.
Higher-rated alternatives
SimonBlanke/Gradient-Free-Optimizers
Lightweight optimization with local, global, population-based and sequential techniques across...
Gurobi/gurobi-machinelearning
Formulate trained predictors in Gurobi models
emdgroup/baybe
Bayesian Optimization and Design of Experiments
heal-research/pyoperon
Python bindings and scikit-learn interface for the Operon library for symbolic regression.
simon-hirsch/ondil
A package for online distributional learning.