FERN: Fair Team Formation for Mutually Beneficial Collaborative Learning

• URL: http://arxiv.org/abs/2011.11611v1
• Date: Mon, 23 Nov 2020 18:38:01 GMT
• Title: FERN: Fair Team Formation for Mutually Beneficial Collaborative Learning
• Authors: Maria Kalantzi, Agoritsa Polyzou, and George Karypis
• Abstract summary: This work introduces FERN, a fair team formation approach that promotes mutually beneficial peer learning. We show this problem as a discrete optimization problem to be NPhard and propose a hill-climbing algorithm.
• Score: 9.484474204788349
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Automated Team Formation is becoming increasingly important for a plethora of applications in open source community projects, remote working platforms, as well as online educational systems. The latter case, in particular, poses significant challenges that are specific to the educational domain. Indeed, teaming students aims to accomplish far more than the successful completion of a specific task. It needs to ensure that all members in the team benefit from the collaborative work, while also ensuring that the participants are not discriminated with respect to their protected attributes, such as race and gender. Towards achieving these goals, this work introduces FERN, a fair team formation approach that promotes mutually beneficial peer learning, dictated by protected group fairness as equality of opportunity in collaborative learning. We formulate the problem as a multi-objective discrete optimization problem. We show this problem to be NP-hard and propose a heuristic hill-climbing algorithm. Extensive experiments on both synthetic and real-world datasets against well-known team formation techniques show the effectiveness of the proposed method.

Related papers

• Code Collaborate: Dissecting Team Dynamics in First-Semester Programming Students [3.0294711465150006]
  The study highlights the collaboration trends that emerge as first-semester students develop a 2D game project. Results indicate that students often slightly overestimate their contributions, with more engaged individuals more likely to acknowledge mistakes. Team performance shows no significant variation based on nationality or gender composition, though teams that disbanded frequently consisted of lone wolves.
  arXiv  Detail & Related papers  (2024-10-28T11:42:05Z)
• TeamLoRA: Boosting Low-Rank Adaptation with Expert Collaboration and Competition [61.91764883512776]
  We introduce an innovative PEFT method, TeamLoRA, consisting of a collaboration and competition module for experts. By doing so, TeamLoRA connects the experts as a "Team" with internal collaboration and competition, enabling a faster and more accurate PEFT paradigm for multi-task learning.
  arXiv  Detail & Related papers  (2024-08-19T09:58:53Z)
• Incentivizing Honesty among Competitors in Collaborative Learning and Optimization [5.4619385369457225]
  Collaborative learning techniques have the potential to enable machine learning models that are superior to models trained on a single entity's data. In many cases, potential participants in such collaborative schemes are competitors on a downstream task.
  arXiv  Detail & Related papers  (2023-05-25T17:28:41Z)
• A Reinforcement Learning-assisted Genetic Programming Algorithm for Team Formation Problem Considering Person-Job Matching [70.28786574064694]
  A reinforcement learning-assisted genetic programming algorithm (RL-GP) is proposed to enhance the quality of solutions. The hyper-heuristic rules obtained through efficient learning can be utilized as decision-making aids when forming project teams.
  arXiv  Detail & Related papers  (2023-04-08T14:32:12Z)
• Combating Exacerbated Heterogeneity for Robust Models in Federated Learning [91.88122934924435]
  Combination of adversarial training and federated learning can lead to the undesired robustness deterioration. We propose a novel framework called Slack Federated Adversarial Training (SFAT) We verify the rationality and effectiveness of SFAT on various benchmarked and real-world datasets.
  arXiv  Detail & Related papers  (2023-03-01T06:16:15Z)
• Federated Selective Aggregation for Knowledge Amalgamation [66.94340185846686]
  The goal of FedSA is to train a student model for a new task with the help of several decentralized teachers. Our motivation for investigating such a problem setup stems from a recent dilemma of model sharing. The proposed FedSA offers a solution to this dilemma and makes it one step further since, again, the learned student may specialize in a new task different from all of the teachers.
  arXiv  Detail & Related papers  (2022-07-27T05:36:50Z)
• Distributed Deep Learning in Open Collaborations [49.240611132653456]
  We propose a novel algorithmic framework designed specifically for collaborative training. We demonstrate the effectiveness of our approach for SwAV and ALBERT pretraining in realistic conditions and achieve performance comparable to traditional setups at a fraction of the cost.
  arXiv  Detail & Related papers  (2021-06-18T16:23:13Z)
• Who does what? Work division and allocation strategies of computer science student teams [5.863264019032882]
  The aim of this research is to gain insight into the work division and allocation strategies applied by computer science students during group assignments. Motivated primarily by grade and efficiency factors, students choose and allocate tasks based on their prior expertise and preferences. Based on our findings, we argue that the setup of group assignments can limit student motivation for practicing new software engineering skills.
  arXiv  Detail & Related papers  (2021-03-04T12:27:07Z)
• Practical One-Shot Federated Learning for Cross-Silo Setting [114.76232507580067]
  One-shot federated learning is a promising approach to make federated learning applicable in cross-silo setting. We propose a practical one-shot federated learning algorithm named FedKT. By utilizing the knowledge transfer technique, FedKT can be applied to any classification models and can flexibly achieve differential privacy guarantees.
  arXiv  Detail & Related papers  (2020-10-02T14:09:10Z)
• A Stochastic Team Formation Approach for Collaborative Mobile Crowdsourcing [1.4209473797379666]
  We develop an algorithm that exploit workers knowledge about their SN neighbors and asks a designated leader to recruit a suitable team. The proposed algorithm is inspired from the optimal stopping strategies and uses the odds-algorithm to compute its output. Experimental results show that, compared to the benchmark exponential optimal solution, the proposed approach reduces time and produces reasonable performance results.
  arXiv  Detail & Related papers  (2020-04-28T22:44:37Z)
• Algorithms for Fair Team Formation in Online Labour Marketplaces [6.446179861303341]
  We aim to guarantee that the process of hiring workers through the use of machine learning and algorithmic data analysis tools does not discriminate, even unintentionally, on grounds of nationality or gender. We provide inapproximability results for the Fair Team Formation problem together with four algorithms for the problem itself. We also tested the effectiveness of our algorithmic solutions by performing experiments using real data from an online labor marketplace.
  arXiv  Detail & Related papers  (2020-02-14T11:33:35Z)

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.