Mostra el registre d'ítem simple
Using fewer examples to simulate equivalence queries
dc.contributor.author | Gavaldà Mestre, Ricard |
dc.contributor.other | Universitat Politècnica de Catalunya. Departament de Ciències de la Computació |
dc.date.accessioned | 2016-02-24T17:19:54Z |
dc.date.available | 2016-02-24T17:19:54Z |
dc.date.issued | 1996-03-02 |
dc.identifier.citation | Gavaldà Mestre, Ricard. "Using fewer examples to simulate equivalence queries". 1996. |
dc.identifier.uri | http://hdl.handle.net/2117/83407 |
dc.description.abstract | 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. |
dc.format.extent | 12 p. |
dc.language.iso | eng |
dc.relation.ispartofseries | LSI-96-66-R |
dc.subject | Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica |
dc.subject.other | Equivalence queries |
dc.subject.other | PAC algorithm |
dc.title | Using fewer examples to simulate equivalence queries |
dc.type | External research report |
dc.rights.access | Open Access |
local.identifier.drac | 1893812 |
dc.description.version | Postprint (published version) |
Fitxers d'aquest items
Aquest ítem apareix a les col·leccions següents
-
Reports de recerca [1.107]