论文检索

通信约束下最优高维与非参数分布式检验AI 解读

We derive minimax testing errors in a distributed framework where the data is split over multiple machines and their communication to a central machine is limited to b bits. We investigate both the d- and infinite-dimensional signal detection problem under Gaussian white noise. We also derive distributed testing algorithms reaching the theoretical lower bounds. Our results show that distributed testing is subject to fundamentally different phenomena that are not observed in…

更正说明：多元回归函数最大值位置与大小的最优两阶段估计AI 解读

In the paper of Belitser, Ghosal and van Zanten (Ann. Statist. 40 (2012) 2850-2876), on page 2851 it is stated that “the minimax rate for estimating the maximum value of the function ranging over an α-smooth nonparametric class (e.g., isotropic Hölder class defined below) is n−α/(2α+d)” (the rate n−α/(2α+d) is also mentioned in abstract, on pp. 2553 and 2859). This is not correct: instead of “n−α/(2α+d)” one should read “n−α/(2α+d) up to a log factor.” Recall the model Yk =…

通信约束下的自适应分布式方法AI 解读

We study estimation methods under communication constraints in a distributed version of the nonparametric random design regression model. We derive minimax lower bounds and exhibit methods that attain those bounds. Moreover, we show that adaptive estimation is possible in this setting.

估计多元回归函数最大值位置与大小的最优两阶段程序AI 解读

We propose a two-stage procedure for estimating the location $\mathbf{\mu}$ and size $M$ of the maximum of a smooth $d$-variate regression function $f$. In the first stage, a preliminary estimator of $\mathbf{\mu}$ obtained from a standard nonparametric smoothing method is used. At the second stage, we “zoom-in” near the vicinity of the preliminary estimator and make further observations at some design points in that vicinity. We fit an appropriate polynomial regression…