paper-with-me

홈 › Papers

Introducing Flexible Monotone Multiple Choice Item Response Theory Models and Bit Scales

2024-10-02 · Joakim Wallmark, Maria Josefsson, Marie Wiberg

Item Response Theory (IRT) is a powerful statistical approach for evaluating test items and determining test taker abilities through response analysis. An IRT model that better fits the data leads to more accurate latent trait estimates. In this study, we present a new model for multiple choice data, the monotone multiple choice (MMC) model, which we fit using autoencoders. Using both simulated scenarios and real data from the Swedish Scholastic Aptitude Test, we demonstrate empirically that the MMC model outperforms the traditional nominal response IRT model in terms of fit. Furthermore, we illustrate how the latent trait scale from any fitted IRT model can be transformed into a ratio scale, aiding in score interpretation and making it easier to compare different types of IRT models. We refer to these new scales as bit scales. Bit scales are especially useful for models for which minimal or no assumptions are made for the latent trait scale distributions, such as for the autoencoder fitted models in this study.

📄 PDF Abstract BibTeX arXiv:2410.01480

Code (1)

joakimwallmark/mmc-bit-sim 공식 구현

Tasks

Multiple-choice

Similar Papers 제목 키워드 기반

Non-monotone Sequential Submodular Maximization

2023-08-16 · Shaojie Tang, Jing Yuan

In this paper, we study a fundamental problem in submodular optimization, which is called sequential submodular maximization. Specifically, we aim to select and rank a group of $k$ items from a ground set $V$ such that t…

Assortment OptimizationDiversityRecommendation Systems

Learning with Monotone Adversarial Corruptions

2026-01-05 · Kasper Green Larsen, Chirag Pabbaraju, Abhishek Shetty arxiv

We study the extent to which standard machine learning algorithms rely on exchangeability and independence of data by introducing a monotone adversarial corruption model. In this model, an adversary, upon looking at a "c…

Binary Classification

Deciding Monotone Duality and Identifying Frequent Itemsets in Quadratic Logspace

2012-12-09 · Georg Gottlob

The monotone duality problem is defined as follows: Given two monotone formulas f and g in iredundant DNF, decide whether f and g are dual. This problem is the same as duality testing for hypergraphs, that is, checking w…

Problem Decomposition

Beyond Pointwise Submodularity: Non-Monotone Adaptive Submodular Maximization subject to Knapsack and $k$-System Constraints

2021-04-10 · Shaojie Tang

In this paper, we study the non-monotone adaptive submodular maximization problem subject to a knapsack and a $k$-system constraints. The input of our problem is a set of items, where each item has a particular state dra…

2k

Efficient Detection of Bad Benchmark Items with Novel Scalability Coefficients

2026-03-26 · Michael Hardy, Joshua Gilbert, Benjamin Domingue arxiv

The validity of assessments, from large-scale AI benchmarks to human classrooms, depends on the quality of individual items, yet modern evaluation instruments often contain thousands of items with minimal psychometric ve…