Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,982 papers · 148 categories

Trend · papers per month

68135203270 · Jun 202019922001200920172026
48 results for Massive Open Online Courses (MOOCs)

The Web has enabled one of the most visible recent developments in education---the deployment of massive open online courses. With their global reach and often staggering enrollments, MOOCs have the potential to become a major new mechanism for learning. Despite this early promise, however, MOOCs are still relatively u…

2014-03-12abs ↗pdf ↗

Massive Open Online Courses (MOOCs) bring together thousands of people from different geographies and demographic backgrounds -- but to date, little is known about how they learn or communicate. We introduce a new content-analysed MOOC dataset and use Bayesian Non-negative Matrix Factorization (BNMF) to extract communi…

2014-03-18abs ↗pdf ↗

In massive open online courses (MOOCs), peer grading serves as a critical tool for scaling the grading of complex, open-ended assignments to courses with tens or hundreds of thousands of students. But despite promising initial trials, it does not always deliver accurate results compared to human experts. In this paper,…

2013-07-09abs ↗pdf ↗

A new system recommends specific knowledge concepts in MOOCs based on student interests.

problem MOOCs recommend courses but ignore specific knowledge concepts interests.
method End-to-end graph neural network (ACKRec) that combines content and context information.
result ACKRec effectively recommends knowledge concepts to MOOC students.

The paper presents a machine learning approach to multidimensional item response theory.

problem Modeling and predicting student performance from assessment data.
method Inspired by collaborative filtering, the paper defines a general class of models using penalized joint maximum likelihood (JML) for estimation and cross-validation for model selection.
result The high-dimensional model fit to large and sparse data does not lend itself well to traditional factor interpretation.

DynAEsti models ability as a time-varying curve, improving IRT for dynamic settings.

problem Traditional IRT models assume static ability; new approach models dynamic ability.
method DynAEsti augments traditional IRT Expectation Maximization with CurvFiFE for curve fitting.
result DynAEsti successfully recovers human performance dynamics in golf.

The field of learning analytics needs to adopt a more rigorous approach for predictive model evaluation that matches the complex practice of model-building. In this work, we present a procedure to statistically test hypotheses about model performance which goes beyond the state-of-the-practice in the community to analy…

2018-02-16abs ↗pdf ↗

Tailoring the presentation of information to the needs of individual students leads to massive gains in student outcomes~\cite{bloom19842}. This finding is likely due to the fact that different students learn differently, perhaps as a result of variation in ability, interest or other factors~\cite{schiefele1992interest…

2018-09-24abs ↗pdf ↗

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.

Bayesian rating system for large competitions improves prediction and efficiency.

problem Rating systems for large, competitive events like online programming contests.
method Developed a Bayesian rating system for many participants, proving robustness and runtime.
result The system outperforms existing systems in accuracy and computation speed.

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…

2018-09-07abs ↗pdf ↗

Unified HDP and LDA models for efficient topic clustering of online course queries.

problem Efficiently cluster and answer subject-specific online course queries.
method Use Hierarchical Dirichlet Process (HDP) to optimize topic number for Latent Dirichlet Allocation (LDA) model runs.
result Achieve optimal clustering efficiency by recursively applying LDA on effective topics.

Develops an online nonparametric classifier for massive data.

problem Challenges of batch kernel-based nonparametric classifiers in massive data.
method Online principle components analysis to reduce dimensionality, followed by stochastic approximation algorithm for real-time calculation.
result Online classifier provides the best trade-off between accuracy and computation cost.

Study evaluates predictive models for blended courses, analyzing performance across different offerings.

problem Limited success in predicting student performance in blended courses.
method Used data from two offerings of two different undergraduate courses to train and evaluate models.
result Models perform better on the same offering and less well on different offerings of the same course.

Paper proposes online learning for MIMO channel estimation using neural networks.

problem Challenges in MIMO channel estimation due to physical model simplifications and system configuration requirements.
method Unfold a channel estimation algorithm as a neural network, allowing online learning and correction of imperfect models.
result Achieves channel estimation error close to that of a perfectly calibrated system.

New metric MADD assesses fairness of predictive student models.

problem Predictive student models can be biased and unfair, leading to discrimination.
method Proposes MADD metric to analyze model's discriminatory behaviors.
result Fair predictive performance does not guarantee fair behaviors or outcomes.

Study on continual learning with Twitter data, developing ConGraD algorithm.

problem Personalized online language learning on a massive scale.
method Developed POLL problem setting, collected Firehose datasets, and introduced ConGraD algorithm.
result ConGraD algorithm outperforms prior continual learning methods on Firehose datasets.

Paper proposes a GPU-based system for training massive deep learning models in ads systems.

problem Training massive deep learning models with terabyte-scale parameters in ads systems.
method Hierarchical GPU parameter server with 3-layer storage (GPU High-Bandwidth Memory, CPU main memory, SSD).
result 4-node hierarchical GPU parameter server trains a model 2X faster than a 150-node in-memory system.

TrueLearn uses Bayesian algorithms to match learners with educational resources.

problem Matching lifelong learners to open educational resources efficiently and effectively.
method TrueLearn uses a text ontology and Bayesian strategies to match learners with educational resources based on their background knowledge and material novelty.
result TrueLearn algorithms show promise in building an effective educational recommendation system.

Open problem seeks an online learning algorithm for binary classification.

problem Existence of an online learning algorithm for binary classification with sublinear mistakes.
method Assumption of sequence allowing learning algorithm's existence.
result Specific condition determines sequence's learnability.

Distributed computing offers a high degree of flexibility to accommodate modern learning constraints and the ever increasing size of datasets involved in massive data issues. Drawing inspiration from the theory of distributed computation models developed in the context of gradient-type optimization algorithms, we prese…

2014-07-16abs ↗pdf ↗

Private learning can be used to efficiently solve online learning problems.

problem The relationship between differentially private learning and online learning efficiency.
method Derive an efficient black-box reduction from differentially private learning to online learning from expert advice.
result An efficient differentially private learner implies an efficient online learner.

Develops a fair post-processing method for student success predictions.

problem Ensuring fairness in predictive student models for educational applications.
method Uses the MADD metric to improve model fairness while maintaining accuracy.
result Successfully improved fairness of predictive models for student success.

We present a scalable Bayesian model for low-rank factorization of massive tensors with binary observations. The proposed model has the following key properties: (1) in contrast to the models based on the logistic or probit likelihood, using a zero-truncated Poisson likelihood for binary data allows our model to scale …

2015-08-18abs ↗pdf ↗