We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
Submodular function minimization is well studied, and existing algorithms solve it exactly or up to arbitrary accuracy. However, in many applications, such as structured sparse learning or batch Bayesian optimization, the objective function is not exactly submodular, but close. In this case, no theoretical guarantees exist. Indeed, submodular minimization algorithms rely on intricate connections between submodularity and convexity. We show how these relations can be extended to obtain approximation guarantees for minimizing non-submodular functions, characterized by how close the function is to submodular. We also extend this result to noisy function evaluations. Our approximation results are the first for minimizing non-submodular functions, and are optimal, as established by our matching lower bound.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("1905.12145")
get_code_for_paper("1905.12145")
have("1905.12145")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/1905.12145.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/1905.12145)
Connect an agent — have() is free.