76 search results - page 11 / 16 » Agnostically Learning Halfspaces |
CORR
2008
Springer
14 years 9 months ago
2008
Springer
We prove existence and uniqueness of the minimizer for the average geodesic distance to the points of a geodesically convex set on the sphere. This implies a corresponding existen...
COCO
2010
Springer
15 years 21 days ago
2010
Springer
Abstract. We prove asymptotically optimal bounds on the Gaussian noise sensitivity of degree-d polynomial threshold functions. These bounds translate into optimal bounds on the Gau...
COLT
1995
Springer
15 years 1 months ago
1995
Springer
We introduce a new model for learning with membership queries in which queries near the boundary of a target concept may receive incorrect or “don’t care” responses. In part...
FOCS
2010
IEEE
14 years 7 months ago
2010
IEEE
We present a new algorithm for learning a convex set in n-dimensional space given labeled examples drawn from any Gaussian distribution. The complexity of the algorithm is bounded ...
ICML
2004
IEEE
15 years 10 months ago
2004
IEEE
We describe and analyze an online algorithm for supervised learning of pseudo-metrics. The algorithm receives pairs of instances and predicts their similarity according to a pseud...