Testing Halfspaces over Rotation-Invariant Distributions
From MaRDI portal
Abstract: We present an algorithm for testing halfspaces over arbitrary, unknown rotation-invariant distributions. Using random examples of an unknown function , the algorithm determines with high probability whether is of the form or is -far from all such functions. This sample size is significantly smaller than the well-known requirement of samples for learning halfspaces, and known lower bounds imply that our sample size is optimal (in its dependence on ) up to logarithmic factors. The algorithm is distribution-free in the sense that it requires no knowledge of the distribution aside from the promise of rotation invariance. To prove the correctness of this algorithm we present a theorem relating the distance between a function and a halfspace to the distance between their centers of mass, that applies to arbitrary distributions.
Recommendations
- On optimal tests for rotational symmetry against new classes of hyperspherical distributions
- Testing Halfspaces
- Testing halfspaces
- Testing uniformity on high-dimensional spheres against monotone rotationally symmetric alternatives
- Rotation invariant tests for discrete uniformity against peak shaped alternatives
- A decomposition for invariant tests of uniformity on the sphere
- Testing ±1-weight halfspace
- A rotation test to verify latent structure
Cited in
(5)
This page was built for publication: Testing Halfspaces over Rotation-Invariant Distributions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5236226)