arXiv:2601. 23221v2 Announce Type: replace Abstract: As acquiring reliable ground-truth labels is usually costly, or infeasible, crowdsourcing and aggregation of noisy human annotations is the typical resort.
arXiv:2603. 04689v3 Announce Type: replace-cross Abstract: Fair top-$k$ selection, which ensures appropriate proportional representation of members from minority or historically disadvantaged groups among the top-$k$ selected candidates, has drawn significant attention.
arXiv:2503. 11126v4 Announce Type: replace Abstract: The problem of relevant and diverse subset selection has a wide range of applications, including recommender systems and retrieval-augmented generation (RAG).
arXiv:2609.24556v1 Announce Type: cross Abstract: Principal Component Analysis (PCA) minimises aggregate reconstruction error, which can inadvertently represent majority subgroups with substantially...
arXiv:2607. 18119v1 Announce Type: cross Abstract: Fair clustering aims to make cluster assignments independent of sensitive attributes, but this goal becomes challenging when multiple sensitive attributes jointly define many subgroups.
arXiv:2607. 20737v1 Announce Type: new Abstract: Graph Neural Networks trained on heterogenous bipartite graphs form a common basis in recommendation systems.
arXiv:2509. 21785v2 Announce Type: replace-cross Abstract: Discretizing raw features into bucketized attribute representations is a popular step before sharing a dataset.
The paper introduces SatisDive, a training‑free inference method that balances reward and diversity in text‑to‑image diffusion by enforcing a reward floor for each image and a diversity cutoff for the batch. By adjusting the reward floor, the method traces a Pareto frontier between worst‑candidate reward and batch diversity. Experiments on Pick‑a‑Pic show that SatisDive consistently outperforms FK steering, improving worst‑candidate reward by up to 0.70 in some settings and Pareto‑dominating FK steering across overlapping DreamSim ranges.
FairRARI is a new in‑processing convex optimization framework that computes PageRank vectors while satisfying various group‑fairness constraints based on vertex attributes. By formulating PageRank as a variational problem, FairRARI solves a strongly convex problem that guarantees a target fairness level and retains the same asymptotic time complexity as standard PageRank. Experiments on real datasets show that FairRARI outperforms existing methods in utility while achieving the desired fairness across multiple vertex groups.
arXiv:2606. 15216v1 Announce Type: cross Abstract: Diversity plays a critical role in data selection, improving performance under fixed data budgets by reducing redundancy and repetition.
arXiv:2606. 07988v1 Announce Type: new Abstract: Large language models (LLMs) increasingly rely on reward models to align their outputs with diverse user preferences.
arXiv:2606. 20461v1 Announce Type: new Abstract: Machine learning models have been shown to exhibit discriminatory outcomes or degraded performance for individuals at the intersection of multiple sensitive attributes, such as race and gender.