New lower bound instance showing α-core empty below 2.1508 in proportionally fair clustering, plus exact α_m* thresholds for m=3..6 in Droop quota cases via MILP search and direct proofs.
Embeddings for Preferences, Not Semantics
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
Modern AI is opening the door to collective decision-making in which participants express their views as free-form text rather than voting on a fixed set of candidates. A natural idea is to embed these opinions in a vector space so that the substantial literature on facility location problems and fair clustering can be brought to bear. But standard text embeddings measure semantic similarity, whereas distances in facility location problems and fair clustering require what we call \textit{preferential similarity}: a participant's agreement with a piece of text should be inversely related to their distance from it. Off-the-shelf embeddings inherit a coarse preference signal through a correlation between semantic and preferential similarity, but fail to capture preferences when the correlation breaks. We formalize this as an invariance problem: text embedding models encode both a preference-relevant signal (stance and values) and semantic nuisance (style and wording), and the two are observationally correlated, so a geometry that relies on nuisance can appear preference-correct even when it is not. We show that synthetic training data designed to break this correlation provably shifts the optimal scorer away from nuisance-dominated cosine and significantly improves preference prediction across 11 online deliberation datasets.
fields
cs.GT 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Improved Lower Bounds for Proportionally Fair Clustering
New lower bound instance showing α-core empty below 2.1508 in proportionally fair clustering, plus exact α_m* thresholds for m=3..6 in Droop quota cases via MILP search and direct proofs.