TeamUp: Semantic Project Matching and Team Formation for Learning at Scale

• URL: http://arxiv.org/abs/2605.03237v1
• Date: Tue, 05 May 2026 00:07:59 GMT
• Title: TeamUp: Semantic Project Matching and Team Formation for Learning at Scale
• Abstract summary: Project-based learning improves student engagement and learning outcomes.<n>Traditional allocation methods can't construct the cognitively diverse teams that collaborate cognitively.<n>We propose TeamUp, a lightweight, embedding-based team-forming system.
• Score: 5.239407424503223
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Project-based learning improves student engagement and learning outcomes, yet allocating students to appropriately challenging projects while forming cognitively diverse teams remains difficult at scale. Traditional allocation methods (manual spreadsheets, preference surveys) can't construct the cognitively diverse teams that that collaborate cognitively. This mismatch perpetuates equity issues: high-performing students self-select visible projects while under-represented students face reduced access to opportunity. We propose TeamUp, a lightweight, embedding-based team-forming system designed to improve learning outcomes and equity in large-scale project-based courses. TeamUp uses semantic embeddings from pretrained language models to match students to projects aligned with their skill level. The system employs a hybrid ranking algorithm combining cosine similarity with pedagogical constraints (difficulty alignment, domain preferences, and demand balancing) to generate personalised and transparent recommendations. Beyond individual matching, TeamUp constructs cognitively diverse teams by modelling skill complementarity through embedding variance, ensuring teams possess well-distributed capabilities rather than homogeneous strengths. We evaluated TeamUp through a virtual experiment using 250 student profiles and 60 project descriptions. Results show: (1) substantially higher match quality (mean cosine similarity of 0.74 vs. 0.43); (2) better difficulty alignment (83% placed within one level vs. 34%); (3) more diverse teams (82% covering three or more technical areas vs. 41%); and (4) sub-second recommendation latency at operational costs under $0.10 per student.

Related papers

• Students' Perception Accuracy of Partners' AI Use and its Relation to Collaboration Performance [12.900130585480523]
  Generative AI tools, now widely used by undergraduate students, have introduced a consequential and largely invisible new dimension into collaboration: each student's use of AI.<n>We conducted a three-wave longitudinal study of 103 student pairs in an introductory software engineering course.<n>We found that greater misalignment between partners' beliefs about each other's AI use early in the project was associated with lower final project scores.
  arXiv  Detail & Related papers  (2026-06-22T12:23:41Z)
• Improving Capstone Team Outcomes through Dynamic Skill Matching and Preference Alignment [1.1807695418165365]
  Team-based projects are a cornerstone of engineering and computing courses, but unstructured team formation often leads to poor project outcomes.<n>This paper introduces a novel, three-stage methodology for creating effective student teams by integrating student preferences with project skill requirements.
  arXiv  Detail & Related papers  (2026-06-14T03:29:35Z)
• Two-Phase Simulated Annealing for Equitable Team Formation: Eliminating Complaints in Large Engineering Cohorts [1.6809115847450455]
  This paper presents a novel two-phase algorithmic approach that decouples preference satisfaction from fairness optimization in student team formation.<n>Existing tools either optimize for fairness while ignoring preferences or accommodate preferences while compromising balance.<n>Phase 1 forms fixed triads through graph-theoretic clustering that maximizes mutual preferences, preserving social bonds.<n>Phase 2 employs simulated annealing to pair triads into teams of six while optimizing GPA variance, gender balance, and size constraints.
  arXiv  Detail & Related papers  (2026-06-05T13:44:35Z)
• SPARTA ALIGNMENT: Collectively Aligning Multiple Language Models through Combat [76.48873047003943]
  We propose SPARTA ALIGNMENT, an algorithm to collectively align multiple LLMs through competition and combat.<n>For each iteration, one instruction and two models are selected for a duel, the other models evaluate the two responses, and their evaluation scores are aggregated through a adapted elo-ranking based reputation system.<n>The peer-evaluated combat results then become preference pairs where the winning response is preferred over the losing one, and all models learn from these preferences at the end of each iteration.
  arXiv  Detail & Related papers  (2025-06-05T07:51:23Z)
• Educational Customization by Homogenous Grouping of e-Learners based on their Learning Styles [0.4915744683251149]
  We propose using the Felder-Silverman model, which is based on learning styles, to group similar learners. By identifying the learning styles of the learners, co-like learning groups are formed, and each group receives adaptive content based on their preferences, needs, talents, and abilities. In terms of "educational success," the weighted average score of the experimental group is 17.65 out of 20, while the control group achieves a score of 12.6 out of 20.
  arXiv  Detail & Related papers  (2024-08-09T14:06:42Z)
• 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)
• 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)
• NEVIS'22: A Stream of 100 Tasks Sampled from 30 Years of Computer Vision Research [96.53307645791179]
  We introduce the Never-Ending VIsual-classification Stream (NEVIS'22), a benchmark consisting of a stream of over 100 visual classification tasks. Despite being limited to classification, the resulting stream has a rich diversity of tasks from OCR, to texture analysis, scene recognition, and so forth. Overall, NEVIS'22 poses an unprecedented challenge for current sequential learning approaches due to the scale and diversity of tasks.
  arXiv  Detail & Related papers  (2022-11-15T18:57:46Z)
• Neural Payoff Machines: Predicting Fair and Stable Payoff Allocations Among Team Members [13.643650155415484]
  We show how cooperative game-theoretic solutions can be distilled into a learned model by training neural networks. Our approach creates models that can generalize to games far from the training distribution. An important application of our framework is Explainable AI.
  arXiv  Detail & Related papers  (2022-08-18T12:33:09Z)
• Learning Equilibria in Matching Markets from Bandit Feedback [139.29934476625488]
  We develop a framework and algorithms for learning stable market outcomes under uncertainty. Our work takes a first step toward elucidating when and how stable matchings arise in large, data-driven marketplaces.
  arXiv  Detail & Related papers  (2021-08-19T17:59:28Z)
• FERN: Fair Team Formation for Mutually Beneficial Collaborative Learning [9.484474204788349]
  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.
  arXiv  Detail & Related papers  (2020-11-23T18:38:01Z)
• CoMatch: Semi-supervised Learning with Contrastive Graph Regularization [86.84486065798735]
  CoMatch is a new semi-supervised learning method that unifies dominant approaches. It achieves state-of-the-art performance on multiple datasets.
  arXiv  Detail & Related papers  (2020-11-23T02:54:57Z)
• My Team Will Go On: Differentiating High and Low Viability Teams through Team Interaction [17.729317295204368]
  We train a viability classification model over a dataset of 669 10-minute text conversations of online teams. We find that a lasso regression model achieves an accuracy of.74--.92 AUC ROC under different thresholds of classifying viability scores.
  arXiv  Detail & Related papers  (2020-10-14T21:33:36Z)

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.