论文检索

利用贝叶斯 WAND 模型揭示排序数据的子群结构AI 解读

Ranked data arise in many areas of application ranging from the ranking of up-regulated genes for cancer to the ranking of academic statistics journals. Complications can arise when rankers do not report a full ranking of all entities; for example, they might only report their top-M ranked entities after seeing some or all entities. It can also be useful to know whether rankers are equally informative, and whether some entities are effectively judged to be exchangeable.…

最优探索的一类贝叶斯模型AI 解读

SUMMARY Each of several locations contains an unknown number of objects of value. A single search of a location will discover some of these objects which are then removed. Discoveries yield rewards. A ‘distribution of effort’ problem is posed concerning how to explore the locations optimally—i.e. to maximize the expected return from discoveries made. This is formulated as a Bayes sequential decision problem for which index policies are optimal. A natural simple case is one…

摘要暂缺

二元响应筛查的稳健设计AI 解读

Optimal screening procedures are derived using Bayesian decision theory. A simple heuristic solution is determined using an asymptotic posterior distribution for the parameters in a linear probit model. The solution is shown to be optimal within a class of possible procedures and robust to departures from model assumptions.

正态模型中的筛选AI 解读

SUMMARY An individual is deemed ‘successful’ if the value of a certain measurement of interest Y lies in some given specification region. In situations in which Y is difficult to measure, the individuals may be screened using a correlated variable X which is easier to measure. The motivation behind screening is to try to increase the proportion of 'successes' by eliminating those individuals who are unlikely to be successful. Most approaches, except for very large sample…