Source-linked AI summary

Quantum Sparse Autoencoders for Q-Matrix Estimation in Cognitive Diagnosis

Arif Hassan Zidan, Yi Pan, Bowen Guo, Xiang Li, Yu Bao, Yingfeng Wang, Tianming Liu, Wei Zhang

arXiv:2609.01537v1cs.LG

TL;DR

Q-matrix estimation is difficult when skills are correlated and real responses depart from idealized assumptions. The paper introduces a quantum sparse autoencoder and compares it with a classical autoencoder across simulated and real assessments. The models show complementary strengths: CAE is often more accurate in matched simulations, while QSAE is more stable and stronger on real datasets.

  • Problem

    Q-matrix recovery is challenging when assessments contain correlated skills and response data depart from idealized generative assumptions.

  • Method

    QSAE embeds binary student responses into a quantum circuit, compresses them into a sparse latent representation, and maps that representation to the Q-matrix.

  • Results

    QSAE has lower standard deviations in 49 of 60 simulated conditions and outperforms CAE on 6 of 9 real assessment datasets, while CAE generally has higher accuracy in well-specified simulations.

  • Takeaways & Limitations

    The QSAE’s principal value is robustness to sampling variability and complex real-world assessment structure rather than universal performance gains.

  • Takeaways & Limitations

    The DINA model is used only to generate controlled simulation data and provide a known ground-truth Q-matrix for evaluation.

Abstract

from arXiv · show

Q-matrices play a central role in cognitive diagnosis within educational data mining (EDM), specifying which latent skills each assessment item requires. Data-driven Q-matrix estimation remains challenging when assessments involve many correlated skills and when real response patterns depart from idealized generative assumptions. We introduce a novel quantum sparse autoencoder (QSAE) for Q-matrix estimation, which, to the best of our knowledge, is the first application of quantum machine learning (QML) to cognitive diagnosis. Overall, the QSAE embeds each student's binary response vector into a quantum circuit using an encoder, compresses it into a sparse latent representation, and maps that representation to the Q-matrix. We benchmark the QSAE against a classical autoencoder (CAE) across 60 simulated datasets and 9 real-world assessment datasets. The results reveal complementary strengths. Although the CAE partially achieves higher average accuracy under several simulation conditions, the QSAE is substantially more stable across replications, exhibiting lower variance in 49 of the 60 conditions. Moreover, on real assessment data, the QSAE outperforms the CAE on 6 of the 9 datasets. These findings suggest that the principal advancement of QML in this setting is not universal accuracy improvement, but enhanced robustness and capability to explore latent-structure complexity in real datasets.

Introduction

Q-matrix estimation is important but difficult because manual specifications are costly and subjective, while data-driven recovery must handle unobserved, correlated skills and departures from idealized assumptions. The paper introduces QSAE and benchmarks it against CAE to assess when quantum or classical representation learning is advantageous.

  • Motivation: Manual Q-matrix specification is costly, labor-intensive, and potentially subjective, motivating accurate data-driven estimation.TIMSS mathematics coders agreed on approximately 89% of Q-matrix entries.
  • Motivation: Data-driven recovery is difficult because the search space grows exponentially, attributes are unobserved up to permutation, datasets are modest, and skills may be correlated.
  • Approach: The QSAE embeds binary student responses into an eight-qubit circuit, compresses them into a K-dimensional sparse latent representation, and recovers the Q-matrix.Sparsity is intended to retain informative latent features while suppressing noise and spurious variation.
  • Evaluation: The benchmark compares QSAE with CAE across 60 simulated DINA conditions and 9 real assessment datasets using Q-matrix recovery metrics.
  • Findings: CAE performs better under well-specified simulations, whereas QSAE is more stable across replications and stronger across real datasets.The QSAE has lower standard deviations in 49 of 60 simulated conditions and outperforms CAE on 6 of 9 real datasets.
  • Contribution: The paper presents the first QSAE-based approach to Q-matrix recovery and the first use of quantum representation learning for cognitive diagnosis.

Related Work

Prior Q-matrix recovery methods are largely classical and often depend on alignment between assumed structure and observed data. This work extends quantum autoencoder representation learning to cognitive diagnosis and investigates its behavior under both matched and mismatched structural conditions.

  • Classical recovery: Earlier Q-matrix recovery methods include likelihood-based estimation and Bayesian MCMC approaches.
  • Classical recovery: Representation-learning methods such as RBMs and sparse or constraint-based autoencoders have been applied to recover item–skill relationships.
  • Motivation: Existing approaches are strongest when their assumed model structure matches the data-generating process, motivating a quantum counterpart tested under matched and mismatched conditions.
  • Quantum representation learning: Quantum autoencoders compress quantum data into smaller latent registers while disentangling complementary trash qubits into a fixed reference state.
  • Research gap: Before this study, quantum models in educational data targeted predictive tasks rather than psychometric measurement, and no prior work applied them to Q-matrix estimation.

Preliminaries

Cognitive diagnosis uses observed response patterns to recover latent item–skill structure. The response matrix is observed, whereas the Q-matrix encodes the dependencies needed for diagnostic inference and is estimated from responses alone.

  • Task formulation: Q-matrix estimation is an unsupervised latent-structure recovery problem based on observed response data.
  • Response matrix: The response matrix R is a binary N×J matrix whose rows contain students’ response patterns across assessment items.Rij equals 1 for a correct response and 0 otherwise.
  • Q-matrix: The Q-matrix Q is a binary J×K matrix encoding which of K latent skills each assessment item requires.qjk equals 1 when item j requires skill k and 0 otherwise.
  • Q-matrix: Q functions like a sparse loading or mixing matrix linking observed items to latent factors, so accurate specification is essential for valid diagnostic inference.
  • Data-generating model: DINA simulations impose a conjunctive skill–response relationship with guessing and slipping, but neither model receives the true Q-matrix.DINA supplies controlled data and ground truth only for evaluation.
  • Task formulation: Given only R, the task is to recover an estimate of the underlying Q-matrix from response patterns.

Methodology

The QSAE and CAE estimate Q-matrices from the same binary response matrix but learn latent skill structure differently. QSAE compresses quantum-encoded responses into latent codes, then uses sparse per-item recovery and common evaluation alignment.

  • Shared setup: Both estimators input the binary response matrix and produce Q-matrix estimates evaluated against a reference after column alignment.The Hungarian algorithm resolves latent-skill permutation before scoring.
  • QSAE pipeline: The QSAE embeds responses as rotation angles, then uses a parameterized quantum autoencoder to concentrate reconstructive information in a latent register.Trash qubits are driven toward |0⟩ to enforce compression.
  • QSAE pipeline: The QSAE produces a K-dimensional latent readout whose columns serve as data-driven skill surrogates for subsequent Q-matrix recovery.The latent matrix Z is shared across the item-level recovery problems.
  • Q-matrix recovery: For each item, L1-penalized regression selects latent skills associated with that item, and coefficient magnitudes are thresholded into binary Q-matrix entries.The L1 penalty drives irrelevant coefficients toward zero, matching the sparse structure expected of Q-matrices.
  • Classical baseline: The CAE reconstructs responses with a sparse tied weight matrix, whose item–skill weights are thresholded to obtain the Q-matrix.The CAE uses a fixed threshold of |Wjk| ≥0.1 in the overview pipeline.
  • Evaluation: Evaluation reports OE, OTP, and OTN after Hungarian alignment, keeping overall disagreement, missed skills, and spurious skills visible.Lower values are better for all three error rates.

Results

Across simulated and real assessments, the QSAE and CAE show complementary strengths: the CAE is more accurate under matched DINA simulations, while the QSAE becomes more competitive as skills correlate or scale and is substantially more stable. On real datasets, the QSAE achieves lower average errors and wins on most assessments.

  • Overall simulated accuracy: Across 60 DINA conditions, the CAE achieves lower overall error than the QSAE, 0.133 versus 0.235.The simulated benchmark crosses skill number, sample size, correlation, and noise conditions.
  • Scaling with skill number: 0.280 to 0.216: QSAE error decreases as skills increase from K = 5 to K = 25, while CAE error remains roughly between 0.10 and 0.15.The quantum–classical gap narrows from 0.18 at K = 5 to 0.09 at K = 25.
  • Robustness to skill correlation: 0.091 to 0.192: CAE overall error more than doubles as skill correlation rises from ρ = 0 to ρ = 0.75, while QSAE error remains near 0.235.Under strong correlation, the methods are closer, with errors of 0.192 and 0.235.
  • Replication stability: 49 of 60 conditions: QSAE replication standard deviation is lower for OE, averaging 0.007 versus 0.013 for the CAE.The same stability pattern holds for OTN in 54/60 conditions and OTP in 42/60.
  • Real-assessment performance: Across 9 real assessments, QSAE mean error is lower for OE, 0.337 versus 0.348, and QSAE outperforms CAE on 6/9 datasets for OE.QSAE also has lower mean OTP, 0.272 versus 0.283, and OTN, 0.358 versus 0.391.
  • When each approach wins: The CAE is strongest on clean, independent-skill, model-matched data, whereas the QSAE overtakes it in every aggregate metric and two-thirds of individual datasets.The comparison identifies robustness as the QSAE’s main advantage in realistic settings.

Conclusion

The QSAE and CAE show complementary strengths: the QSAE is more stable across simulated conditions and performs better across many real-world assessments, rather than delivering universal gains.

  • The QSAE produces lower standard deviations than the CAE in 49 of 60 simulated DINA conditions.
  • Figure 5 compares OE, OTP, and OTN recovery-error distributions for CAE and QSAE across the 9 real assessment datasets, with lower errors preferred.
  • On 9 real-world assessment datasets, the QSAE outperforms the CAE on 6 datasets.
Loading 2609.01537v1…