A Decision-Theoretic Approach to Model Choice

Q1 Decision Sciences
Markku Karhunen
{"title":"A Decision-Theoretic Approach to Model Choice","authors":"Markku Karhunen","doi":"10.1007/s40745-025-00589-w","DOIUrl":null,"url":null,"abstract":"<div><p>Model choice algorithms are usually compared based on their accuracy, i.e. ability to find true models. However, conservative algorithms (such as BIC minimisation) are accurate when no true effects exist, while more liberal algorithms (such as Lasso) are accurate when there are plenty of true effects. There is ambiguity, then, regarding the correct algorithm. The purpose of this paper is to show how expected utility maximisation and Monte Carlo simulations can be used to compare model choice algorithms. Two loss functions are derived from the expected utility function of the researcher. Both loss functions turn out to be linear combinations of specificity and one or two kinds of sensitivity which are discussed in this paper. Subsequently, this paper experiments with four parametrisations of these loss functions, and then uses these parametrised versions to compare nine algorithms within the contexts of both logistic and Gaussian regression. The results demonstrate that researchers who avoid false positives should either use BIC or BICc for model choice or report nothing at all. AIC does not seem to be the optimal method for the range of parameters covered in this study.</p></div>","PeriodicalId":36280,"journal":{"name":"Annals of Data Science","volume":"13 1","pages":"29 - 39"},"PeriodicalIF":0.0000,"publicationDate":"2025-02-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s40745-025-00589-w.pdf","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Annals of Data Science","FirstCategoryId":"1085","ListUrlMain":"https://link.springer.com/article/10.1007/s40745-025-00589-w","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"Decision Sciences","Score":null,"Total":0}
引用次数: 0

Abstract

Model choice algorithms are usually compared based on their accuracy, i.e. ability to find true models. However, conservative algorithms (such as BIC minimisation) are accurate when no true effects exist, while more liberal algorithms (such as Lasso) are accurate when there are plenty of true effects. There is ambiguity, then, regarding the correct algorithm. The purpose of this paper is to show how expected utility maximisation and Monte Carlo simulations can be used to compare model choice algorithms. Two loss functions are derived from the expected utility function of the researcher. Both loss functions turn out to be linear combinations of specificity and one or two kinds of sensitivity which are discussed in this paper. Subsequently, this paper experiments with four parametrisations of these loss functions, and then uses these parametrised versions to compare nine algorithms within the contexts of both logistic and Gaussian regression. The results demonstrate that researchers who avoid false positives should either use BIC or BICc for model choice or report nothing at all. AIC does not seem to be the optimal method for the range of parameters covered in this study.

模型选择的决策理论方法
模型选择算法通常根据其准确性进行比较,即找到真实模型的能力。然而,保守算法(如BIC最小化)在没有真实效果时是准确的,而更自由的算法(如Lasso)在有大量真实效果时是准确的。因此,关于正确的算法存在歧义。本文的目的是展示如何使用期望效用最大化和蒙特卡罗模拟来比较模型选择算法。由研究者的期望效用函数推导出两个损失函数。这两种损失函数都是特异性和一种或两种灵敏度的线性组合,本文对此进行了讨论。随后,本文对这些损失函数进行了四种参数化实验,然后使用这些参数化版本在逻辑回归和高斯回归的背景下比较了九种算法。结果表明,避免误报的研究人员应该要么使用BIC或BICc进行模型选择,要么什么都不报告。AIC似乎不是本研究所涵盖的参数范围的最佳方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Annals of Data Science
Annals of Data Science Decision Sciences-Statistics, Probability and Uncertainty
CiteScore
6.50
自引率
0.00%
发文量
93
期刊介绍: Annals of Data Science (ADS) publishes cutting-edge research findings, experimental results and case studies of data science. Although Data Science is regarded as an interdisciplinary field of using mathematics, statistics, databases, data mining, high-performance computing, knowledge management and virtualization to discover knowledge from Big Data, it should have its own scientific contents, such as axioms, laws and rules, which are fundamentally important for experts in different fields to explore their own interests from Big Data. ADS encourages contributors to address such challenging problems at this exchange platform. At present, how to discover knowledge from heterogeneous data under Big Data environment needs to be addressed.     ADS is a series of volumes edited by either the editorial office or guest editors. Guest editors will be responsible for call-for-papers and the review process for high-quality contributions in their volumes.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书