Multiple Fairness and Cardinality constraints for Students-Topics Grouping Problem

• URL: http://arxiv.org/abs/2206.09895v1
• Date: Mon, 20 Jun 2022 17:06:10 GMT
• Title: Multiple Fairness and Cardinality constraints for Students-Topics Grouping Problem
• Authors: Tai Le Quy, Gunnar Friege and Eirini Ntoutsi
• Abstract summary: Group work is a prevalent activity in educational settings, where students are often divided into topic-specific groups based on their preferences. We introduce the multi-fair capacitated (MFC) grouping problem that fairly partitions students into non-overlapping groups. We propose two approaches: a method and a knapsack-based method to obtain the grouping.
• Score: 14.051419173519308
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Group work is a prevalent activity in educational settings, where students are often divided into topic-specific groups based on their preferences. The grouping should reflect the students' aspirations as much as possible. Usually, the resulting groups should also be balanced in terms of protected attributes like gender or race since studies indicate that students might learn better in a diverse group. Moreover, balancing the group cardinalities is also an essential requirement for fair workload distribution across the groups. In this paper, we introduce the multi-fair capacitated (MFC) grouping problem that fairly partitions students into non-overlapping groups while ensuring balanced group cardinalities (with a lower bound and an upper bound), and maximizing the diversity of members in terms of protected attributes. We propose two approaches: a heuristic method and a knapsack-based method to obtain the MFC grouping. The experiments on a real dataset and a semi-synthetic dataset show that our proposed methods can satisfy students' preferences well and deliver balanced and diverse groups regarding cardinality and the protected attribute, respectively.

Related papers

• A Canonical Data Transformation for Achieving Inter- and Within-group Fairness [17.820200610132265]
  We introduce a formal definition of within-group fairness that maintains fairness among individuals from within the same group. We propose a pre-processing framework to meet both inter- and within-group fairness criteria with little compromise in accuracy. We apply this framework to the COMPAS risk assessment and Law School datasets and compare its performance to two regularization-based methods.
  arXiv  Detail & Related papers  (2023-10-23T17:00:20Z)
• Fairness Aware Counterfactuals for Subgroups [8.593488857185678]
  We present Fairness Aware Counterfactuals for Subgroups (FACTS), a framework for auditing subgroup fairness through counterfactual explanations. We aim to formulate different aspects of the difficulty of individuals in certain subgroups to achieve recourse. We introduce notions of subgroup fairness that are robust, if not totally oblivious, to the cost of achieving recourse.
  arXiv  Detail & Related papers  (2023-06-26T18:03:56Z)
• Fair and skill-diverse student group formation via constrained k-way graph partitioning [65.29889537564455]
  This work introduces an unsupervised algorithm for fair and skill-diverse student group formation. The skill sets of students are determined using unsupervised dimensionality reduction of course mark data via the Laplacian eigenmap. The problem is formulated as a constrained graph partitioning problem, whereby the diversity of skill sets in each group are maximised.
  arXiv  Detail & Related papers  (2023-01-12T14:02:49Z)
• Outlier-Robust Group Inference via Gradient Space Clustering [50.87474101594732]
  Existing methods can improve the worst-group performance, but they require group annotations, which are often expensive and sometimes infeasible to obtain. We address the problem of learning group annotations in the presence of outliers by clustering the data in the space of gradients of the model parameters. We show that data in the gradient space has a simpler structure while preserving information about minority groups and outliers, making it suitable for standard clustering methods like DBSCAN.
  arXiv  Detail & Related papers  (2022-10-13T06:04:43Z)
• Towards Group Robustness in the presence of Partial Group Labels [61.33713547766866]
  spurious correlations between input samples and the target labels wrongly direct the neural network predictions. We propose an algorithm that optimize for the worst-off group assignments from a constraint set. We show improvements in the minority group's performance while preserving overall aggregate accuracy across groups.
  arXiv  Detail & Related papers  (2022-01-10T22:04:48Z)
• Focus on the Common Good: Group Distributional Robustness Follows [47.62596240492509]
  This paper proposes a new and simple algorithm that explicitly encourages learning of features that are shared across various groups. While Group-DRO focuses on groups with worst regularized loss, focusing instead, on groups that enable better performance even on other groups, could lead to learning of shared/common features.
  arXiv  Detail & Related papers  (2021-10-06T09:47:41Z)
• MultiFair: Multi-Group Fairness in Machine Learning [52.24956510371455]
  We study multi-group fairness in machine learning (MultiFair) We propose a generic end-to-end algorithmic framework to solve it. Our proposed framework is generalizable to many different settings.
  arXiv  Detail & Related papers  (2021-05-24T02:30:22Z)
• Fair-Capacitated Clustering [5.127121704630949]
  We introduce the fair-capacitated clustering problem that partitions the data into clusters of similar instances. We propose two approaches, namely hierarchical clustering and partitioning-based clustering, to obtain the fair-capacitated clustering. Our experiments on four educational datasets show that our approaches deliver well-balanced clusters in terms of both fairness and cardinality.
  arXiv  Detail & Related papers  (2021-04-25T09:39:39Z)
• Overcoming Data Sparsity in Group Recommendation [52.00998276970403]
  Group recommender systems should be able to accurately learn not only users' personal preferences but also preference aggregation strategy. In this paper, we take Bipartite Graphding Model (BGEM), the self-attention mechanism and Graph Convolutional Networks (GCNs) as basic building blocks to learn group and user representations in a unified way.
  arXiv  Detail & Related papers  (2020-10-02T07:11:19Z)

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.