AI Paper Atlas

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

Optimal Sequential Maximization: One Interview is Enough!

Moein Falahatgar, Alon Orlitsky, Venkatadheeraj Pichapati

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

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
replace multi-round elimination with a sequential anchor-based algorithm (OPT-AGNOSTIC-SEQ) that adaptively updates anchor with asymmetric checkpointsdueling bandits probabilistic maximization with SST · simulated pairwise model, 0.05-maximum, delta=0.1comparison complexityImproved
make SEQ-ELIMINATE n-agnostic by using confidence delta/(2i^2) per comparison (ablation)SEQ-ELIMINATE · simulated pairwise model, 0.05-maximum, delta=0.1comparison complexityHurt
use asymmetric confidence checkpoints (A-T) for anchor updates in traditional banditsO-S sequential maximization · theoretical query complexityquery complexityImproved

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