Enhances student diversity in collaborative learning.
problem Student homogenization in large groups.
method Random routing, diverse feature sets, and random subgroup imitation.
result Significantly outperforms state-of-the-art approaches.
Bayesian model identifies skill difficulties and student subgroups in engineering education.
problem Identifying and supporting diverse student needs in entry-level university engineering modules.
method Hierarchical Bayesian modeling of student response data.
result Clear patterns of skill mastery and distinct student subgroups identified.
A new GAN method uses Student's t-distribution to generate diverse images with less data.
problem GANs require large datasets and often produce nonsensical results.
method Integrates Student's t-distribution with attention mechanism and dual task discriminator.
result Generates diverse and legible images with limited data.
Teaches diverse students in a classroom setting with minimal examples.
problem Teaching a diverse group of students with varying initial states and learning rates.
method Proves an optimal teaching strategy with O(min{d,N} log(1/eps)) examples, robust to limited knowledge, and studies workload-cost trade-offs.
result Teaching a target concept to the entire classroom using optimal number of examples, validated by experiments.
GAN-TSC improves student model accuracy by augmenting with synthetic data.
problem Suboptimal compression when fresh data is unavailable for TSC.
method Augment compression dataset with synthetic data from a GAN.
result Significant improvement in student accuracy for expensive models.
Predicts student outcomes in real-time using domain adaptation.
problem Real-time student performance prediction in online courses.
method GritNet architecture with unsupervised domain adaptation.
result GritNet enhances real-time predictions, especially in early weeks.
OKDDip uses diverse peers to improve online knowledge distillation.
problem Early saturation in group-based distillation.
method Two-level distillation with multiple auxiliary peers and a group leader, using attention-based aggregation weights.
result OKDDip consistently gives better performance than state-of-the-art approaches.
Modeling student course choices using latent variables.
problem Understanding student enrollment patterns in large universities.
method Probabilistic approach based on multilabel classification and mixture models.
result Demonstrated the model's ability to infer student interests guiding enrollment decisions.
Self-distillation improves model performance by increasing teacher diversity and smoothing predictions.
problem Improving model generalization and performance through self-distillation.
method Interpreting self-distillation as MAP estimation and proposing instance-specific label smoothing.
result Self-distillation enhances model performance by increasing teacher diversity and smoothing predictions.
Increasingly fast development and update cycle of online course contents, and diverse demographics of students in each online classroom, make student performance prediction in real-time (before the course finishes) and/or on curriculum without specific historical performance data available interesting topics for both i…
KT models improved slightly with synthetic student data.
problem Limited access to real student data and lack of diversity in public datasets.
method Simulated student data using three statistical strategies and tested on KT baselines.
result Synthetic data can lead to similar performance as real data.
Teacher algorithm helps DRL learn diverse environments efficiently.
problem Teach DRL to learn in various, unknown environments efficiently.
method Transformed into a bandit problem, learns to sample environments.
result ALP-GMM models learning progress, improving curriculum design.
Inspired by the unsupervised learning or self-organization in the machine learning context, here we attempt to draw `learning curve' for the collective behavior of job-seeking `zero-intelligence' labors in successive job-hunting processes. Our labor market is supposed to be opened especially for university graduates in…
Study shows how task similarity affects forgetting in teacher-student setup.
problem Catastrophic forgetting in continual learning.
method Extended teacher-student setup to multiple teachers, analyzing similarity between tasks.
result Task similarity, whether at readouts or features, influences forgetting and transfer.
Study shows human advisors use context to improve student outcomes in algorithm-assisted advising.
problem How human advisors use context to guide interventions in algorithm-assisted advising.
method Mixed-methods approach combining quantitative and qualitative data from a randomized controlled trial.
result 2 out of 3 interventions by advisors were plausibly 'expertly targeted' to students using non-algorithmic context.
Lecture note for data science students on machine learning basics and advanced topics.
problem No specific problem stated; preparing students for advanced machine learning.
method Introduction of basic machine learning concepts and advanced topics.
result Students are prepared to study advanced machine learning topics.
New diffusion models capture heavy-tailed distributions better.
problem Diffusion models struggle with rare or extreme events in heavy-tailed distributions.
method Repurposed diffusion framework using multivariate Student-t distributions, tailored perturbation kernel, and γ-divergence. result Our models generate rare and extreme events more effectively than standard diffusion models.
TAdam optimizes machine learning models to resist noise effectively.
problem Noise in data, especially in robotics, hinders model performance.
method Integrates robust student-t distribution into Adam optimizer.
result TAdam outperforms Adam in robustness across various tasks.
Enhances model compression with multi-teacher knowledge distillation.
problem Uncertainty evaluation and diverse teacher expertise in model deployment.
method Bayesian inference and teacher-informed prior with entropy-based weighting.
result Improved predictive accuracy and robust uncertainty quantification.
Paper learns a versatile model from diverse networks without annotations.
problem Combining knowledge from different specialized networks without access to their training data.
method Transforms features of diverse networks into a common space and forces a student model to mimic them.
result The student model outperforms individual teacher models on various benchmarks.
The study uses Hidden Markov Models to analyze student enrollment patterns and academic performance.
problem Limited understanding of how enrollment patterns affect academic performance.
method Applied Hidden Markov Models to categorize enrollment strategies and compare academic outcomes.
result Mixed enrollment strategies lead to better academic performance, especially during part-time semesters.
Developed predictive models for improving programming course performance.
problem Improving student performance in programming courses.
method Used M5P Decision Tree and Linear Regression Classifier on structured questionnaire data.
result Variable-based LRC model produced the best model with least evaluation metrics.
Predicts student performance in interactive online question pools using GNNs.
problem Predicting student performance in interactive online question pools with evolving knowledge.
method Proposes R^2GCN, a GNN model for heterogeneous networks to predict student performance.
result Achieves higher accuracy in student performance prediction than traditional methods.
Proposes RaT to mitigate bias in student-teacher estimation.
problem Systematic bias in teacher's predictions propagates to student model.
method Uses teacher to estimate residuals in student's predictions.
result RaT method reduces teacher bias effect and achieves optimal rate.
Analyzed writing style changes in Danish high school students.
problem Detecting global development trends and identifying at-risk students in high school writing.
method Used a Siamese neural network to compute essay similarity and clustered student profiles.
result High school students' writing styles become less similar as they progress, with some students showing significant improvement and others limited development or setbacks.
We propose gradient adversarial training, an auxiliary deep learning framework applicable to different machine learning problems. In gradient adversarial training, we leverage a prior belief that in many contexts, simultaneous gradient updates should be statistically indistinguishable from each other. We enforce this c…
Hidden Markov Model predicts student performance in educational games.
problem Estimating student knowledge progression in educational games.
method Time series analysis using hidden Markov model with game features.
result State trajectories accurately predict student performance.
Each year, roughly 30% of first-year students at US baccalaureate institutions do not return for their second year and over $9 billion is spent educating these students. Yet, little quantitative research has analyzed the causes and possible remedies for student attrition. Here, we describe initial efforts to model stud…
Deep neural networks bring in impressive accuracy in various applications, but the success often relies on the heavy network architecture. Taking well-trained heavy networks as teachers, classical teacher-student learning paradigm aims to learn a student network that is lightweight yet accurate. In this way, a portable…
Adaptive teacher improves sample efficiency and mode coverage in sampling tasks.
problem Efficient exploration and mode coverage in sampling tasks with amortized inference.
method An adaptive training distribution (teacher) guides the training of the primary sampler (student).
result Improves sample efficiency and mode coverage across various tasks.
Student-teacher learning improves generalization with noisy inputs.
problem Transfer knowledge from clean inputs to noisy inputs.
method Analyzes student-teacher learning using deep linear networks and experiments with nonlinear networks.
result Three factors are vital for success: zero training loss, teacher knowledge, and feature decomposition.
The Open University studies student online behavior in virtual learning environments.
problem Improving retention rates in online modules.
method GUHA and Markov chain-based analysis of student activity.
result Both methods are valid for modeling student activities.
A new teacher-class network method compresses DNNs by distributing knowledge to multiple student networks.
problem Overwhelming size of Deep Neural Networks (DNNs).
method Single teacher with multiple student networks, transferring knowledge to each student.
result The combined knowledge of the class of students achieves better performance and reduces parameters.
An important, yet largely unstudied, problem in student data analysis is to detect misconceptions from students' responses to open-response questions. Misconception detection enables instructors to deliver more targeted feedback on the misconceptions exhibited by many students in their class, thus improving the quality…
This research tackles sample complexity in causal graph recovery with temporal heterogeneity.
problem Recovering a unique causal graph from observational data with temporal heterogeneity.
method Integrates time-series dynamics and multi-environment heterogeneity to constrain the problem, enabling a rigorous analysis of statistical limits.
result Unified necessary identifiability conditions and explicit information-theoretic bounds quantify the sample complexity under different noise distributions.
Detects student engagement states using unobtrusive appearance, context, and mouse data.
problem Detecting student engagement states in a classroom setting.
method Multimodal approach combining appearance, context, and mouse data; classifiers are fused at the decision level.
result Effective detection of student engagement states in a classroom setting.
Improved ImageNet classification with semi-supervised learning.
problem Image classification with limited labeled data.
method Noisy Student Training: semi-supervised learning with noisy student models.
result 88.4% top-1 accuracy on ImageNet, 2.0% better than state-of-the-art.
Modeling student behaviors and multiple predictions for early intervention.
problem Predicting student outcomes and interactions among multiple tasks.
method Proposes a variant of LSTM and soft-attention mechanism for heterogeneous behaviors, and co-attention mechanism for task interactions.
result Demonstrated effectiveness in predicting student outcomes and interactions.
Proposes KTAN for better training of student networks with both intermediate representations and probability distributions.
problem Reduces large computation and storage cost of deep networks by transferring generalization ability.
method Holistically considers intermediate representations and probability distributions; uses a Teacher-to-Student layer and adversarial learning.
result Significantly improves performance of student networks on image classification and object detection tasks.
Estimates model performance from compute budget for distillation.
problem Risk mitigation in large-scale distillation.
method Distillation scaling law based on compute budget allocation.
result Maximizes student performance with compute-optimal allocation.
Distilled models often fail to match teacher models, despite improving generalization.
problem The discrepancy between teacher and student predictive distributions remains large.
method Investigated the optimization difficulties and dataset details affecting student performance.
result Optimizing for matching the teacher does not always lead to better generalization.
A new method for student-initiated action advice using novelty detection.
problem Exploration and sample inefficiency in RL, especially with teacher absence.
method Random Network Distillation (RND) to measure advice novelty, updates only for advised states.
result Significant performance improvement over state-of-the-art methods, especially in challenging scenarios.
Improved image reconstruction using VAEs with Student's t-prior.
problem Improving the robustness of VAEs in image reconstruction.
method Proposed a VAE with Student's t-distribution as prior, trained all distribution parameters.
result Better image reconstruction achieved with Student's t-prior compared to Gaussian priors.
Explains Cartan geometries for graduate students.
problem None explicitly stated, focuses on definition.
method Definition and explanation.
result Defines Cartan geometries for a specific audience.
Gaussian process priors are commonly used in aerospace design for performing Bayesian optimization. Nonetheless, Gaussian processes suffer two significant drawbacks: outliers are a priori assumed unlikely, and the posterior variance conditioned on observed data depends only on the locations of those data, not the assoc…
Study predicts academic achievement using students' support networks.
problem Predicting academic achievement in college students.
method Decision tree and random forest algorithms applied to Ties data.
result Different types of support are important for different demographics and genders.
Self-training with noisy student-teacher boosts keyword spotting accuracy.
problem Robust keyword spotting in challenging conditions.
method Aggressive data augmentation and self-training with noisy student-teacher approach.
result Significant accuracy improvement in difficult conditions, up to 60%.
Student performance prediction - where a machine forecasts the future performance of students as they interact with online coursework - is a challenging problem. Reliable early-stage predictions of a student's future performance could be critical to facilitate timely educational interventions during a course. However, …