Outer Diversity of Structured Domains
An ordinal preference domain is a subset of preference orders that the voters are allowed to cast in an election. We introduce and study the notion of outer diversity of a domain and evaluate its value for a number of well-known structured domains, such as the single-peaked, single-crossing, group-separable, and Euclidean ones.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
SCOPE-Router: Cost-Aware Open-Set VLM Routing for Execution-Oriented Tasks
Model routing aims to select the most suitable model from a candidate pool for each query, balancing quality and cost. Existing VLM routing research is limited to traditional VQA evaluation, lacks systematic calibration …
Diversity of Structured Domains via k-Kemeny Scores
In the k-Kemeny problem, we are given an ordinal election, i.e., a collection of votes ranking the candidates from best to worst, and we seek the smallest number of swaps of adjacent candidates that ensure that the elect…
Multi-Objective Quality-Diversity in Unstructured and Unbounded Spaces
Quality-Diversity algorithms are powerful tools for discovering diverse, high-performing solutions. Recently, Multi-Objective Quality-Diversity (MOQD) extends QD to problems with several objectives while preserving solut…
DiversityImage GenerationProtein DesignProxRouter: Proximity-Weighted LLM Query Routing for Improved Robustness to Outliers
Large language model (LLM) query routers are critical to modern AI platforms as they seek to improve efficiency by assigning inference queries to accurate, yet low-cost models. Parametric routers typically use trained ne…
Hierarchical Mixture-of-Experts with Two-Stage Optimization
Sparse Mixture-of-Experts (MoE) models scale capacity by routing each token to a small subset of experts. However, their routers exhibit a fundamental trade-off: strong load balancing can suppress expert specialization, …