{"id":"https://openalex.org/W4417004208","doi":"https://doi.org/10.4230/lipics.itcs.2026.91","title":"Limitations of Membership Queries in Testable Learning","display_name":"Limitations of Membership Queries in Testable Learning","publication_year":2025,"publication_date":"2025-12-01","ids":{"openalex":"https://openalex.org/W4417004208","doi":"https://doi.org/10.4230/lipics.itcs.2026.91"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2512.02279","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2512.02279","pdf_url":"https://arxiv.org/pdf/2512.02279","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"type":"article","indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2512.02279","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5003983968","display_name":"Jane Lange","orcid":"https://orcid.org/0000-0002-0014-9679"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Lange, Jane","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5023118987","display_name":"Mingda Qiao","orcid":"https://orcid.org/0000-0002-9182-6152"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Qiao, Mingda","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5003983968"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.20138763,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"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.9031000137329102,"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.9031000137329102,"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/T11719","display_name":"Data Quality and Management","score":0.01590000092983246,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T11303","display_name":"Bayesian Modeling and Causal Inference","score":0.007699999958276749,"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/concept-class","display_name":"Concept class","score":0.8197000026702881},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.6732000112533569},{"id":"https://openalex.org/keywords/vc-dimension","display_name":"VC dimension","score":0.6399999856948853},{"id":"https://openalex.org/keywords/probably-approximately-correct-learning","display_name":"Probably approximately correct learning","score":0.5667999982833862},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.565500020980835},{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.4702000021934509},{"id":"https://openalex.org/keywords/computational-learning-theory","display_name":"Computational learning theory","score":0.3935999870300293},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.387800008058548},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.37790000438690186}],"concepts":[{"id":"https://openalex.org/C203313322","wikidata":"https://www.wikidata.org/wiki/Q5158394","display_name":"Concept class","level":2,"score":0.8197000026702881},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.6732000112533569},{"id":"https://openalex.org/C119322782","wikidata":"https://www.wikidata.org/wiki/Q2662236","display_name":"VC dimension","level":2,"score":0.6399999856948853},{"id":"https://openalex.org/C176248197","wikidata":"https://www.wikidata.org/wiki/Q458526","display_name":"Probably approximately correct learning","level":4,"score":0.5667999982833862},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.565500020980835},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4932999908924103},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.48010000586509705},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.47110000252723694},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.4702000021934509},{"id":"https://openalex.org/C50292564","wikidata":"https://www.wikidata.org/wiki/Q2462783","display_name":"Computational learning theory","level":3,"score":0.3935999870300293},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.387800008058548},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.37790000438690186},{"id":"https://openalex.org/C110121322","wikidata":"https://www.wikidata.org/wiki/Q865811","display_name":"Distribution (mathematics)","level":2,"score":0.36910000443458557},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.36079999804496765},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.3537999987602234},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3479999899864197},{"id":"https://openalex.org/C136726353","wikidata":"https://www.wikidata.org/wiki/Q903789","display_name":"Disjunctive normal form","level":2,"score":0.34470000863075256},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34220001101493835},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.32760000228881836},{"id":"https://openalex.org/C32254414","wikidata":"https://www.wikidata.org/wiki/Q4724364","display_name":"Algorithmic learning theory","level":3,"score":0.3237999975681305},{"id":"https://openalex.org/C116222747","wikidata":"https://www.wikidata.org/wiki/Q220888","display_name":"Falsifiability","level":2,"score":0.31220000982284546},{"id":"https://openalex.org/C149441793","wikidata":"https://www.wikidata.org/wiki/Q200726","display_name":"Probability distribution","level":2,"score":0.30169999599456787},{"id":"https://openalex.org/C87007009","wikidata":"https://www.wikidata.org/wiki/Q210832","display_name":"Statistical hypothesis testing","level":2,"score":0.2964000105857849},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.29589998722076416},{"id":"https://openalex.org/C24138899","wikidata":"https://www.wikidata.org/wiki/Q17141258","display_name":"Instance-based learning","level":3,"score":0.28369998931884766},{"id":"https://openalex.org/C2776401178","wikidata":"https://www.wikidata.org/wiki/Q12050496","display_name":"Feature (linguistics)","level":2,"score":0.28110000491142273},{"id":"https://openalex.org/C77967617","wikidata":"https://www.wikidata.org/wiki/Q4677561","display_name":"Active learning (machine learning)","level":2,"score":0.27469998598098755},{"id":"https://openalex.org/C2778445095","wikidata":"https://www.wikidata.org/wiki/Q18354077","display_name":"Sample complexity","level":2,"score":0.258899986743927}],"mesh":[],"locations_count":4,"locations":[{"id":"pmh:oai:arXiv.org:2512.02279","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2512.02279","pdf_url":"https://arxiv.org/pdf/2512.02279","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:drops-oai.dagstuhl.de:25378","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2026.91","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol362-itcs2026/LIPIcs.ITCS.2026.91/LIPIcs.ITCS.2026.91.pdf","source":{"id":"https://openalex.org/S4306402524","display_name":"Leibniz-Zentrum f\u00fcr Informatik (Schloss Dagstuhl)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"publishedVersion"},{"id":"doi:10.48550/arxiv.2512.02279","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2512.02279","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"},{"id":"doi:10.4230/lipics.itcs.2026.91","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.itcs.2026.91","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":""}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2512.02279","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2512.02279","pdf_url":"https://arxiv.org/pdf/2512.02279","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2392833675","display_name":null,"funder_award_id":"DMS-2022448","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G2803214975","display_name":"AF: Small: Sparsity in Local Computation","funder_award_id":"2006664","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6894402473","display_name":null,"funder_award_id":"Fellowship","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6976272281","display_name":null,"funder_award_id":"CCF-2006664","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7489684057","display_name":"AF: SMALL: Extending the Reach of Distribution Testing via Structure","funder_award_id":"2310818","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8294762899","display_name":"Foundations of Data Science Institute","funder_award_id":"2022448","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G848032724","display_name":null,"funder_award_id":"Science","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Membership":[0],"queries":[1,28,96],"(MQ)":[2],"often":[3],"yield":[4],"speedups":[5],"for":[6,102],"learning":[7,36,48,94,108,182],"tasks,":[8],"particularly":[9],"in":[10,17,89,112,174],"the":[11,18,31,39,46,50,57,70,105,137],"distribution-specific":[12,43,155],"setting.":[13],"We":[14,75,169],"show":[15,170],"that":[16,151,171,195],"\\emph{testable":[19],"learning}":[20],"model":[21],"of":[22,34,41,83,147],"Rubinfeld":[23],"and":[24,64,123,181],"Vasilyan":[25],"[RV23],":[26],"membership":[27,198],"cannot":[29,201],"decrease":[30],"time":[32],"complexity":[33,40],"testable":[35,47,93],"algorithms":[37,150,173],"beyond":[38],"sample-only":[42],"learning.":[44],"In":[45],"model,":[49],"learner":[51],"must":[52,72],"output":[53],"a":[54,61,68,77,120,124,145],"hypothesis":[55,71],"whenever":[56],"data":[58],"distribution":[59,125],"satisfies":[60],"desired":[62],"property,":[63],"if":[65],"it":[66],"outputs":[67],"hypothesis,":[69],"be":[73,132,202],"near-optimal.":[74],"give":[76],"general":[78],"reduction":[79,106],"from":[80,107],"sample-based":[81],"\\emph{refutation}":[82],"boolean":[84],"concept":[85,121],"classes,":[86],"as":[87,159],"presented":[88],"[Vadhan17,":[90],"KL18],":[91],"to":[92,109,119],"with":[95,186],"(TL-Q).":[97],"This":[98],"yields":[99],"lower":[100,190],"bounds":[101],"TL-Q":[103,129,172],"via":[104],"refutation":[110,180],"given":[111],"[KL18].":[113],"The":[114],"result":[115],"is":[116],"that,":[117],"relative":[118],"class":[122,146,176],"family,":[126],"no":[127],"$m$-sample":[128,139],"algorithm":[130],"can":[131],"super-polynomially":[133],"more":[134],"time-efficient":[135],"than":[136],"best":[138],"PAC":[140],"learner.":[141],"Finally,":[142],"we":[143],"define":[144],"``statistical''":[148],"MQ":[149,156],"encompasses":[152],"many":[153],"known":[154,187],"learners,":[157],"such":[158],"those":[160],"based":[161],"on":[162],"influence":[163],"estimation":[164],"or":[165],"subcube-conditional":[166],"statistical":[167],"queries.":[168],"this":[175],"imply":[177,194],"efficient":[178,197],"statistical-query":[179],"algorithms.":[183],"Thus,":[184],"combined":[185],"SQ":[188],"dimension":[189],"bounds,":[191],"our":[192],"results":[193],"these":[196],"query":[199],"learners":[200],"made":[203],"testable.":[204]},"counts_by_year":[],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-12-04T00:00:00"}