Corrigendum to ``Shifting: One-inclusion mistake bounds and sample compression

DOI10.1016/J.JCSS.2010.03.001MaRDI QIDQ972387zbMATH OpenOpenAlexFDO

Authors Benjamin I. P. Rubinstein, Peter L. Bartlett, J. Hyam Rubinstein

Publication date 25 May 2010

Published in Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jcss.2010.03.001

zbMATH Keywords

multiclass predictionone-inclusion mistake boundssample compressionshiftingworst-case expected risk

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Shifting: one-inclusion mistake bounds and sample compression
• Corrigendum to: ``A concentration bound for contractive stochastic approximation
• Corrigendum to: ``The asymptotic number of connected \(d\)-uniform hypergraphs
• Corrigendum
• Erratum to: ``Fuzzification of set inclusion: Theory and applications

Cites work

• Characterizations of learnability for classes of \(\{0,\dots,n\}\)-valued functions
• Shifting: one-inclusion mistake bounds and sample compression
• Sphere packing numbers for subsets of the Boolean \(n\)-cube with bounded Vapnik-Chervonenkis dimension

Cited in

(8)

• Corrigendum to: ``Classification with asymmetric label noise: consistency and maximal denoising
• Corrigendum to: ``The d.r.e. degrees are not dense
• Shifting: one-inclusion mistake bounds and sample compression
• Corrigendum: Explicit Construction of a Small Epsilon-Net for Linear Threshold Functions
• Comments and correction on: ``\(U\)-processes and preference learning
• A characterization of list learnability
• Erratum to: ``Risk bounds for the majority vote: from a PAC-Bayesian analysis to a learning algorithm
• One-inclusion hypergraph density revisited

This page was built for publication: Corrigendum to ``Shifting: One-inclusion mistake bounds and sample compression

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