Unconditional lower bounds for learning intersections of halfspaces
type: Item
instance of: scholarly article
title: Unconditional lower bounds for learning intersections of halfspaces
zbMATH Open document ID: 1470.68056
author: Adam R. Klivans
author: Alexander A. Sherstov
published in: Machine Learning
publication date: 2009-03-31T00:00:00Z
Mathematics Subject Classification ID: 68Q32
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 68T05
zbMATH DE Number: 5537342
zbMATH Keywords: intersections of halfspaces
zbMATH Keywords: halfspace learning
zbMATH Keywords: PAC learning
zbMATH Keywords: SQ learning
zbMATH Keywords: statistical queries
zbMATH Keywords: query learning
zbMATH Keywords: lower bounds for learning
zbMATH Keywords: polynomial threshold functions
zbMATH Keywords: harmonic sieve
MaRDI profile type: Publication
full work available at URL: s10994-007-5010-1
OpenAlex ID: W2140283251
cites work: The expressive power of voting polynomials
cites work: PP is closed under intersection
cites work: A polynomial-time algorithm for learning noisy linear threshold functions
cites work: Weakly learning DNF and characterizing statistical query learning using Fourier analysis
cites work: Noise-tolerant learning, the parity problem, and the statistical query model
cites work: Harmonic Analysis of Polynomial Threshold Functions
cites work: On the Fourier spectrum of monotone functions
cites work: Efficient noise-tolerant learning from statistical queries
cites work: Learning intersections and thresholds of halfspaces
cites work: Learning Theory
cites work: Cryptographic hardness for learning intersections of halfspaces
cites work: On the computational power of depth-2 circuits with threshold and modulo gates
cites work: Learning Decision Trees Using the Fourier Spectrum
cites work: PAC learning intersections of halfspaces with membership queries
cites work: Q4146667
cites work: Q3996586
cites work: New degree bounds for polynomial threshold functions
cites work: Hyperplane cuts of an n-cube
cites work: Q3142416
cites work: A theory of the learnable
cites work: New lower bounds for statistical query learning
DOI: 10.1007/S10994-007-5010-1
description: scientific article; zbMATH DE number 5537342