atlas

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

Exact Learning of Preference Structure: Single-peaked Preferences and Beyond

ICML 2022 · Learning theory and algorithms › Submodular and game algorithms · approach: Committee voting rules

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 skewed uniform distribution U_p (p<1/2) instead of uniform for sampling votessingle-axis identification · single-peaked votes on a fixed axissamples needed for identificationHurt
Sample from random peak distribution RP instead of uniform over single-peaked votessingle-axis identification · single-peaked axis identificationsamples needed for identificationHelped
Pairwise comparisons instead of full votessingle-axis identification · single-peaked axis identificationidentifiability of the axisHurt
Equivalence queries instead of sample votessingle-axis exact learning · exact learning of single axisnumber of oracle queries neededHelped
Two-axis mixture where axes share exactly one leaf (vs 0 or 2 shared leaves)identifying second axis from mixture with known first axis · mixture of uniform distributions over two axessample complexity: O(log(1/δ)) vs O(m log(m/δ))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