Fair and skill-diverse student group formation via constrained k-way graph partitioning

• URL: http://arxiv.org/abs/2301.09984v1
• Date: Thu, 12 Jan 2023 14:02:49 GMT
• Title: Fair and skill-diverse student group formation via constrained k-way graph partitioning
• Authors: Alexander Jenkins, Imad Jaimoukha, Ljubisa Stankovic, Danilo Mandic
• Abstract summary: 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.
• Score: 65.29889537564455
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Forming the right combination of students in a group promises to enable a powerful and effective environment for learning and collaboration. However, defining a group of students is a complex task which has to satisfy multiple constraints. This work introduces an unsupervised algorithm for fair and skill-diverse student group formation. This is achieved by taking account of student course marks and sensitive attributes provided by the education office. 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, group sizes are upper and lower bounded according to available resources, and `balance' of a sensitive attribute is lower bounded to enforce fairness in group formation. This optimisation problem is solved using integer programming and its effectiveness is demonstrated on a dataset of student course marks from Imperial College London.

Related papers

• Data Similarity-Based One-Shot Clustering for Multi-Task Hierarchical Federated Learning [8.37314799155978]
  We propose a one-shot clustering algorithm that can effectively identify and group users based on their data similarity. Our proposed algorithm not only enhances the clustering process, but also overcomes challenges related to privacy concerns, communication overhead, and the need for prior knowledge about learning models or loss function behaviors.
  arXiv  Detail & Related papers  (2024-10-03T17:51:21Z)
• 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)
• Multiple Fairness and Cardinality constraints for Students-Topics Grouping Problem [14.051419173519308]
  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.
  arXiv  Detail & Related papers  (2022-06-20T17:06:10Z)
• Addressing Missing Sources with Adversarial Support-Matching [8.53946780558779]
  We investigate a scenario in which the absence of certain data is linked to the second level of a two-level hierarchy in the data. Inspired by the idea of protected groups from algorithmic fairness, we refer to the partitions carved by this second level as "subgroups" We make use of an additional, diverse but unlabeled dataset, called the "deployment set", to learn a representation that is invariant to subgroup.
  arXiv  Detail & Related papers  (2022-03-24T16:19:19Z)
• Adversarial Dual-Student with Differentiable Spatial Warping for Semi-Supervised Semantic Segmentation [70.2166826794421]
  We propose a differentiable geometric warping to conduct unsupervised data augmentation. We also propose a novel adversarial dual-student framework to improve the Mean-Teacher. Our solution significantly improves the performance and state-of-the-art results are achieved on both datasets.
  arXiv  Detail & Related papers  (2022-03-05T17:36:17Z)
• Fair Group-Shared Representations with Normalizing Flows [68.29997072804537]
  We develop a fair representation learning algorithm which is able to map individuals belonging to different groups in a single group. We show experimentally that our methodology is competitive with other fair representation learning algorithms.
  arXiv  Detail & Related papers  (2022-01-17T10:49:49Z)
• 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)
• 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)
• A Machine Learning Approach to Assess Student Group Collaboration Using Individual Level Behavioral Cues [8.840643644938156]
  We propose using simple deep-learning-based machine learning models to automatically determine the overall collaboration quality of a group. We come across the following challenges when building these models: 1) Limited training data, 2) Severe class label imbalance.
  arXiv  Detail & Related papers  (2020-07-13T20:15:29Z)

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.