Learning finite binary sequences from half-space data

DOI10.1002/(SICI)1098-2418(199907)14:4%3C345::AID-RSA4%3E3.0.CO;2-3MaRDI QIDQ4262223zbMATH OpenOpenAlexFDO

Authors Shao C. Fang, Santosh S. Venkatesh

Publication date 17 October 2000

Full work available at URL https://doi.org/10.1002/(sici)1098-2418(199907)14:4%3C345::aid-rsa4%3E3.0.co;2-3

zbMATH Keywords

batch learningbinary perceptronone-line learning

Mathematics Subject Classification ID

Computational learning theory (68Q32)

Recommendations

• Efficiently learning halfspaces with Tsybakov noise
• A Fast Optimization Method for General Binary Code Learning
• Learning approximate sequential patterns for classification
• Halfspace learning, linear programming, and nonmalicious distributions
• Complexity theoretic limitations on learning halfspaces
• Subspace Learning From Bits
• Sequence learning in unsupervised and supervised vector quantization using Hankel matrices
• Maximal width learning of binary functions

Cites work

• Computational limitations on learning from examples
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)

Cited in

(2)

• On multivariate Gaussian tails
• Directed drift: A new linear threshold algorithm for learning binary weights on-line

This page was built for publication: Learning finite binary sequences from half-space data

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4262223)