Using fewer examples to simulate equivalence queries
It is well known that an algorithm that learns exactly using Equivalence queries can be transformed into a PAC algorithm that asks for random labelled examples. The first transformation due to Angluin (1988) uses a number of examples quadratic in the number of queries. Later, Littlestone (1989) and...
| Autor: | |
|---|---|
| Tipo de recurso: | informe técnico |
| Fecha de publicación: | 1996 |
| País: | España |
| Institución: | Universitat Politècnica de Catalunya (UPC) |
| Repositorio: | UPCommons. Portal del coneixement obert de la UPC |
| Idioma: | inglés |
| OAI Identifier: | oai:upcommons.upc.edu:2117/83407 |
| Acceso en línea: | https://hdl.handle.net/2117/83407 |
| Access Level: | acceso abierto |
| Palabra clave: | Equivalence queries PAC algorithm Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica |
| Sumario: | It is well known that an algorithm that learns exactly using Equivalence queries can be transformed into a PAC algorithm that asks for random labelled examples. The first transformation due to Angluin (1988) uses a number of examples quadratic in the number of queries. Later, Littlestone (1989) and Schuurmans and Greiner (1995) gave transformations using linearly many examples. We present here another analysis of Littlestone's transformation which is both simpler and gives better leading constants. Our constants are still worse than Schuurmans and Greiner's, but while ours is a worst-case bound on the number of examples to achieve PAC learning, theirs is only an expected one. |
|---|