Quantized Matrix Completion for Personalized Learning

2014-12-18 · Andrew S. Lan, Christoph Studer, Richard G. Baraniuk

The recently proposed SPARse Factor Analysis (SPARFA) framework for personalized learning performs factor analysis on ordinal or binary-valued (e.g., correct/incorrect) graded learner responses to questions. The underlying factors are termed "concepts" (or knowledge components) and are used for learning analytics (LA), the estimation of learner concept-knowledge profiles, and for content analytics (CA), the estimation of question-concept associations and question difficulties. While SPARFA is a powerful tool for LA and CA, it requires a number of algorithm parameters (including the number of concepts), which are difficult to determine in practice. In this paper, we propose SPARFA-Lite, a convex optimization-based method for LA that builds on matrix completion, which only requires a single algorithm parameter and enables us to automatically identify the required number of concepts. Using a variety of educational datasets, we demonstrate that SPARFALite (i) achieves comparable performance in predicting unobserved learner responses to existing methods, including item response theory (IRT) and SPARFA, and (ii) is computationally more efficient.

📄 PDF Abstract BibTeX arXiv:1412.5968

Code (0)

등록된 구현이 없습니다.

Tasks

Matrix Completion

Adaptive Multinomial Matrix Completion

2014-08-26 · Olga Klopp, Jean Lafond, Eric Moulines, Joseph Salmon

The task of estimating a matrix given a sample of observed entries is known as the \emph{matrix completion problem}. Most works on matrix completion have focused on recovering an unknown real-valued low-rank matrix from …

Matrix Completion Multi-class Classification Recommendation Systems

High Dimensional Statistical Estimation under Uniformly Dithered One-bit Quantization

2022-02-26 · Junren Chen, Cheng-Long Wang, Michael K. Ng, Di Wang

In this paper, we propose a uniformly dithered 1-bit quantization scheme for high-dimensional statistical estimation. The scheme contains truncation, dithering, and quantization as typical steps. As canonical examples, t…

compressed sensing Low-Rank Matrix Completion Matrix Completion Quantization+1

One-Bit Matrix Completion with Differential Privacy

2021-10-02 · Zhengpin Li, Zheng Wei, Zengfeng Huang, Xiaojun Mao 외

As a prevailing collaborative filtering method for recommendation systems, one-bit matrix completion requires data collected by users to provide personalized service. Due to insidious attacks and unexpected inference, th…

Collaborative Filtering Matrix Completion Privacy Preserving Recommendation Systems

Collaborative Automotive Radar Sensing via Mixed-Precision Distributed Array Completion

2024-03-13 · Arian Eamaz, Farhang Yeganegi, Yunqiao Hu, Mojtaba Soltanalian 외

This paper investigates the effects of coarse quantization with mixed precision on measurements obtained from sparse linear arrays, synthesized by a collaborative automotive radar sensing strategy. The mixed quantization…

Matrix Completion Quantization

Faster Matrix Completion Using Randomized SVD

2018-10-16 · Xu Feng, Wenjian Yu, Yaohang Li

Matrix completion is a widely used technique for image inpainting and personalized recommender system, etc. In this work, we focus on accelerating the matrix completion using faster randomized singular value decompositio…

CPU Image Inpainting Matrix Completion Recommendation Systems