{"id":"https://openalex.org/W7164002335","doi":"https://doi.org/10.48550/arxiv.2606.08727","title":"Compositional Approximation Can Strictly Outperform Superpositional Approximation","display_name":"Compositional Approximation Can Strictly Outperform Superpositional Approximation","publication_year":2026,"publication_date":"2026-06-07","ids":{"openalex":"https://openalex.org/W7164002335","doi":"https://doi.org/10.48550/arxiv.2606.08727"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2606.08727","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.08727","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":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.2606.08727","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5050647563","display_name":"Dennis Elbr\u00e4chter","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Elbr\u00e4chter, Dennis","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5138280711","display_name":"Philipp Petersen","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Petersen, Philipp","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/T10320","display_name":"Neural Networks and Applications","score":0.538100004196167,"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/T10320","display_name":"Neural Networks and Applications","score":0.538100004196167,"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.16609999537467957,"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/T12808","display_name":"Ferroelectric and Negative Capacitance Devices","score":0.0478999987244606,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.6141999959945679},{"id":"https://openalex.org/keywords/approximation-error","display_name":"Approximation error","score":0.5774000287055969},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.5713000297546387},{"id":"https://openalex.org/keywords/function-approximation","display_name":"Function approximation","score":0.5626999735832214},{"id":"https://openalex.org/keywords/limit","display_name":"Limit (mathematics)","score":0.5515000224113464},{"id":"https://openalex.org/keywords/string","display_name":"String (physics)","score":0.5490000247955322},{"id":"https://openalex.org/keywords/approximation-theory","display_name":"Approximation theory","score":0.548799991607666},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5295000076293945},{"id":"https://openalex.org/keywords/linear-approximation","display_name":"Linear approximation","score":0.5260000228881836}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7491000294685364},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.6141999959945679},{"id":"https://openalex.org/C122383733","wikidata":"https://www.wikidata.org/wiki/Q865920","display_name":"Approximation error","level":2,"score":0.5774000287055969},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.5713000297546387},{"id":"https://openalex.org/C91873725","wikidata":"https://www.wikidata.org/wiki/Q3445816","display_name":"Function approximation","level":3,"score":0.5626999735832214},{"id":"https://openalex.org/C151201525","wikidata":"https://www.wikidata.org/wiki/Q177239","display_name":"Limit (mathematics)","level":2,"score":0.5515000224113464},{"id":"https://openalex.org/C157486923","wikidata":"https://www.wikidata.org/wiki/Q1376436","display_name":"String (physics)","level":2,"score":0.5490000247955322},{"id":"https://openalex.org/C145242015","wikidata":"https://www.wikidata.org/wiki/Q774123","display_name":"Approximation theory","level":2,"score":0.548799991607666},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5295000076293945},{"id":"https://openalex.org/C160824197","wikidata":"https://www.wikidata.org/wiki/Q2071054","display_name":"Linear approximation","level":3,"score":0.5260000228881836},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.515500009059906},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.46779999136924744},{"id":"https://openalex.org/C117148685","wikidata":"https://www.wikidata.org/wiki/Q6865376","display_name":"Minimax approximation algorithm","level":2,"score":0.4327999949455261},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.34610000252723694},{"id":"https://openalex.org/C18762648","wikidata":"https://www.wikidata.org/wiki/Q42213","display_name":"Work (physics)","level":2,"score":0.30889999866485596},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.30469998717308044},{"id":"https://openalex.org/C62376455","wikidata":"https://www.wikidata.org/wiki/Q935210","display_name":"Spouge's approximation","level":3,"score":0.2921999990940094},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.29030001163482666},{"id":"https://openalex.org/C193386753","wikidata":"https://www.wikidata.org/wiki/Q1130396","display_name":"Approximations of \u03c0","level":2,"score":0.2761000096797943},{"id":"https://openalex.org/C2778199601","wikidata":"https://www.wikidata.org/wiki/Q5165476","display_name":"Continuous function (set theory)","level":3,"score":0.27559998631477356},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.26179999113082886},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"score":0.25699999928474426},{"id":"https://openalex.org/C2776359362","wikidata":"https://www.wikidata.org/wiki/Q2145286","display_name":"Representation (politics)","level":3,"score":0.25589999556541443},{"id":"https://openalex.org/C148043351","wikidata":"https://www.wikidata.org/wiki/Q4456944","display_name":"Current (fluid)","level":2,"score":0.2529999911785126},{"id":"https://openalex.org/C2780009758","wikidata":"https://www.wikidata.org/wiki/Q6804172","display_name":"Measure (data warehouse)","level":2,"score":0.25}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2606.08727","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.08727","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":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2606.08727","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.08727","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":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[{"display_name":"Reduced inequalities","score":0.4157683849334717,"id":"https://metadata.un.org/sdg/10"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Many":[0],"classically":[1],"studied":[2],"function":[3,38,110],"classes":[4,111],"are":[5,84],"known":[6],"to":[7,70,73,120],"be":[8,60,91,121],"approximated":[9],"optimally":[10],"by":[11,53,94],"superpositional":[12,117],"methods,":[13],"i.e.":[14],"with":[15],"approximants":[16],"constructed":[17],"as":[18,36,62],"the":[19,31,40,49,74],"linear":[20],"combination":[21],"of":[22,39,42,48,66,76],"elements":[23],"in":[24],"some":[25],"dictionary.":[26],"Here":[27],"optimality":[28],"means":[29],"that":[30,97,115],"uniform":[32],"approximation":[33,88,118,126],"error":[34],"viewed":[35],"a":[37,63,100],"number":[41,75],"parameters":[43,58],"used":[44],"has":[45],"polynomial":[46],"decay":[47],"highest":[50],"order":[51],"achievable":[52],"any":[54],"parametrized":[55],"method":[56],"whose":[57],"can":[59,90],"encoded":[61],"bit":[64,102],"string":[65,103],"length":[67],"proportional,":[68],"up":[69],"logarithmic":[71],"factors,":[72],"parameters.":[77],"While":[78],"compositional":[79,125],"methods":[80],"like":[81],"neural":[82],"networks":[83],"structurally":[85],"different,":[86],"their":[87],"rates":[89,119],"made":[92],"comparable":[93],"imposing":[95],"constraints":[96],"ensure":[98],"such":[99],"proportional":[101],"encoding.":[104],"In":[105,128],"this":[106],"work":[107],"we":[108,130],"study":[109],"exhibiting":[112],"structural":[113],"properties":[114],"limit":[116],"strictly":[122],"lower":[123],"than":[124],"rates.":[127],"particular,":[129],"construct":[131],"explicit":[132],"examples":[133],"for":[134],"which":[135],"there":[136],"is":[137],"an":[138],"arbitrarily":[139],"large":[140],"gap.":[141]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2026-06-10T00:00:00"}