The average sensitivity of an intersection of half spaces
The average sensitivity of an intersection of half spaces
复制标题
半空间交集的平均灵敏度
DOI：
10.1145/2591796.2591798
复制
发表时间：
2013
影响因子：
1.2
通讯作者：
D. Kane
中科院分区：
文献类型：
--
作者：
D. Kane
AbstractWe证明了K半空间相交的指标函数的平均灵敏度的新界限。特别是，我们证明了Onlog（k）的最佳界限。这概括了纳扎罗夫（Nazarov）的结果。此外，我们的结果对学习Halfspaces的交叉点所需的运行时间有影响。 52C45
AbstractWe prove new bounds on the average sensitivity of the indicator function of an intersection of k halfspaces. In particular, we prove the optimal bound of Onlog(k). This generalizes a result of Nazarov, who proved the analogous result in the Gaussian case, and improves upon a result of Harsha, Klivans and Meka. Furthermore, our result has implications for the runtime required to learn intersections of halfspaces.AMS Subject ClassificationPrimary; 52C45