{"id":"https://openalex.org/W7131419748","doi":"https://doi.org/10.48550/arxiv.2602.19552","title":"The Sample Complexity of Replicable Realizable PAC Learning","display_name":"The Sample Complexity of Replicable Realizable PAC Learning","publication_year":2026,"publication_date":"2026-02-23","ids":{"openalex":"https://openalex.org/W7131419748","doi":"https://doi.org/10.48550/arxiv.2602.19552"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2602.19552","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2602.19552","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2602.19552","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5110745660","display_name":"K. Larsen","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Larsen, Kasper Green","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5107628415","display_name":"Markus Engelund Mathiasen","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Mathiasen, Markus Engelund","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5081649943","display_name":"Chirag Pabbaraju","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Pabbaraju, Chirag","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5126712253","display_name":"Clement Svendsen","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Svendsen, Clement","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.4271000027656555,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.4271000027656555,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.11670000106096268,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.09740000218153,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.7721999883651733},{"id":"https://openalex.org/keywords/sample-complexity","display_name":"Sample complexity","score":0.5831999778747559},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5543000102043152},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4936999976634979},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.40059998631477356},{"id":"https://openalex.org/keywords/adjacency-list","display_name":"Adjacency list","score":0.3837999999523163},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.37720000743865967},{"id":"https://openalex.org/keywords/random-walk","display_name":"Random walk","score":0.3440999984741211}],"concepts":[{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.7721999883651733},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6277999877929688},{"id":"https://openalex.org/C2778445095","wikidata":"https://www.wikidata.org/wiki/Q18354077","display_name":"Sample complexity","level":2,"score":0.5831999778747559},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5543000102043152},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4936999976634979},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.42250001430511475},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4187000095844269},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.40059998631477356},{"id":"https://openalex.org/C110484373","wikidata":"https://www.wikidata.org/wiki/Q264398","display_name":"Adjacency list","level":2,"score":0.3837999999523163},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.37720000743865967},{"id":"https://openalex.org/C121194460","wikidata":"https://www.wikidata.org/wiki/Q856741","display_name":"Random walk","level":2,"score":0.3440999984741211},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.3319999873638153},{"id":"https://openalex.org/C120204988","wikidata":"https://www.wikidata.org/wiki/Q859174","display_name":"Cayley graph","level":3,"score":0.3319000005722046},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3269999921321869},{"id":"https://openalex.org/C2985906921","wikidata":"https://www.wikidata.org/wiki/Q190524","display_name":"Spectral properties","level":2,"score":0.3215000033378601},{"id":"https://openalex.org/C198531522","wikidata":"https://www.wikidata.org/wiki/Q485146","display_name":"Sample (material)","level":2,"score":0.3043999969959259},{"id":"https://openalex.org/C176248197","wikidata":"https://www.wikidata.org/wiki/Q458526","display_name":"Probably approximately correct learning","level":4,"score":0.29919999837875366},{"id":"https://openalex.org/C47458327","wikidata":"https://www.wikidata.org/wiki/Q910404","display_name":"Random graph","level":3,"score":0.2930999994277954},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2847999930381775},{"id":"https://openalex.org/C2779341405","wikidata":"https://www.wikidata.org/wiki/Q1456811","display_name":"Kolmogorov complexity","level":2,"score":0.2831999957561493},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.2727000117301941},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2703999876976013},{"id":"https://openalex.org/C180356752","wikidata":"https://www.wikidata.org/wiki/Q727035","display_name":"Adjacency matrix","level":3,"score":0.2662999927997589},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.26109999418258667},{"id":"https://openalex.org/C74003402","wikidata":"https://www.wikidata.org/wiki/Q3180727","display_name":"Spectral graph theory","level":5,"score":0.26010000705718994},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.2551000118255615}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2602.19552","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2602.19552","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2602.19552","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2602.19552","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"In":[0],"this":[1,64],"paper,":[2],"we":[3,76],"consider":[4,99],"the":[5,33,36,68,84,104],"problem":[6,18],"of":[7,35,71,103],"replicable":[8],"realizable":[9],"PAC":[10],"learning.":[11],"We":[12],"construct":[13],"a":[14,21,27,50,59,90,100],"particularly":[15],"hard":[16],"learning":[17],"and":[19,46,57],"show":[20,77],"sample":[22],"complexity":[23],"lower":[24,85,92],"bound":[25,82,86,93],"with":[26,55],"close":[28],"to":[29,98],"$(\\log|H|)^{3/2}$":[30],"dependence":[31],"on":[32,63],"size":[34],"hypothesis":[37],"class":[38],"$H$.":[39],"Our":[40],"proof":[41],"uses":[42],"several":[43],"novel":[44],"techniques":[45],"works":[47],"by":[48,66],"defining":[49],"particular":[51],"Cayley":[52],"graph":[53,65],"associated":[54],"$H$":[56],"analyzing":[58],"suitable":[60],"random":[61],"walk":[62],"examining":[67],"spectral":[69],"properties":[70],"its":[72],"adjacency":[73],"matrix.":[74],"Furthermore,":[75],"an":[78],"almost":[79],"matching":[80],"upper":[81],"for":[83],"instance,":[87],"meaning":[88],"if":[89],"stronger":[91],"exists,":[94],"one":[95],"would":[96],"have":[97],"different":[101],"instance":[102],"problem.":[105]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-02-26T00:00:00"}