Claims

Feature-based models (LLM-extracted features plus metadata in random forest and gradient boosting) outperform direct LLM estimation, dummy regressor, TF-IDF, and metadata-only benchmarks, with correlations up to r = .87

Claim · All claims
Evidence · 1 study (2 entries) · associational r2 · q2 · i3 large
Currency · newest study 2026 · checked against its sources 2026-10-20 (automated, 2 of 2 entries) · not reviewed by a person · recheck by 2029: tool and model accuracy changes quickly

Subclaims

Reading the evidence codes

q is the design tier, i the impact, n the sample, and the kind with its r the rigour judged within that kind: what each code means.

This claim: no standardized effect is recorded in observations/ for it yet, so no benchmark reading is possible.

q2 i3 For math, the feature-based random forest (RMSE = 0.83, MAE = 0.64; r = .87) beat the direct approach and all benchmarks; GBM was strongest overall, cutting RMSE 18.5% versus the dummy regressor on average. → Razavi 2026 q2 i3 For reading, the feature-based random forest (RMSE = 0.72, MAE = 0.58; r = .87) outperformed the direct approach and all benchmarks, reducing RMSE 31.6% versus the dummy regressor on average. → Razavi 2026 (2)

Evidence

Razavi 2026

Razavi, P., & Powers, S. (2026). Estimating item difficulty using large language models and tree-based machine learning algorithms. International Journal of Artificial Intelligence in Education, 36, 100015. https://doi.org/10.1016/j.ijaied.2026.100015

q2 · i3 · associational · r2

Holdout evaluation of the math random forest on LLM-extracted features plus metadata; predicted estimates correlated r = .87 with true difficulties. The GBM performed similarly (RMSE = 0.81, MAE = 0.63, r = .87), and "the gradient boosting model emerges as the strongest performer".

"produced an RMSE of 0.83 and MAE of 0.64, showing that the model’s predictions are more accurate than the ones from the previous approach (i.e., direct LLM estimation: RMSE = 0.91, MAE = 0.72)"

Razavi 2026 (2)

Razavi, P., & Powers, S. (2026). Estimating item difficulty using large language models and tree-based machine learning algorithms. International Journal of Artificial Intelligence in Education, 36, 100015. https://doi.org/10.1016/j.ijaied.2026.100015

q2 · i3 · design · r2

Reading holdout results: the random forest beat the direct approach, dummy regressor, TF-IDF + RF (RMSE = 1.09), and metadata-only RF (RMSE = 0.87), with r = .87. "Compared to the dummy regressor, the random forest reduced RMSE by 31.6% on average".

"produced an RMSE of 0.72 and MAE of 0.58, showing that the model outperforms the direct LLM estimation approach (RMSE = 0.86, MAE = 0.69), the dummy regressor benchmarks (RMSE = 1.04, MAE = 0.84)"

Discussion

Page metadata
Field Value
type claim
id feature-based-llm-models-outperform-direct-estimation-and-benchmarks
title Feature-based models (LLM-extracted features plus metadata in random forest and gradient boosting) outperform direct LLM estimation, dummy regressor, TF-IDF, and metadata-only benchmarks, with correlations up to r = .87
description Feature-based models (LLM-extracted features plus metadata in random forest and gradient boosting) outperform direct LLM estimation, dummy regressor, TF-IDF, and metadata-only benchmarks, with correlations up to r = .87
status review
evidence_strength moderate
newest_evidence 2026
source_checked 2026-10-20
recheck_by 2029
generated by process:wiki-ingest on 2026-10-12
trust unverified — no one has confirmed this page's content
sources 2 — razavi-2026, razavi-2026-2

Frontmatter is the page's machine-readable record — see the Schema & Guide.