How much data is sufficient to learn high-performing algorithms? generalization guarantees for data-driven algorithm design
Saved in:
| Published in | Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing |
|---|---|
| Format | Conference Proceeding |
| Language | English |
| Online Access | Get full text |
| DOI | 10.1145/3406325.3451036 |
Cover
| BookMark | eNpFkLFOwzAURT3AAIWZ1T-QYsexgyeEKqBIlVhgjl6cZ8eS40SOQ1X4eQpUYrrDvfcM55KcxTEiITecrTmv5K2omBKlXItKcibUBfnajns6LKanHWSgfqbzYq03HmOmeaQBIUXae9cXEyY7psFHRyG4MfncD_M9dRgxQfCfkP0YqVsgQcyIMz2uf6lFl_wHxv8X7XD2Ll6RcwthxutTrsj70-PbZlvsXp9fNg-7Akp1lwsBlcFadK3WzCpjQdV1q0pmOqMFlvpYGAPM1EYqqVsjNdOABqDmTHGpxYqwP-4SJzjsIYRmSn6AdGg4a368NCcvzcmL-AZN3GCo |
|---|---|
| ContentType | Conference Proceeding |
| DBID | ADTOC UNPAY |
| DOI | 10.1145/3406325.3451036 |
| DatabaseName | Unpaywall for CDI: Periodical Content Unpaywall |
| Database_xml | – sequence: 1 dbid: UNPAY name: Unpaywall url: https://proxy.k.utb.cz/login?url=https://unpaywall.org/ sourceTypes: Open Access Repository |
| DeliveryMethod | fulltext_linktorsrc |
| ExternalDocumentID | 10.1145/3406325.3451036 |
| GroupedDBID | ADTOC UNPAY |
| ID | FETCH-LOGICAL-a268t-3a4ce73db990f6cfa677b620cdc93e29db9cca0c7c5659bc5909aecaa71061593 |
| IEDL.DBID | UNPAY |
| IngestDate | Sun Oct 26 03:45:34 EDT 2025 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Language | English |
| License | cc-by |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-a268t-3a4ce73db990f6cfa677b620cdc93e29db9cca0c7c5659bc5909aecaa71061593 |
| OpenAccessLink | https://proxy.k.utb.cz/login?url=https://dl.acm.org/doi/pdf/10.1145/3406325.3451036 |
| ParticipantIDs | unpaywall_primary_10_1145_3406325_3451036 |
| PublicationTitle | Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing |
| Score | 2.4735906 |
| SourceID | unpaywall |
| SourceType | Open Access Repository |
| Title | How much data is sufficient to learn high-performing algorithms? generalization guarantees for data-driven algorithm design |
| URI | https://dl.acm.org/doi/pdf/10.1145/3406325.3451036 |
| UnpaywallVersion | publishedVersion |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlZ3PS8MwFMfD3A7iRcWJikoOXjxkdkmTNicRcQzBsYODeSr50W7Dri1ry1D_eZO2biJedu5LCHlJ3gt9308AuBF-34tC5aOIcIFcrSPkc0mRz4iDtfR9WgFMX0ZsOHGfp3TaAvhHC6Nj08-y-oVv93SmowZoS--IiT0E0x5xLQWO7YEOoyb_boPOZDR-eGu4Pf9YHoD9MsnEx1rE8a_gMTisBX15xRy0NSPvvbKQPfX5h8i427iOQHcr1oPjTRg6Bq0wOQFfw3QNl6WaQ1sCChc5zMsKFmFiDCxSWD0WAS2rGGW1dMC0hSKepatFMV_m93BW86gbmSacmaVknRDm0FhXvSK9skflthXUVTlIF0wGT6-PQ9S8s4AEZn6BiHBV6BEtTWSKmIoE8zzJsKO04iTE3HwwfnaUp0z2x6Wi3OEiVEJ49j5JOTkF7SRNwjMAJZMOk57sYyxdrZS0_D7hmmMikn3J2Dm43bgiyGqeRlBro2nQTGTQTOTFDraXoF2syvDKJAiFvG5WxDem0bvD |
| linkProvider | Unpaywall |
| linkToUnpaywall | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlZ3PS8MwFMfD3A7iRcWJikoOXjxkdkmTNicRcQzBsYODeSr50W7Dri1ry1D_eZO2biJedu5LCHlJ3gt9308AuBF-34tC5aOIcIFcrSPkc0mRz4iDtfR9WgFMX0ZsOHGfp3TaAvhHC6Nj08-y-oVv93SmowZoS--IiT0E0x5xLQWO7YEOoyb_boPOZDR-eGu4Pf9YHoD9MsnEx1rE8a_gMTisBX15xRy0NSPvvbKQPfX5h8i427iOQHcr1oPjTRg6Bq0wOQFfw3QNl6WaQ1sCChc5zMsKFmFiDCxSWD0WAS2rGGW1dMC0hSKepatFMV_m93BW86gbmSacmaVknRDm0FhXvSK9skflthXUVTlIF0wGT6-PQ9S8s4AEZn6BiHBV6BEtTWSKmIoE8zzJsKO04iTE3HwwfnaUp0z2x6Wi3OEiVEJ49j5JOTkF7SRNwjMAJZMOk57sYyxdrZS0_D7hmmMikn3J2Dm43bgiyGqeRlBro2nQTGTQTOTFDraXoF2syvDKJAiFvG5WxDem0bvD |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=Proceedings+of+the+53rd+Annual+ACM+SIGACT+Symposium+on+Theory+of+Computing&rft.atitle=How+much+data+is+sufficient+to+learn+high-performing+algorithms%3F+generalization+guarantees+for+data-driven+algorithm+design&rft_id=info:doi/10.1145%2F3406325.3451036&rft.externalDocID=10.1145%2F3406325.3451036 |