论文检索

再随机化的贝叶斯准则AI 解读

Rerandomization is a powerful tool for experiment-based causal inference because it can better balance covariates than classic randomized designs, thereby leading to more accurate causal effect estimation. However, basic rerandomization and some of its extensions do not prioritize covariates that believed to be strongly associated with potential outcomes. To address this limitation, and thereby create more efficient rerandomization procedures, the quantification of covariate…

用于排序聚合的分组–Mallows 模型及其推断AI 解读

Learning how to aggregate ranking lists has been an active research area for many years and its advances have played a vital role in many applications ranging from bioinformatics to internet commerce. The problem of discerning reliability of rankers based only on the rank data is of great interest to many practitioners, but has received less attention from researchers. By dividing the ranked entities into two disjoint groups, that is, relevant and irrelevant/background ones,…

序贯蒙特卡洛的分层与最优重采样AI 解读

Summary Sequential Monte Carlo algorithms are widely accepted as powerful computational tools for making inference with dynamical systems. A key step in sequential Monte Carlo is resampling, which plays the role of steering the algorithm towards the future dynamics. Several strategies have been used in practice, including multinomial resampling, residual resampling, optimal resampling, stratified resampling and optimal transport resampling. In one-dimensional cases, we show…

基于排序数据的贝叶斯聚合AI 解读

Rank aggregation, that is, combining several ranking functions (called base rankers) to get aggregated, usually stronger rankings of a given set of items, is encountered in many disciplines. Most methods in the literature assume that base rankers of interest are equally reliable. It is very common in practice, however, that some rankers are more informative and reliable than others. It is desirable to distinguish high quality base rankers from low quality ones and treat them…

通过主题字典模型发现关联模式AI 解读

Summary Discovering patterns from a set of text or, more generally, categorical data is an important problem in many disciplines such as biomedical research, linguistics, artificial intelligence and sociology. We consider here the well-known ‘market basket’ problem that is often discussed in the data mining community, and is also quite ubiquitous in biomedical research. The data under consideration are a set of ‘baskets’, where each basket contains a list of ‘items’. Our…