arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2306.01253stat.MLcs.LG
收藏

超越不可约性的混合比例估计

Mixture Proportion Estimation Beyond Irreducibility

University of Michigan(密歇根大学);Penn State University(宾夕法尼亚州立大学);Air Force Institute of Technology(空军理工学院);Cedarville University(锡达维尔大学)

Yilun Zhu, Aaron Fjeldsted, Darren Holland, George Landon, Azaree Lintereur, Clayton Scott

AI总结:

针对混合比例估计中不可约性假设的限制,本文提出更一般的充分条件,并设计基于重采样的元算法,使现有MPE方法能适用于更广泛场景且提升估计性能。

摘要:

混合比例估计(MPE)的任务是在给定分量分布和混合分布的观测样本时,估计混合分布中某分量分布的权重。以往的MPE研究采用不可约性假设,以确保混合比例的可识别性。本文提出了一种更一般的充分条件,可适用于不可约性不成立的若干场景。我们进一步提出了一种基于重采样的元算法,能将任何在不可约性下设计的现有MPE算法改造为适用于我们更一般条件的算法。实验表明,相比基线方法和近期提出的基于重组的算法,我们的方法展现出更优的估计性能。

英文摘要:

The task of mixture proportion estimation (MPE) is to estimate the weight of a component distribution in a mixture, given observations from both the component and mixture. Previous work on MPE adopts the irreducibility assumption, which ensures identifiablity of the mixture proportion. In this paper, we propose a more general sufficient condition that accommodates several settings of interest where irreducibility does not hold. We further present a resampling-based meta-algorithm that takes any existing MPE algorithm designed to work under irreducibility and adapts it to work under our more general condition. Our approach empirically exhibits improved estimation performance relative to baseline methods and to a recently proposed regrouping-based algorithm.

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

↑