atlas

Research map / Learning theory and algorithms / Submodular and game algorithms

Algorithms for Optimizing the Ratio of Submodular Functions

ICML 2016 · Learning theory and algorithms › Submodular and game algorithms · approach: Monotone submodular maximization · 19 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use GreedRatio (greedy by marginal ratio) instead of Ellipsoidal Approximation or MMin for RS minimizationRS minimization on synthetic bipartite F-measure data · Synthetic bipartite graph (|U|=|W|=100, p=0.05, |T|=20), F_lambda objectiveobjective value F_lambdaHelped
Use MMin or EllipsoidApprox instead of GreedRatioRS minimization on synthetic bipartite F-measure data · Synthetic bipartite graph, F_lambda objectiveobjective value F_lambdaHurt

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy