The regularized least squares algorithm and the problem of learning halfspaces
type: Item
instance of: scholarly article
title: The regularized least squares algorithm and the problem of learning halfspaces
zbMATH Open document ID: 1260.68189
published in: Information Processing Letters
publication date: 2013-03-28T00:00:00Z
Mathematics Subject Classification ID: 68Q32
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68Q17
zbMATH DE Number: 6149193
zbMATH Keywords: computational complexity
zbMATH Keywords: analysis of algorithms
zbMATH Keywords: computational learning theory
zbMATH Keywords: halfspaces
zbMATH Keywords: regularized least squares algorithm
zbMATH Keywords: kernel
author: Hà Quang Minh
MaRDI profile type: Publication
full work available at URL: j.ipl.2011.01.011
OpenAlex ID: W1987010876
cites work: Theory of Reproducing Kernels
cites work: On the mathematical foundations of learning
cites work: Agnostically Learning Halfspaces
cites work: Efficient noise-tolerant learning from statistical queries
cites work: Learning intersections and thresholds of halfspaces
cites work: Halfspace learning, linear programming, and nonmalicious distributions
cites work: An upper bound on the sample complexity of PAC-learning halfspaces with respect to the uniform distribution
cites work: Some properties of Gaussian reproducing kernel Hilbert spaces and their implications for function approximation and learning theory
cites work: Optimum bounds for the distributions of martingales in Banach spaces
cites work: Q4826695
cites work: Learning theory estimates via integral operators and their approximations
cites work: Optimal aggregation of classifiers in statistical learning.
cites work: Q4261789
cites work: Q3996207
cites work: On early stopping in gradient descent learning
DOI: 10.1016/J.IPL.2011.01.011
description: scientific article; zbMATH DE number 6149193