Distribution-free tests such as the Wilcoxon rank sum test are popular for testing the equality of two univariate distributions. Among the important reasons for their popularity are the striking results of Hodges-Lehmann (1956) and Chernoff-Savage (1958), where the authors show that the asymptotic (Pitman) relative efficiency of Wilcoxon's test with respect to Student's $t$-test, under location-shift alternatives, never falls below $0.864$ (with the identity score) and $1$ (with the Gaussian score) respectively, despite the former being exactly distribution-free for all sample sizes. Motivated by these results, we propose and study a large family of exactly distribution-free multivariate rank-based two-sample tests by leveraging the theory of optimal transport. First, we propose distribution-free analogs of the Hotelling $T^2$ test (the natural multidimensional counterpart of Student's $t$-test) and show that they satisfy Hodges-Lehmann and Chernoff-Savage-type efficiency lower bounds over natural sub-families of multivariate distributions, despite being entirely agnostic to the underlying data generating mechanism -- making them the first multivariate, nonparametric, exactly distribution-free tests that provably achieve such efficiency lower bounds. As these tests are derived from Hotelling $T^2$, naturally they are not universally consistent (same as Wilcoxon's test). To overcome this, we propose exactly distribution-free versions of the celebrated kernel maximum mean discrepancy test and the energy test. These tests are indeed universally consistent under no moment assumptions, exactly distribution-free for all sample sizes, and have non-trivial Pitman efficiency. We believe this trifecta of properties hasn't yet been proven for any existing test in the literature.


翻译:无分配测试,如Wilcoxon等级和等级测试,对于测试两种非象牙等级分布的平等性来说是受欢迎的。其受欢迎的重要原因是Hodges-Lehmann(1956年)和Chernoff-Savage(1958年)的惊人结果。在这两次测试中,作者们展示了威尔科松测试对学生的无分配性(Pitman)相对效率,根据地点变换的替代方法,对于学生的美元测试来说,从不低于0.864美元(与身份分数相比)和1美元(与高斯分相比),尽管前者对所有抽样规模的分布完全无分配。受这些结果的激励,我们提议并研究一个完全无分配性多变种排名的等级测试。首先,我们建议对学生的美元2美元测试的属性进行无分配性模拟(我们学生的免费比值为$的自然多等值测试)测试, 并且显示他们满足了Hodge-Lehmann 和切尔-Shernest-cretarial-ral-real-ral-ral-stest estal estal est estalestal testation test test test test testation test testation testation testation testation testation testation test test tal tal tal testation testation testation testations test pralbalbal testations testation testation testation testation testation testation testation testation press pressation press pressation pressation pressation pressation pressation pressation pressations) press pressmental pressation pressation pressmental press press pressal pressation pressal pressation pressation pressation pressation pressal pressation pressation pressation pressmental tal tal tal pressation pressation press pressal press pressaldaldaldal pressal pral pral </s>

0
下载
关闭预览

相关内容

【2023新书】使用Python进行统计和数据可视化,554页pdf
专知会员服务
126+阅读 · 2023年1月29日
不可错过!《机器学习100讲》课程,UBC Mark Schmidt讲授
专知会员服务
73+阅读 · 2022年6月28日
Stabilizing Transformers for Reinforcement Learning
专知会员服务
58+阅读 · 2019年10月17日
强化学习三篇论文 避免遗忘等
CreateAMind
19+阅读 · 2019年5月24日
Hierarchically Structured Meta-learning
CreateAMind
26+阅读 · 2019年5月22日
Transferring Knowledge across Learning Processes
CreateAMind
27+阅读 · 2019年5月18日
强化学习的Unsupervised Meta-Learning
CreateAMind
17+阅读 · 2019年1月7日
无监督元学习表示学习
CreateAMind
27+阅读 · 2019年1月4日
Unsupervised Learning via Meta-Learning
CreateAMind
42+阅读 · 2019年1月3日
A Technical Overview of AI & ML in 2018 & Trends for 2019
待字闺中
16+阅读 · 2018年12月24日
【论文】变分推断(Variational inference)的总结
机器学习研究会
39+阅读 · 2017年11月16日
【推荐】RNN/LSTM时序预测
机器学习研究会
25+阅读 · 2017年9月8日
强化学习族谱
CreateAMind
26+阅读 · 2017年8月2日
国家自然科学基金
0+阅读 · 2015年12月31日
国家自然科学基金
0+阅读 · 2014年12月31日
国家自然科学基金
1+阅读 · 2012年12月31日
国家自然科学基金
0+阅读 · 2012年12月31日
国家自然科学基金
0+阅读 · 2012年12月31日
国家自然科学基金
0+阅读 · 2012年12月31日
国家自然科学基金
0+阅读 · 2012年12月31日
国家自然科学基金
0+阅读 · 2009年12月31日
国家自然科学基金
0+阅读 · 2009年12月31日
国家自然科学基金
0+阅读 · 2008年12月31日
VIP会员
相关资讯
强化学习三篇论文 避免遗忘等
CreateAMind
19+阅读 · 2019年5月24日
Hierarchically Structured Meta-learning
CreateAMind
26+阅读 · 2019年5月22日
Transferring Knowledge across Learning Processes
CreateAMind
27+阅读 · 2019年5月18日
强化学习的Unsupervised Meta-Learning
CreateAMind
17+阅读 · 2019年1月7日
无监督元学习表示学习
CreateAMind
27+阅读 · 2019年1月4日
Unsupervised Learning via Meta-Learning
CreateAMind
42+阅读 · 2019年1月3日
A Technical Overview of AI & ML in 2018 & Trends for 2019
待字闺中
16+阅读 · 2018年12月24日
【论文】变分推断(Variational inference)的总结
机器学习研究会
39+阅读 · 2017年11月16日
【推荐】RNN/LSTM时序预测
机器学习研究会
25+阅读 · 2017年9月8日
强化学习族谱
CreateAMind
26+阅读 · 2017年8月2日
相关基金
国家自然科学基金
0+阅读 · 2015年12月31日
国家自然科学基金
0+阅读 · 2014年12月31日
国家自然科学基金
1+阅读 · 2012年12月31日
国家自然科学基金
0+阅读 · 2012年12月31日
国家自然科学基金
0+阅读 · 2012年12月31日
国家自然科学基金
0+阅读 · 2012年12月31日
国家自然科学基金
0+阅读 · 2012年12月31日
国家自然科学基金
0+阅读 · 2009年12月31日
国家自然科学基金
0+阅读 · 2009年12月31日
国家自然科学基金
0+阅读 · 2008年12月31日
Top
微信扫码咨询专知VIP会员