The regularized least squares algorithm and the problem of learning halfspaces
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 45848 (Why is no real title available?)
- scientific article; zbMATH DE number 1332320 (Why is no real title available?)
- scientific article; zbMATH DE number 2115052 (Why is no real title available?)
- Agnostically Learning Halfspaces
- An upper bound on the sample complexity of PAC-learning halfspaces with respect to the uniform distribution
- Efficient noise-tolerant learning from statistical queries
- Halfspace learning, linear programming, and nonmalicious distributions
- Learning intersections and thresholds of halfspaces
- Learning theory estimates via integral operators and their approximations
- On early stopping in gradient descent learning
- On the mathematical foundations of learning
- Optimal aggregation of classifiers in statistical learning.
- Optimum bounds for the distributions of martingales in Banach spaces
- Some properties of Gaussian reproducing kernel Hilbert spaces and their implications for function approximation and learning theory
- Theory of Reproducing Kernels
Cited in
(3)
This page was built for publication: The regularized least squares algorithm and the problem of learning halfspaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1944907)