atlas

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

Robust Budget Allocation via Continuous Submodular Functions

ICML 2017 · Learning theory and algorithms › Submodular and game algorithms · approach: Streaming submodular algorithms

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
Choose allocations by maximizing worst-case influence over an uncertainty set rather than using a point estimateBudget Allocation · Synthetic data, ellipsoidal and D-norm uncertainty setsworst-case influenceHelped
Choose allocations by maximizing worst-case influence over an uncertainty set rather than using a point estimateBudget Allocation · Yahoo! Webscope bidding dataexpected influenced people: 100-500 expected influenced peopleHelped
Use the expected-influence allocation instead of the robust allocationBudget Allocation · Synthetic data, large total budgetworst-case influenceNo clear effect
Use the expected-influence allocation instead of the robust allocationBudget Allocation · Synthetic data, scarce resourcesworst-case influenceHurt
Use fixed-stepsize Frank-Wolfe to find the worst-case vector instead of the proposed submodular minimization schemeRobust Budget Allocation · One Yahoo! problem instance with D-norm uncertaintyworst-case influenceNo clear effect

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