{"id":"https://openalex.org/W7165613142","doi":"https://doi.org/10.48550/arxiv.2606.23179","title":"EML Trees Are Universal Approximators","display_name":"EML Trees Are Universal Approximators","publication_year":2026,"publication_date":"2026-06-22","ids":{"openalex":"https://openalex.org/W7165613142","doi":"https://doi.org/10.48550/arxiv.2606.23179"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2606.23179","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.23179","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":"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.23179","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5139172906","display_name":"Joe Germany","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Germany, Joe","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5139208883","display_name":"Elie Abdo","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Abdo, Elie","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5027938314","display_name":"Joseph Bakarji","orcid":"https://orcid.org/0000-0003-4050-1304"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Bakarji, Joseph","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/T11435","display_name":"Polynomial and algebraic computation","score":0.1307000070810318,"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"}},"topics":[{"id":"https://openalex.org/T11435","display_name":"Polynomial and algebraic computation","score":0.1307000070810318,"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/T12808","display_name":"Ferroelectric and Negative Capacitance Devices","score":0.0982000008225441,"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"}},{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.09160000085830688,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/property","display_name":"Property (philosophy)","score":0.573199987411499},{"id":"https://openalex.org/keywords/construct","display_name":"Construct (python library)","score":0.5357000231742859},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.515500009059906},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.4729999899864197},{"id":"https://openalex.org/keywords/artificial-neural-network","display_name":"Artificial neural network","score":0.447299987077713},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.43689998984336853},{"id":"https://openalex.org/keywords/power","display_name":"Power (physics)","score":0.42500001192092896}],"concepts":[{"id":"https://openalex.org/C189950617","wikidata":"https://www.wikidata.org/wiki/Q937228","display_name":"Property (philosophy)","level":2,"score":0.573199987411499},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5475999712944031},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.5357000231742859},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.515500009059906},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.4729999899864197},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"score":0.447299987077713},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.43689998984336853},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4320000112056732},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.427700012922287},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.42649999260902405},{"id":"https://openalex.org/C163258240","wikidata":"https://www.wikidata.org/wiki/Q25342","display_name":"Power (physics)","level":2,"score":0.42500001192092896},{"id":"https://openalex.org/C91873725","wikidata":"https://www.wikidata.org/wiki/Q3445816","display_name":"Function approximation","level":3,"score":0.41920000314712524},{"id":"https://openalex.org/C195818886","wikidata":"https://www.wikidata.org/wiki/Q5421724","display_name":"Expressive power","level":2,"score":0.40610000491142273},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.37950000166893005},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.33820000290870667},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.334199994802475},{"id":"https://openalex.org/C2776359362","wikidata":"https://www.wikidata.org/wiki/Q2145286","display_name":"Representation (politics)","level":3,"score":0.32820001244544983},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.2879999876022339},{"id":"https://openalex.org/C108010975","wikidata":"https://www.wikidata.org/wiki/Q500094","display_name":"Pruning","level":2,"score":0.2825999855995178},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.273499995470047},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2678000032901764},{"id":"https://openalex.org/C2984842247","wikidata":"https://www.wikidata.org/wiki/Q197536","display_name":"Deep neural networks","level":3,"score":0.25859999656677246}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2606.23179","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.23179","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":"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.23179","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.23179","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":"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":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"The":[0],"recently":[1],"introduced":[2],"EML":[3,35,71,101],"(Exp-Minus-Log)":[4],"function":[5,109],"acts":[6],"as":[7,103],"continuous":[8],"analogue":[9],"of":[10,19,31,34],"NAND":[11],"gates,":[12],"providing":[13],"a":[14,43,80,104],"compositional":[15],"building":[16],"block":[17],"capable":[18],"representing":[20],"elementary":[21],"functions.":[22,36],"In":[23],"this":[24],"work,":[25],"we":[26],"study":[27],"the":[28,66],"expressive":[29],"power":[30],"tree-structured":[32],"compositions":[33],"We":[37,77],"show":[38],"that":[39,73],"such":[40],"trees":[41,72,85,102],"enjoy":[42],"universal":[44],"approximation":[45,62],"property":[46],"for":[47,52,83,108],"functions":[48],"in":[49,94],"$W^{k,":[50],"\\infty}$":[51],"$k":[53],"\\in":[54],"\\mathbb":[55],"N$,":[56],"drawing":[57],"on":[58],"classical":[59],"neural":[60],"network":[61],"arguments":[63],"while":[64],"exploiting":[65],"ability":[67],"to":[68],"explicitly":[69],"construct":[70],"mimic":[74],"polynomial":[75],"representations.":[76],"further":[78],"propose":[79],"learning":[81],"algorithm":[82],"EML-type":[84],"equipped":[86],"with":[87],"fitting":[88],"parameters,":[89],"and":[90],"demonstrate":[91],"its":[92],"feasibility":[93],"practical":[95],"optimization":[96],"problems.":[97],"Our":[98],"results":[99],"establish":[100],"theoretically":[105],"grounded":[106],"framework":[107],"approximation.":[110]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-06-24T00:00:00"}