arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2403.06547cs.DS
收藏

乐趣最大化搜索、(非)实例最优性与面向鹦鹉的电子游戏

Fun Maximizing Search, (Non) Instance Optimality, and Video Games for Parrots

Jérémy Barbay

AI总结:

该研究针对计算机化自适应测试(CAT)的算法优劣评判问题,扩展传统框架得到CAT算法偏序,分析一维领域新旧算法性能,证明现有算法均非实例最优,并推测CAT问题不存在实例最优解。

摘要:

计算机化自适应测试(CAT)通过适配考生水平来测量其能力。题目过多或难题过多都会令测试令人沮丧。是否存在可被证明在理论上更优的CAT算法,又该在何种框架下评判?我们表明,对传统框架稍作扩展便可得到CAT算法的偏序关系。针对一维知识领域,我们分析了若干新旧算法的理论性能,并证明所提出的算法均不具备实例最优性,同时推测CAT问题不存在实例最优解。

英文摘要:

Computerized Adaptive Testing (CAT) measures an examinee's ability while adapting to their level. Both too many questions and too many hard questions can make a test frustrating. Are there some CAT algorithms which can be proven to be theoretically better than others, and in which framework? We show that slightly extending the traditional framework yields a partial order on CAT algorithms. For uni-dimensional knowledge domains, we analyze the theoretical performance of some old and new algorithms, and we prove that none of the algorithms presented are instance optimal, conjecturing that no instance optimal can exist for the CAT problem.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑