【24h】

Learning Minimum Volume Sets

机译:学习最小卷集

获取原文

摘要

Given a probability measure P and a reference measure μ, one is often interested in the minimum μ-measure set with P-measure at least α. Minimum volume sets of this type summarize the regions of greatest probability mass of P, and are useful for detecting anomalies and constructing confidence regions. This paper addresses the problem of estimating minimum volume sets based on independent samples distributed according to P. Other than these samples, no other information is available regarding P, but the reference measure μ is assumed to be known. We introduce rules for estimating minimum volume sets that parallel the empirical risk minimization and structural risk minimization principles in classification. As in classification, we show that the performances of our estimators are controlled by the rate of uniform convergence of empirical to true probabilities over the class from which the estimator is drawn. Thus we obtain finite sample size performance bounds in terms of VC dimension and related quantities. We also demonstrate strong universal consistency and an oracle inequality. Estimators based on histograms and dyadic partitions illustrate the proposed rules.
机译:给定概率测量P和参考度量μ,一个人通常对至少α的最小μ度量测量感兴趣。这种类型的最小体积集总结了P的最大概率质量的区域,并且可用于检测异常和构建置信区。本文解决了基于根据P.除了这些样本之外的独立样本估计最小体积集的问题,没有其他信息,关于P没有提供其他信息,但假设参考测量μ是已知的。我们介绍了估算最小体积集的规则,该规则并行对分类中的经验风险最小化和结构风险最小化原则并行。与分类一样,我们表明,我们的估算器的性能由绘制估计器的类的统一对真实概率的统一收敛性的控制来控制。因此,我们在VC维度和相关数量方面获得有限的样本大小性能界限。我们还展示了强大的普遍一致性和甲骨文不平等。基于直方图和二元分区的估算器说明了所提出的规则。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号