Density of compressible types and some consequences
We study compressible types in the context of (local and global) NIP. By extending a result in machine learning theory (the existence of a bound on the recursive teaching dimension), we prove density of compressible types. Using this, we obtain explicit uniform honest definitions for NIP formulas (a...
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | |
|---|---|
| container_issue | |
| container_start_page | |
| container_title | |
| container_volume | |
| creator | Bays, Martin Kaplan, Itay Simon, Pierre |
| description | We study compressible types in the context of (local and global) NIP. By
extending a result in machine learning theory (the existence of a bound on the
recursive teaching dimension), we prove density of compressible types. Using
this, we obtain explicit uniform honest definitions for NIP formulas (answering
a question of Eshel and the second author), and build compressible models in
countable NIP theories. |
| doi_str_mv | 10.48550/arxiv.2107.05197 |
| format | Article |
| fullrecord | <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_2107_05197</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2107_05197</sourcerecordid><originalsourceid>FETCH-LOGICAL-a677-1a5b59846d6d60b773cfc9c4a7a9f01e0b7ab02b2248e42c7106320344f33bc93</originalsourceid><addsrcrecordid>eNotjs1qwkAUhWfjomgfoCvnBZLe-ctklmKtLQhu3Ic74x0ImB8zKubtjbacxYHzweFj7ENArktj4BOHe33LpQCbgxHOvjH1RW2qLyPvIg9d0w-UUu1PxC9jT4lje-Spa2hibaLzldpAacFmEU-J3v97zg7fm8P6J9vtt7_r1S7DwtpMoPHGlbo4TgFvrQoxuKDRoosgaJrQg_RS6pK0DFZAoSQoraNSPjg1Z8u_25d11Q91g8NYPe2rl716AEVCPvA</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Density of compressible types and some consequences</title><source>arXiv.org</source><creator>Bays, Martin ; Kaplan, Itay ; Simon, Pierre</creator><creatorcontrib>Bays, Martin ; Kaplan, Itay ; Simon, Pierre</creatorcontrib><description>We study compressible types in the context of (local and global) NIP. By
extending a result in machine learning theory (the existence of a bound on the
recursive teaching dimension), we prove density of compressible types. Using
this, we obtain explicit uniform honest definitions for NIP formulas (answering
a question of Eshel and the second author), and build compressible models in
countable NIP theories.</description><identifier>DOI: 10.48550/arxiv.2107.05197</identifier><language>eng</language><subject>Mathematics - Logic</subject><creationdate>2021-07</creationdate><rights>http://creativecommons.org/licenses/by-sa/4.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,780,885</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/2107.05197$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.2107.05197$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Bays, Martin</creatorcontrib><creatorcontrib>Kaplan, Itay</creatorcontrib><creatorcontrib>Simon, Pierre</creatorcontrib><title>Density of compressible types and some consequences</title><description>We study compressible types in the context of (local and global) NIP. By
extending a result in machine learning theory (the existence of a bound on the
recursive teaching dimension), we prove density of compressible types. Using
this, we obtain explicit uniform honest definitions for NIP formulas (answering
a question of Eshel and the second author), and build compressible models in
countable NIP theories.</description><subject>Mathematics - Logic</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2021</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotjs1qwkAUhWfjomgfoCvnBZLe-ctklmKtLQhu3Ic74x0ImB8zKubtjbacxYHzweFj7ENArktj4BOHe33LpQCbgxHOvjH1RW2qLyPvIg9d0w-UUu1PxC9jT4lje-Spa2hibaLzldpAacFmEU-J3v97zg7fm8P6J9vtt7_r1S7DwtpMoPHGlbo4TgFvrQoxuKDRoosgaJrQg_RS6pK0DFZAoSQoraNSPjg1Z8u_25d11Q91g8NYPe2rl716AEVCPvA</recordid><startdate>20210712</startdate><enddate>20210712</enddate><creator>Bays, Martin</creator><creator>Kaplan, Itay</creator><creator>Simon, Pierre</creator><scope>AKZ</scope><scope>GOX</scope></search><sort><creationdate>20210712</creationdate><title>Density of compressible types and some consequences</title><author>Bays, Martin ; Kaplan, Itay ; Simon, Pierre</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a677-1a5b59846d6d60b773cfc9c4a7a9f01e0b7ab02b2248e42c7106320344f33bc93</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2021</creationdate><topic>Mathematics - Logic</topic><toplevel>online_resources</toplevel><creatorcontrib>Bays, Martin</creatorcontrib><creatorcontrib>Kaplan, Itay</creatorcontrib><creatorcontrib>Simon, Pierre</creatorcontrib><collection>arXiv Mathematics</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Bays, Martin</au><au>Kaplan, Itay</au><au>Simon, Pierre</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Density of compressible types and some consequences</atitle><date>2021-07-12</date><risdate>2021</risdate><abstract>We study compressible types in the context of (local and global) NIP. By
extending a result in machine learning theory (the existence of a bound on the
recursive teaching dimension), we prove density of compressible types. Using
this, we obtain explicit uniform honest definitions for NIP formulas (answering
a question of Eshel and the second author), and build compressible models in
countable NIP theories.</abstract><doi>10.48550/arxiv.2107.05197</doi><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | DOI: 10.48550/arxiv.2107.05197 |
| ispartof | |
| issn | |
| language | eng |
| recordid | cdi_arxiv_primary_2107_05197 |
| source | arXiv.org |
| subjects | Mathematics - Logic |
| title | Density of compressible types and some consequences |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-30T22%3A11%3A29IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Density%20of%20compressible%20types%20and%20some%20consequences&rft.au=Bays,%20Martin&rft.date=2021-07-12&rft_id=info:doi/10.48550/arxiv.2107.05197&rft_dat=%3Carxiv_GOX%3E2107_05197%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |