AI Paper Atlas

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

Subset Selection under Noise

Chao Qian, Jing-Cheng Shi, Yang Yu, Ke Tang, Zhi-Hua Zhou

NeurIPS 2017 · Learning theory and algorithms › Submodular and game algorithms · approach: Monotone submodular maximization · 41 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 PONSS (noise-aware theta-domination with bounded archive) instead of POSSPOSS · Influence maximization (ego-Facebook, Weibo), k=5 to 10influence spreadImproved
use PONSS instead of POSSPOSS · Sparse regression (protein, YearPredictionMSD), k=10 to 20R2Improved
use POSS (Pareto bi-objective) instead of greedy under noisegreedy algorithm · Influence maximizationinfluence spreadImproved
use POSS instead of greedy under noisegreedy algorithm · Sparse regression (protein, YearPredictionMSD)R2Mixed
vary threshold theta in PONSS from 0.1 to 1 (ablation)PONSS · Influence maximization and sparse regressioninfluence spread / R2No 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