Learning parities in the mistake-bound model

DOI10.1016/j.ipl.2010.10.009zbMath1260.68188OpenAlexW2000793965MaRDI QIDQ1944027

Harry Buhrman, Arie Matsliah, David García-Soriano

Publication date: 4 April 2013

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2010/2417/

zbMATH Keywords

on-line algorithmsparitiesattribute-efficient learningmistake-bound

Mathematics Subject Classification ID

Computational learning theory (68Q32) Online algorithms; streaming algorithms (68W27)

Related Items

Improved learning of \(k\)-parities

Cites Work

• Unnamed Item
• Unnamed Item
• Queries and concept learning
• Deterministic Approximation Algorithms for the Nearest Codeword Problem
• Learning Theory