Multi-Group Proportional Representation in Retrieval

• URL: http://arxiv.org/abs/2407.08571v2
• Date: Thu, 31 Oct 2024 20:30:51 GMT
• Title: Multi-Group Proportional Representation in Retrieval
• Authors: Alex Oesterling, Claudio Mayrink Verdun, Carol Xuan Long, Alexander Glynn, Lucas Monteiro Paes, Sajani Vithana, Martina Cardone, Flavio P. Calmon,
• Abstract summary: We introduce Multi-Group Proportional Representation (MPR), a novel metric that measures representation across intersectional groups. MPR yields more proportional representation across multiple intersectional groups specified by a rich function class, often with minimal compromise in retrieval accuracy.
• Score: 46.00781543425424
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Image search and retrieval tasks can perpetuate harmful stereotypes, erase cultural identities, and amplify social disparities. Current approaches to mitigate these representational harms balance the number of retrieved items across population groups defined by a small number of (often binary) attributes. However, most existing methods overlook intersectional groups determined by combinations of group attributes, such as gender, race, and ethnicity. We introduce Multi-Group Proportional Representation (MPR), a novel metric that measures representation across intersectional groups. We develop practical methods for estimating MPR, provide theoretical guarantees, and propose optimization algorithms to ensure MPR in retrieval. We demonstrate that existing methods optimizing for equal and proportional representation metrics may fail to promote MPR. Crucially, our work shows that optimizing MPR yields more proportional representation across multiple intersectional groups specified by a rich function class, often with minimal compromise in retrieval accuracy.

Related papers

• hyperFA*IR: A hypergeometric approach to fair rankings with finite candidate pool [0.0]
  We present hyperFA*IR, a framework for assessing and enforcing fairness in rankings drawn from a finite set of candidates.<n>It relies on a generative process based on the hypergeometric distribution, which models real-world scenarios by sampling without replacement from fixed group sizes.<n>We also propose a Monte Carlo-based algorithm that efficiently detects unfair rankings by avoiding computationally expensive parameter tuning.
  arXiv  Detail & Related papers  (2025-06-17T09:45:08Z)
• Metritocracy: Representative Metrics for Lite Benchmarks [3.0936354370614607]
  We use ideas from social choice theory to formalize two notions of representation for the selection of a subset of evaluation metrics.<n>We first introduce positional representation, which guarantees every alternative is sufficiently represented at every position cutoff.<n>We then introduce positional proportionality, which guarantees no alternative is proportionally over- or under-represented by more than a small error at any position.
  arXiv  Detail & Related papers  (2025-06-11T14:53:47Z)
• Multi-Group Proportional Representation for Text-to-Image Models [19.36512604668349]
  Text-to-image (T2I) generative models can create vivid, realistic images from textual descriptions.<n>As these models proliferate, they expose new concerns about their ability to represent diverse demographic groups, propagate stereotypes, and efface minority populations.<n>This paper introduces a novel framework to measure the representation of intersectional groups in images generated by T2I models by applying the Multi-Group Proportional Representation metric.
  arXiv  Detail & Related papers  (2025-05-29T21:48:28Z)
• ProTA: Probabilistic Token Aggregation for Text-Video Retrieval [15.891020334480826]
  We propose Probabilistic Token Aggregation (ProTA) to handle cross-modal interaction with content asymmetry. ProTA achieves significant improvements on MSR-VTT (50.9%), LSMDC (25.8%), and DiDeMo (47.2%)
  arXiv  Detail & Related papers  (2024-04-18T14:20:30Z)
• Detection of Groups with Biased Representation in Ranking [28.095668425175564]
  We study the problem of detecting groups with biased representation in the top-$k$ ranked items. We propose efficient search algorithms for two different fairness measures.
  arXiv  Detail & Related papers  (2022-12-30T10:50:02Z)
• Synergies between Disentanglement and Sparsity: Generalization and Identifiability in Multi-Task Learning [79.83792914684985]
  We prove a new identifiability result that provides conditions under which maximally sparse base-predictors yield disentangled representations. Motivated by this theoretical result, we propose a practical approach to learn disentangled representations based on a sparsity-promoting bi-level optimization problem.
  arXiv  Detail & Related papers  (2022-11-26T21:02:09Z)
• Fairness via Adversarial Attribute Neighbourhood Robust Learning [49.93775302674591]
  We propose a principled underlineRobust underlineAdversarial underlineAttribute underlineNeighbourhood (RAAN) loss to debias the classification head.
  arXiv  Detail & Related papers  (2022-10-12T23:39:28Z)
• The Minority Matters: A Diversity-Promoting Collaborative Metric Learning Algorithm [154.47590401735323]
  Collaborative Metric Learning (CML) has recently emerged as a popular method in recommendation systems. This paper focuses on a challenging scenario where a user has multiple categories of interests. We propose a novel method called textitDiversity-Promoting Collaborative Metric Learning (DPCML)
  arXiv  Detail & Related papers  (2022-09-30T08:02:18Z)
• Self-Supervised Learning Disentangled Group Representation as Feature [82.07737719232972]
  We show that existing Self-Supervised Learning (SSL) only disentangles simple augmentation features such as rotation and colorization. We propose an iterative SSL algorithm: Iterative Partition-based Invariant Risk Minimization (IP-IRM) We prove that IP-IRM converges to a fully disentangled representation and show its effectiveness on various benchmarks.
  arXiv  Detail & Related papers  (2021-10-28T16:12:33Z)
• How Fine-Tuning Allows for Effective Meta-Learning [50.17896588738377]
  We present a theoretical framework for analyzing representations derived from a MAML-like algorithm. We provide risk bounds on the best predictor found by fine-tuning via gradient descent, demonstrating that the algorithm can provably leverage the shared structure. This separation result underscores the benefit of fine-tuning-based methods, such as MAML, over methods with "frozen representation" objectives in few-shot learning.
  arXiv  Detail & Related papers  (2021-05-05T17:56:00Z)
• GroupFace: Learning Latent Groups and Constructing Group-based Representations for Face Recognition [20.407167858663453]
  We propose a novel face-recognition-specialized architecture called GroupFace to improve the quality of the embedding feature. The proposed method provides self-distributed labels that balance the number of samples belonging to each group without additional human annotations. All the components of the proposed method can be trained in an end-to-end manner with a marginal increase of computational complexity.
  arXiv  Detail & Related papers  (2020-05-21T07:30:34Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.