AI Paper Atlas

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

Unsupervised Feature Selection by Heuristic Search with Provable Bounds on Suboptimality

AAAI 2016 · Learning theory and algorithms › Submodular and game algorithms · approach: Streaming submodular algorithms · 45 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 CSSP-WA* heuristic search instead of GKS/GE/LEV-GEcolumn subset selection · TechTC01 k=100Frobenius error: 2.78E+04 (GKS) -> 2.07E+04Helped
use WA* instead of fast algebraic/randomized methodscolumn subset selection · all datasetsrunning time: 0.350 -> 14.47 minutes (GE vs WA*-b, TechTC01 k=100)Hurt
increase epsilon above 0.4 (ablation)CSSP-WA* · TechTC01 k=50runtimeNo clear effect
use smaller epsilon (ablation)CSSP-WA* · TechTC01 k=50errorMixed
use multiplicative-bound heuristic b instead of g or h (ablation)CSSP-WA* · Isolet5 k=100Frobenius error: 2.48E+04 -> 2.47E+04No 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