Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools

ALT

2015

Springer

2015

Springer

Abstract. We compose a toolbox for the design of Minimum Disagreement algorithms. This box contains general procedures which transform (without much loss of eﬃciency) algorithms that are successful for some d-dimensional (geometric) concept class C into algorithms which are successful for a (d + 1)-dimensional extension of C. An iterative application of these transformations has the potential of starting with a base algorithm for a trivial problem and ending up at a smart algorithm for a non-trivial problem. In order to make this working, it is essential that the algorithms are not proper, i.e., they return a hypothesis that is not necessarily a member of C. However, the “price” for using a super-class H of C is so low that the resulting time bound for achieving accuracy ε in the model of agnostic learning is signiﬁcantly smaller than the time bounds achieved by the up to date best (proper) algorithms. We evaluate the transformation technique for d = 2 on both artiﬁcial and ...

Related Content

Added |
15 Apr 2016 |

Updated |
15 Apr 2016 |

Type |
Journal |

Year |
2015 |

Where |
ALT |

Authors |
Malte Darnstädt, Christoph Ries, Hans Ulrich Simon |

Comments (0)