AI Paper Atlas

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

Subspace Selection via DR-Submodular Maximization on Lattices

So Nakashima, Takanori Maehara

AAAI 2019 · Learning theory and algorithms › Submodular and game algorithms · approach: Streaming submodular algorithms · 7 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (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 the greedy algorithm for monotone downward DR-submodular maximization under a height constraintDirectional DR-submodular maximization · Height constraintapproximation ratio: 1 - e^{-\floor{k/p}/k}Improved
Use the greedy algorithm under an order-consistent modular knapsack costMonotone downward DR-submodular maximization · Knapsack constraintapproximation ratio: (1 - e^{-1})/2Improved
Use double greedy for non-monotone bidirectional DR-submodular maximizationNonnegative bidirectional DR-submodular functions · Unconstrained non-monotone maximizationapproximation ratio: 1/3Improved

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