Deutsch
 
Hilfe Datenschutzhinweis Impressum
  DetailsucheBrowse

Datensatz

DATENSATZ AKTIONENEXPORT
Zur Ablage hinzufügen
 Lokale TagsFreigabegeschichteDetailsÜbersicht
  Measuring Learning Complexity with Criteria Epitomizers

Case, J., & Kötzing, T. (2011). Measuring Learning Complexity with Criteria Epitomizers. In T. Schwentick, & C. Dürr (Eds.), 28th International Symposium on Theoretical Aspects of Computer Science (pp. 320-331). Dagstuhl, Wadern: Leibniz-Zentrum für Informatik. doi:10.4230/LIPIcs.STACS.2011.320.

Item is

 

einblenden: alle ausblenden: alle

Basisdaten

einblenden: ausblenden:
Datensatz-Permalink: https://hdl.handle.net/11858/00-001M-0000-0010-124E-A Versions-Permalink: https://hdl.handle.net/11858/00-001M-0000-0024-057C-F
Genre: Konferenzbeitrag

Externe Referenzen

einblenden:

Urheber

einblenden:
ausblenden:
 Urheber:
Case, John1, Autor
Kötzing, Timo2, Autor           
Affiliations:
1External Organizations, ou_persistent22              
2Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              

Inhalt

einblenden:
ausblenden:
Schlagwörter: -
 Zusammenfassung: In prior papers, beginning with the seminal work by Freivalds et al. 1995, the notion of intrinsic complexity is used to analyze the learning complexity of sets of functions in a Gold-style learning setting. Herein are pointed out some weaknesses of this notion. Offered is an alternative based on epitomizing sets of functions -- sets, which are learnable under a given learning criterion, but not under other criteria which are not at least as powerful. To capture the idea of epitomizing sets, new reducibility notions are given based on robust learning (closure of learning under certain classes of operators). Various degrees of epitomizing sets are characterized as the sets complete with respect to corresponding reducibility notions! These characterizations also provide an easy method for showing sets to be epitomizers, and they are, then, employed to prove several sets to be epitomizing. Furthermore, a scheme is provided to generate easily very strong epitomizers for a multitude of learning criteria. These strong epitomizers are so-called self-learning sets, previously applied by Case & Koetzing, 2010. These strong epitomizers can be generated and employed in a myriad of settings to witness the strict separation in learning power between the criteria so epitomized and other not as powerful criteria!

Details

einblenden:
ausblenden:
Sprache(n): eng - English
 Datum: 20112011
 Publikationsstatus: Erschienen
 Seiten: -
 Ort, Verlag, Ausgabe: -
 Inhaltsverzeichnis: -
 Art der Begutachtung: -
 Identifikatoren: eDoc: 618666
DOI: 10.4230/LIPIcs.STACS.2011.320
URI: http://drops.dagstuhl.de/opus/volltexte/2011/3023/
Anderer: Local-ID: C1256428004B93B8-3D09312563BAC08EC1257856005560F8-Cas-Koe:c:11:StacsEpit
 Art des Abschluß: -

Veranstaltung

einblenden:
ausblenden:
Titel: 28th International Symposium on Theoretical Aspects of Computer Science
Veranstaltungsort: Dortmund, Germany
Start-/Enddatum: 2011-03-10 - 2011-03-12

Entscheidung

einblenden:

Projektinformation

einblenden:

Quelle 1

einblenden:
ausblenden:
Titel: 28th International Symposium on Theoretical Aspects of Computer Science
  Kurztitel : STACS 2011
Genre der Quelle: Konferenzband
 Urheber:
Schwentick, Thomas1, Herausgeber
Dürr, Christoph1, Herausgeber
Affiliations:
1 External Organizations, ou_persistent22            
Ort, Verlag, Ausgabe: Dagstuhl, Wadern : Leibniz-Zentrum für Informatik
Seiten: - Band / Heft: - Artikelnummer: - Start- / Endseite: 320 - 331 Identifikator: ISBN: 978-3-939897-25-5

Quelle 2

einblenden:
ausblenden:
Titel: Leibniz International Proceedings in Informatics (LIPIcs)
  Alternativer Titel :
Genre der Quelle: Reihe
 Urheber:
Affiliations:
Ort, Verlag, Ausgabe: -
Seiten: - Band / Heft: - Artikelnummer: - Start- / Endseite: - Identifikator: -