mlsanityData to 14 Oct 2026

Federated Item Response Models: A Gradient-driven Privacy-preserving Framework for Distributed Psychometric Estimation

arXiv 2506.21744 ↗First posted 26 Jun 2025cs.LG stat.AP stat.MLcited by 0

Not on the map. Why?

Abstract (arXiv)

Item Response Theory (IRT) models are widely used to estimate respondents' latent abilities and calibrate item difficulty. Traditional IRT estimation typically requires centralizing all raw responses, raising privacy and governance concerns. We introduce Federated Item Response Theory (FedIRT), a framework that enables distributed calibration of standard IRT models without transferring individual-level data, thereby preserving confidentiality while retaining statistical efficiency. To provide formal protection, we further develop FedIRT-DP, a user-level differentially private extension. Each site computes per-student gradients, clips them to a fixed norm, and shares only masked sums; the server adds calibrated Gaussian noise and performs MAP updates. This yields an auditable (varepsilon,δ) guarantee at the student level and a single, tunable privacy-utility trade-off via the clipping bound and noise scale. The same mechanism improves robustness to extreme response rows (e.g., all-zeros/ones). Across simulations, FedIRT matches the accuracy of centralized estimators from popular textttR packages while avoiding data pooling; FedIRT-DP achieves comparable accuracy under stronger privacy and exhibits superior robustness to contamination. An empirical study on a real exam dataset demonstrates practical viability and consistent item and site-effect estimates. To facilitate adoption, we release an open-source textttR package, textttFedIRT, implementing the two-parameter logistic (2PL) and partial credit models (PCM) with federated and differentially private training.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 12 of its 44 references that are in the map. First posted on arXiv 26 Jun 2025.

Builds on

12 of 44 references.

References · 12

  1. 2014Adam: A Method for Stochastic Optimizationcited by 37,240
  2. 2016Communication-Efficient Learning of Deep Networks from Decentralized Datacited by 7,669
  3. 2019Advances and Open Problems in Federated Learningcited by 3,046
  4. 2019Federated Learning: Challenges, Methods, and Future Directionscited by 1,538
  5. 2016Federated Learning: Strategies for Improving Communication Efficiencycited by 1,475
  6. 2019On the Convergence of FedAvg on Non-IID Datacited by 1,229
  7. 2017Renyi Differential Privacycited by 650
  8. 2020A Systematic Literature Review on Federated Learning: From A Model Quality Perspectivecited by 15
  9. 2020A Deep Learning Algorithm for High-Dimensional Exploratory Item Factor Analysiscited by 5
  10. 2021Federated Learning Algorithms for Generalized Mixed-effects Model (GLMM) on Horizontally Partitioned Data from Distributed Sourcescited by 4
  11. 2023Optimal and Private Learning from Human Response Datacited by 2
  12. 2025Generative Adversarial Networks for High-Dimensional Item Factor Analysis: A Deep Adversarial Learning Algorithmcited by 1

Built on by

Not cited yet.