arXiv Machine Learning
Proportionality in Ranking Compression
Read the original on arXiv Machine Learning →The Flow has not summarised this story yet — read it at arXiv Machine Learning.
Related stories
arXiv AI
Sep 28
Proportional Representation in Temporal Voting with Ranked Preferences
The paper investigates proportional representation in a temporal voting setting where a single candidate is chosen each round and voters submit ranked preferences that may evolve over time. It extends classic proportionality axioms—justified representation (JR), proportional JR (PJR), extended JR (EJR), and proportionality for solid coalitions (PSC)—to accommodate various ways of determining which top-ranked candidates are considered approved, ranging from a fixed common cutoff to individual, round‑specific cutoffs. The authors analyze which axioms can be guaranteed under different informational assumptions about future rounds, showing that while EJR is unattainable, JR, PJR, and PSC can be achieved with a fixed cutoff if all preferences are known in advance; varying cutoffs reduce guarantees, yet PJR can still be achieved efficiently for groups that agree in every round, and PSC can be satisfied without future knowledge. They also demonstrate that checking these axioms is often coNP‑complete, though some stronger axioms may be easier to verify.
arXiv AI
Oct 15
MILP the Gap: An Automated Reasoning Approach to Condorcet's Paradox
arXiv:2604.19851v2 Announce Type: replace-cross Abstract: Computational social choice studies how conflicting individual preferences are aggregated into a collective decision, with applications to el...
arXiv AI
Aug 13
Proportional Committee Elections with Positive and Negative Votes
arXiv:2503. 01985v2 Announce Type: replace-cross Abstract: In the classic committee election setting each voter approves a subset of candidates and the goal is to select $k$ winners based on these preferences.
arXiv Machine Learning
Jun 2
The Representation-Rationalizability Tradeoff in Reward Learning
arXiv:2606. 00291v1 Announce Type: cross Abstract: In RLHF, each training example contains a prompt $x$ and two candidate responses $y,y'$, and annotators provide pairwise preferences between these responses.
arXiv Machine Learning
Jun 16
Multi-User Dueling Bandits: A Fair Approach using Nash Social Welfare
arXiv:2605. 01961v2 Announce Type: replace Abstract: Learning from human preference data is becoming a useful tool, from fine-tuning large language models to training reinforcement learning agents.
arXiv AI
Sep 10
Provable Pluralistic Alignment: Multi-Party RLHF under Offline Human Feedback
arXiv:2403.05006v2 Announce Type: replace-cross Abstract: Pluralistic alignment requires learning from feedback that reflects persistent and potentially conflicting stakeholder preferences while ulti...