{"id":"https://openalex.org/W7135244161","doi":"https://doi.org/10.48550/arxiv.2603.11161","title":"Algorithmic Task Capture, Computational Complexity, and Inductive Bias of Infinite Transformers","display_name":"Algorithmic Task Capture, Computational Complexity, and Inductive Bias of Infinite Transformers","publication_year":2026,"publication_date":"2026-03-11","ids":{"openalex":"https://openalex.org/W7135244161","doi":"https://doi.org/10.48550/arxiv.2603.11161"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2603.11161","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.11161","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2603.11161","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5091822383","display_name":"Orit Davidovich","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Davidovich, Orit","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5053390682","display_name":"Zohar Ringel","orcid":"https://orcid.org/0000-0002-2555-7695"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ringel, Zohar","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"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.31299999356269836,"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.31299999356269836,"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/T12535","display_name":"Machine Learning and Data Classification","score":0.07519999891519547,"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/T10320","display_name":"Neural Networks and Applications","score":0.06849999725818634,"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/inductive-bias","display_name":"Inductive bias","score":0.6881999969482422},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.5365999937057495},{"id":"https://openalex.org/keywords/transformer","display_name":"Transformer","score":0.5080000162124634},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.4611999988555908},{"id":"https://openalex.org/keywords/artificial-neural-network","display_name":"Artificial neural network","score":0.4544000029563904},{"id":"https://openalex.org/keywords/sample-complexity","display_name":"Sample complexity","score":0.351500004529953}],"concepts":[{"id":"https://openalex.org/C197352929","wikidata":"https://www.wikidata.org/wiki/Q1074074","display_name":"Inductive bias","level":4,"score":0.6881999969482422},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.5365999937057495},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5181999802589417},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5103999972343445},{"id":"https://openalex.org/C66322947","wikidata":"https://www.wikidata.org/wiki/Q11658","display_name":"Transformer","level":3,"score":0.5080000162124634},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.4611999988555908},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"score":0.4544000029563904},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.37929999828338623},{"id":"https://openalex.org/C2778445095","wikidata":"https://www.wikidata.org/wiki/Q18354077","display_name":"Sample complexity","level":2,"score":0.351500004529953},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.3431999981403351},{"id":"https://openalex.org/C176248197","wikidata":"https://www.wikidata.org/wiki/Q458526","display_name":"Probably approximately correct learning","level":4,"score":0.33959999680519104},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.33660000562667847},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3334999978542328},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.2971999943256378},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2565000057220459},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.2524999976158142}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2603.11161","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.11161","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2603.11161","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.11161","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":"Preprint"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,85],"formally":[1],"define":[2],"algorithmic":[3,100],"capture":[4,54,112],"of":[5,11,48,53,77],"combinatorial":[6,79,115],"tasks":[7,80,116],"as":[8,118],"the":[9,63,73,78,103],"ability":[10],"a":[12,28],"transformer":[13],"to":[14,16,45],"extrapolate":[15],"arbitrary":[17],"task":[18],"sizes":[19],"with":[20,110],"controllable":[21],"error":[22],"and":[23,55,65,122],"logarithmic":[24],"sample":[25],"adaptation,":[26],"providing":[27],"sharp":[29],"scaling":[30,41],"criterion":[31],"for":[32],"distinguishing":[33],"logic":[34],"internalization":[35],"from":[36],"statistical":[37],"interpolation.":[38],"Empirically,":[39],"across":[40],"ranges":[42],"spanning":[43],"up":[44],"2.5":[46],"orders":[47],"magnitude,":[49],"we":[50,68],"observe":[51],"evidence":[52],"non-capture.":[56],"By":[57],"analyzing":[58],"infinite-width":[59],"transformers":[60,92],"in":[61],"both":[62],"lazy":[64],"rich":[66],"regimes,":[67],"derive":[69],"upper":[70],"bounds":[71],"on":[72,113],"inference-time":[74],"computational":[75],"complexity":[76],"these":[81],"networks":[82],"can":[83],"capture.":[84],"show":[86],"that,":[87],"despite":[88],"their":[89],"universal":[90],"expressivity,":[91],"possess":[93],"an":[94],"inductive":[95],"bias":[96],"that":[97],"disfavors":[98],"higher-complexity":[99],"procedures":[101],"within":[102],"efficient":[104],"polynomial-time":[105],"heuristic":[106],"scheme":[107],"class,":[108],"consistent":[109],"successful":[111],"simpler":[114],"such":[117],"induction":[119],"heads,":[120],"sort,":[121],"string":[123],"matching.":[124]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-03-14T00:00:00"}