通过模拟退火构建离散选择实验的贝叶斯最优设计
Constructing Bayesian Optimal Designs for Discrete Choice Experiments by Simulated Annealing
AI总结:
本文首次将模拟退火算法应用于离散选择实验的贝叶斯最优设计,通过接受优劣解避免过早收敛,在统计效率上优于坐标交换算法,尤其适用于先验信息高度不确定的场景。
摘要:
离散选择实验(DCEs)研究影响个体在多种选项中进行选择时偏好的属性。为了提高估计选择模型的质量,研究者倾向于采用利用属性偏好的现有信息的贝叶斯最优设计。鉴于选择模型的非线性特性,构建合适的设计需要高效的算法。其中,坐标交换(CE)算法通常用于基于MNL模型构建设计。然而,作为一种爬山方法,CE算法往往迅速收敛到局部最优,可能限制最终设计的质量。我们提出使用模拟退火(SA)算法来构建贝叶斯最优设计。该算法同时接受优劣解,避免过早收敛,从而更彻底地探索潜在解空间。因此,与CE算法相比,它最终能获得更高质量的选择设计。我们的工作是首次将SA算法应用于构建DCEs的贝叶斯最优设计。通过大量计算实验,我们证明SA设计在统计效率上通常优于CE设计,尤其是在先验偏好信息高度不确定的情况下。
英文摘要:
Discrete choice experiments (DCEs) investigate the attributes that influence individuals' choices when selecting among various options. To enhance the quality of the estimated choice models, researchers opt for Bayesian optimal designs that utilize existing information about the attributes' preferences. Given the nonlinear nature of choice models, the construction of an appropriate design requires efficient algorithms. Among these, the coordinate-exchange (CE) algorithm is commonly employed for constructing designs based on the MNL model. However, as a hill-climbing method, the CE algorithm tends to quickly converge to local optima, potentially limiting the quality of the resulting designs. We propose the use of a simulated annealing (SA) algorithm to construct Bayesian optimal designs. This algorithm accepts both superior and inferior solutions, avoiding premature convergence and allowing a more thorough exploration of potential solutions. Consequently, it ultimately obtains higher-quality choice designs compared to the CE algorithm. Our work represents the first application of an SA algorithm in constructing Bayesian optimal designs for DCEs. Through extensive computational experiments, we demonstrate that the SA designs generally outperform the CE designs in terms of statistical efficiency, especially when the prior preference information is highly uncertain.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。