{"id":"https://openalex.org/W3117686476","doi":"https://doi.org/10.1007/s00037-024-00261-4","title":"Learning algorithms from circuit lower bounds","display_name":"Learning algorithms from circuit lower bounds","publication_year":2025,"publication_date":"2025-03-27","ids":{"openalex":"https://openalex.org/W3117686476","doi":"https://doi.org/10.1007/s00037-024-00261-4","mag":"3117686476"},"language":"en","primary_location":{"id":"doi:10.1007/s00037-024-00261-4","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00037-024-00261-4","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00037-024-00261-4.pdf","source":{"id":"https://openalex.org/S193995496","display_name":"Computational Complexity","issn_l":"1016-3328","issn":["1016-3328","1420-8954"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320186","host_organization_name":"Birkh\u00e4user","host_organization_lineage":["https://openalex.org/P4310320186","https://openalex.org/P4310319900"],"host_organization_lineage_names":["Birkh\u00e4user","Springer Science+Business Media"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"computational complexity","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s00037-024-00261-4.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5059921367","display_name":"J\u00e1n Pich","orcid":"https://orcid.org/0000-0002-2731-1330"},"institutions":[{"id":"https://openalex.org/I40120149","display_name":"University of Oxford","ror":"https://ror.org/052gg0110","country_code":"GB","type":"education","lineage":["https://openalex.org/I40120149"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"J\u00e1n Pich","raw_affiliation_strings":["Department of Computer Science, University of Oxford, Parks Road, Oxford, OX1 3QD, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Oxford, Parks Road, Oxford, OX1 3QD, UK","institution_ids":["https://openalex.org/I40120149"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5059921367"],"corresponding_institution_ids":["https://openalex.org/I40120149"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":{"value":2290,"currency":"EUR","value_usd":2890},"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.00016471,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"34","issue":"1","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.9998999834060669,"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.9998999834060669,"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.9997000098228455,"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/T12288","display_name":"Optimization and Search Problems","score":0.996399998664856,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/computer-science","display_name":"Computer science","score":0.5165678262710571},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5120985507965088}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5165678262710571},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5120985507965088}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/s00037-024-00261-4","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00037-024-00261-4","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00037-024-00261-4.pdf","source":{"id":"https://openalex.org/S193995496","display_name":"Computational Complexity","issn_l":"1016-3328","issn":["1016-3328","1420-8954"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320186","host_organization_name":"Birkh\u00e4user","host_organization_lineage":["https://openalex.org/P4310320186","https://openalex.org/P4310319900"],"host_organization_lineage_names":["Birkh\u00e4user","Springer Science+Business Media"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"computational complexity","raw_type":"journal-article"},{"id":"mag:3117686476","is_oa":true,"landing_page_url":"http://export.arxiv.org/pdf/2012.14095v1","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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv (Cornell University)","raw_type":null},{"id":"pmh:oai:ora.ox.ac.uk:uuid:2e31e017-e5e3-4f79-96fc-6d9487ea156f","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4306402636","display_name":"Oxford University Research Archive (ORA) (University of Oxford)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I40120149","host_organization_name":"University of Oxford","host_organization_lineage":["https://openalex.org/I40120149"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Jisc Publications Router","raw_type":"http://purl.org/coar/resource_type/c_dcae04bc"}],"best_oa_location":{"id":"doi:10.1007/s00037-024-00261-4","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00037-024-00261-4","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00037-024-00261-4.pdf","source":{"id":"https://openalex.org/S193995496","display_name":"Computational Complexity","issn_l":"1016-3328","issn":["1016-3328","1420-8954"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320186","host_organization_name":"Birkh\u00e4user","host_organization_lineage":["https://openalex.org/P4310320186","https://openalex.org/P4310319900"],"host_organization_lineage_names":["Birkh\u00e4user","Springer Science+Business Media"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"computational complexity","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W3117686476.pdf"},"referenced_works_count":49,"referenced_works":["https://openalex.org/W959768158","https://openalex.org/W1542523297","https://openalex.org/W1566084191","https://openalex.org/W1856342626","https://openalex.org/W1882771262","https://openalex.org/W1964394232","https://openalex.org/W1964615815","https://openalex.org/W1979397185","https://openalex.org/W1998918799","https://openalex.org/W2032716871","https://openalex.org/W2042194938","https://openalex.org/W2054013713","https://openalex.org/W2054191060","https://openalex.org/W2061209875","https://openalex.org/W2071204190","https://openalex.org/W2079068382","https://openalex.org/W2088263428","https://openalex.org/W2106792056","https://openalex.org/W2114400329","https://openalex.org/W2114451680","https://openalex.org/W2163083173","https://openalex.org/W2165277926","https://openalex.org/W2165743239","https://openalex.org/W2488247662","https://openalex.org/W2573933663","https://openalex.org/W2610818722","https://openalex.org/W2888575364","https://openalex.org/W2912080987","https://openalex.org/W2951756435","https://openalex.org/W2952032520","https://openalex.org/W2962874533","https://openalex.org/W2964773335","https://openalex.org/W2971710618","https://openalex.org/W2972703483","https://openalex.org/W2997373829","https://openalex.org/W3034628227","https://openalex.org/W3044255505","https://openalex.org/W3046459465","https://openalex.org/W3046794039","https://openalex.org/W3099584711","https://openalex.org/W3100374959","https://openalex.org/W3102712431","https://openalex.org/W3152990700","https://openalex.org/W3167613576","https://openalex.org/W3175558710","https://openalex.org/W4211118908","https://openalex.org/W4248733413","https://openalex.org/W4390098157","https://openalex.org/W4408690818"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2899084033","https://openalex.org/W2748952813","https://openalex.org/W2051487156","https://openalex.org/W2073681303","https://openalex.org/W2390279801","https://openalex.org/W4391913857","https://openalex.org/W2358668433","https://openalex.org/W4396701345","https://openalex.org/W2376932109"],"abstract_inverted_index":{"Abstract":[0],"We":[1,168],"revisit":[2],"known":[3,150],"constructions":[4,151],"of":[5,12,30,58,93,107,115,126,139,149,152,163,173,184],"efficient":[6,24],"learning":[7,108,153,161],"algorithms":[8,26,109,154],"from":[9,155],"various":[10],"notions":[11],"constructive":[13],"circuit":[14,140,156],"lower":[15,141,157],"bounds":[16,142,158],"such":[17],"as":[18,100],"distinguishers":[19],"breaking":[20],"pseudorandom":[21],"generators":[22,129],"or":[23],"witnessing":[25],"which":[27],"find":[28,50],"errors":[29,57],"small":[31],"circuits":[32,66,79,92],"attempting":[33,67],"to":[34,49,68,136,180],"compute":[35],"hard":[36,70],"functions.":[37],"As":[38],"our":[39],"main":[40],"result,":[41],"we":[42],"prove":[43],"that":[44],"if":[45],"it":[46],"is":[47,121,159],"possible":[48],"efficiently,":[51],"in":[52,143],"a":[53,104,124,160],"particular":[54],"interactive":[55],"way,":[56],"many":[59],"$$p$$":[60,73],"<mml:math":[61,74],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">":[62,75],"<mml:mi>p</mml:mi>":[63,76],"</mml:math>":[64,77],"-size":[65,78],"solve":[69],"problems,":[71],"then":[72],"can":[80],"be":[81],"PAC":[82],"learned":[83],"over":[84],"the":[85,111,182],"uniform":[86],"distribution":[87],"with":[88],"membership":[89],"queries":[90],"by":[91,131],"subexponential":[94],"size.":[95],"The":[96,119],"opposite":[97],"implication":[98],"holds":[99],"well.":[101],"This":[102],"provides":[103],"new":[105],"characterization":[106],"and":[110,117,134,165,176],"natural":[112],"proofs":[113],"barrier":[114],"Razborov":[116],"Rudich.":[118],"proof":[120,172],"based":[122],"on":[123],"method":[125],"reconstructing":[127],"Nisan-Wigderson":[128],"introduced":[130],"Kraj\u00ed\u010dek":[132],"(2010)":[133],"used":[135],"analyze":[137],"complexity":[138],"bounded":[144],"arithmetic.":[145],"An":[146],"interesting":[147],"consequence":[148],"speedup":[162],"Oliveira":[164],"Santhanam":[166],"(2016).":[167],"present":[169],"an":[170],"alternative":[171],"this":[174],"phenomenon":[175],"discuss":[177],"its":[178],"potential":[179],"advance":[181],"program":[183],"hardness":[185],"magnification.":[186]},"counts_by_year":[{"year":2021,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}