atlas

Research map / Learning theory and algorithms / Combinatorial and search optimization

Linear Relaxations for Finding Diverse Elements in Metric Spaces

NeurIPS 2016 · Learning theory and algorithms › Combinatorial and search optimization · approach: Decision-focused optimization · 15 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
Adding greedy augmentation after LP rounding to reach exactly k points (augmented LP) versus plain LP rounding (ablation)LP-based sum-min diversity algorithm · Madelon, USPS (approximation vs upper bound)fraction of upper bound achievedHelped
LP-based algorithm vs greedy and local search for sum-min objectivesum-min diversity maximization · COIL100, Madelon, USPSsum-min objective valueNo clear effect
Optimizing sum-min instead of sum-sum objective for subset selectiondiverse subset selection · COIL100, CDK2 cluster coveragenumber of distinct clusters covered and non-uniformityHelped
Adding a coverage/relevance secondary objective to the LPsum-min diversity LP · theoretical guarantee with coverageapproximation for sum-min and coverageNo clear effect
Greedy and local search heuristics for sum-min (instead of LP)sum-min diversity · worst-caseapproximation ratio: O(1/sqrt(k))Hurt

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