Sciweavers

75 search results - page 1 / 15
» A Uniform Lower Error Bound for Half-Space Learning
Sort
View
ALT
2008
Springer
14 years 1 months ago
A Uniform Lower Error Bound for Half-Space Learning
Abstract. We give a lower bound for the error of any unitarily invariant algorithm learning half-spaces against the uniform or related distributions on the unit sphere. The bound i...
Andreas Maurer, Massimiliano Pontil
ALT
1998
Springer
13 years 8 months ago
Lower Bounds for the Complexity of Learning Half-Spaces with Membership Queries
Exact learning of half-spaces over finite subsets of IRn from membership queries is considered. We describe the minimum set of labelled examples separating the target concept from ...
Valery N. Shevchenko, Nikolai Yu. Zolotykh
ICML
2003
IEEE
14 years 5 months ago
The Set Covering Machine with Data-Dependent Half-Spaces
We examine the set covering machine when it uses data-dependent half-spaces for its set of features and bound its generalization error in terms of the number of training errors an...
Mario Marchand, Mohak Shah, John Shawe-Taylor, Mar...
DAGSTUHL
2004
13 years 6 months ago
Lower Bounds and Non-Uniform Time Discretization for Approximation of Stochastic Heat Equations
We study algorithms for approximation of the mild solution of stochastic heat equations on the spatial domain ]0, 1[ d . The error of an algorithm is defined in L2-sense. We derive...
Klaus Ritter, Thomas Müller-Gronbach
APPROX
2010
Springer
148views Algorithms» more  APPROX 2010»
13 years 6 months ago
Learning and Lower Bounds for AC0 with Threshold Gates
In 2002 Jackson et al. [JKS02] asked whether AC0 circuits augmented with a threshold gate at the output can be efficiently learned from uniform random examples. We answer this ques...
Parikshit Gopalan, Rocco A. Servedio