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...

Descripción completa

Detalles Bibliográficos
Autor: Gavaldà Mestre, Ricard|||0000-0003-4736-7179
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
id ES_401a5de9e2e615dfd16febeb41a81137
oai_identifier_str oai:upcommons.upc.edu:2117/83407
network_acronym_str ES
network_name_str España
repository_id_str
spelling Using fewer examples to simulate equivalence queriesGavaldà Mestre, Ricard|||0000-0003-4736-7179Equivalence queriesPAC algorithmÀrees temàtiques de la UPC::Informàtica::Informàtica teòricaIt 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.19961996-03-0220162016-02-24reporthttp://purl.org/coar/resource_type/c_93fcVoRhttp://purl.org/coar/version/c_970fb48d4fbd8a85info:eu-repo/semantics/reportapplication/postscripthttps://hdl.handle.net/2117/83407reponame:UPCommons. Portal del coneixement obert de la UPCinstname:Universitat Politècnica de Catalunya (UPC)Inglésengopen accesshttp://purl.org/coar/access_right/c_abf2info:eu-repo/semantics/openAccessoai:upcommons.upc.edu:2117/834072026-05-27T15:37:01Z
dc.title.none.fl_str_mv Using fewer examples to simulate equivalence queries
title Using fewer examples to simulate equivalence queries
spellingShingle Using fewer examples to simulate equivalence queries
Gavaldà Mestre, Ricard|||0000-0003-4736-7179
Equivalence queries
PAC algorithm
Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica
title_short Using fewer examples to simulate equivalence queries
title_full Using fewer examples to simulate equivalence queries
title_fullStr Using fewer examples to simulate equivalence queries
title_full_unstemmed Using fewer examples to simulate equivalence queries
title_sort Using fewer examples to simulate equivalence queries
dc.creator.none.fl_str_mv Gavaldà Mestre, Ricard|||0000-0003-4736-7179
author Gavaldà Mestre, Ricard|||0000-0003-4736-7179
author_facet Gavaldà Mestre, Ricard|||0000-0003-4736-7179
author_role author
dc.subject.none.fl_str_mv Equivalence queries
PAC algorithm
Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica
topic Equivalence queries
PAC algorithm
Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica
description 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.
publishDate 1996
dc.date.none.fl_str_mv 1996
1996-03-02
2016
2016-02-24
dc.type.none.fl_str_mv report
http://purl.org/coar/resource_type/c_93fc
VoR
http://purl.org/coar/version/c_970fb48d4fbd8a85
dc.type.openaire.fl_str_mv info:eu-repo/semantics/report
format report
dc.identifier.none.fl_str_mv https://hdl.handle.net/2117/83407
url https://hdl.handle.net/2117/83407
dc.language.none.fl_str_mv Inglés
eng
language_invalid_str_mv Inglés
language eng
dc.rights.none.fl_str_mv open access
http://purl.org/coar/access_right/c_abf2
dc.rights.openaire.fl_str_mv info:eu-repo/semantics/openAccess
rights_invalid_str_mv open access
http://purl.org/coar/access_right/c_abf2
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/postscript
dc.source.none.fl_str_mv reponame:UPCommons. Portal del coneixement obert de la UPC
instname:Universitat Politècnica de Catalunya (UPC)
instname_str Universitat Politècnica de Catalunya (UPC)
reponame_str UPCommons. Portal del coneixement obert de la UPC
collection UPCommons. Portal del coneixement obert de la UPC
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1869406719706136576
score 15,300724

Similares en LA Referencia