Jérémie Chalopin, V. Chepoi, Fionn Mc Inerney, Sébastien Ratel, Y. Vaxès
{"title":"图中球的压缩方案示例","authors":"Jérémie Chalopin, V. Chepoi, Fionn Mc Inerney, Sébastien Ratel, Y. Vaxès","doi":"10.48550/arXiv.2206.13254","DOIUrl":null,"url":null,"abstract":"One of the open problems in machine learning is whether any set-family of VC-dimension d admits a sample compression scheme of size O ( d ). In this paper, we study this problem for balls in graphs. For balls of arbitrary radius r , we design proper sample compression schemes of size 4 for interval graphs, of size 6 for trees of cycles, and of size 22 for cube-free median graphs. We also design approximate sample compression schemes of size 2 for balls of δ -hyperbolic graphs.","PeriodicalId":369104,"journal":{"name":"International Symposium on Mathematical Foundations of Computer Science","volume":"3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Sample compression schemes for balls in graphs\",\"authors\":\"Jérémie Chalopin, V. Chepoi, Fionn Mc Inerney, Sébastien Ratel, Y. Vaxès\",\"doi\":\"10.48550/arXiv.2206.13254\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"One of the open problems in machine learning is whether any set-family of VC-dimension d admits a sample compression scheme of size O ( d ). In this paper, we study this problem for balls in graphs. For balls of arbitrary radius r , we design proper sample compression schemes of size 4 for interval graphs, of size 6 for trees of cycles, and of size 22 for cube-free median graphs. We also design approximate sample compression schemes of size 2 for balls of δ -hyperbolic graphs.\",\"PeriodicalId\":369104,\"journal\":{\"name\":\"International Symposium on Mathematical Foundations of Computer Science\",\"volume\":\"3 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-06-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Symposium on Mathematical Foundations of Computer Science\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.48550/arXiv.2206.13254\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Symposium on Mathematical Foundations of Computer Science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.48550/arXiv.2206.13254","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
One of the open problems in machine learning is whether any set-family of VC-dimension d admits a sample compression scheme of size O ( d ). In this paper, we study this problem for balls in graphs. For balls of arbitrary radius r , we design proper sample compression schemes of size 4 for interval graphs, of size 6 for trees of cycles, and of size 22 for cube-free median graphs. We also design approximate sample compression schemes of size 2 for balls of δ -hyperbolic graphs.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
