{"id":"https://openalex.org/W7131099204","doi":"https://doi.org/10.48550/arxiv.2602.17952","title":"Hardware-Friendly Input Expansion for Accelerating Function Approximation","display_name":"Hardware-Friendly Input Expansion for Accelerating Function Approximation","publication_year":2026,"publication_date":"2026-02-20","ids":{"openalex":"https://openalex.org/W7131099204","doi":"https://doi.org/10.48550/arxiv.2602.17952"},"language":null,"primary_location":{"id":"pmh:doi:10.48550/arxiv.2602.17952","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"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":"public-domain","license_id":"https://openalex.org/licenses/public-domain","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":null,"any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5126622330","display_name":"Hu Lou","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Lou, Hu","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5082121570","display_name":"Yinjun Gao","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Gao, Yin-Jun","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5126614224","display_name":"Dong-Xiao Zhang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Zhang, Dong-Xiao","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5050642808","display_name":"Tai-Jiao Du","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Du, Tai-Jiao","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5126649281","display_name":"Jun-Jie Zhang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Zhang, Jun-Jie","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5126642449","display_name":"Jia-Rui Zhang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Zhang, Jia-Rui","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":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.15994532,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.12960000336170197,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.12960000336170197,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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.12809999287128448,"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/T11206","display_name":"Model Reduction and Neural Networks","score":0.09690000116825104,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.6687999963760376},{"id":"https://openalex.org/keywords/function-approximation","display_name":"Function approximation","score":0.6477000117301941},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.625},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.5335999727249146},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4650999903678894},{"id":"https://openalex.org/keywords/artificial-neural-network","display_name":"Artificial neural network","score":0.45350000262260437},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.43779999017715454},{"id":"https://openalex.org/keywords/approximation-theory","display_name":"Approximation theory","score":0.39879998564720154}],"concepts":[{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.6687999963760376},{"id":"https://openalex.org/C91873725","wikidata":"https://www.wikidata.org/wiki/Q3445816","display_name":"Function approximation","level":3,"score":0.6477000117301941},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.625},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.5335999727249146},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4650999903678894},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.4636000096797943},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.460999995470047},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"score":0.45350000262260437},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.43779999017715454},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.40950000286102295},{"id":"https://openalex.org/C145242015","wikidata":"https://www.wikidata.org/wiki/Q774123","display_name":"Approximation theory","level":2,"score":0.39879998564720154},{"id":"https://openalex.org/C153658351","wikidata":"https://www.wikidata.org/wiki/Q746264","display_name":"Constant function","level":3,"score":0.38589999079704285},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.33340001106262207},{"id":"https://openalex.org/C2164484","wikidata":"https://www.wikidata.org/wiki/Q5170150","display_name":"Core (optical fiber)","level":2,"score":0.32260000705718994},{"id":"https://openalex.org/C18762648","wikidata":"https://www.wikidata.org/wiki/Q42213","display_name":"Work (physics)","level":2,"score":0.3188000023365021},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.31520000100135803},{"id":"https://openalex.org/C117148685","wikidata":"https://www.wikidata.org/wiki/Q6865376","display_name":"Minimax approximation algorithm","level":2,"score":0.2768000066280365},{"id":"https://openalex.org/C122383733","wikidata":"https://www.wikidata.org/wiki/Q865920","display_name":"Approximation error","level":2,"score":0.274399995803833},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.27399998903274536},{"id":"https://openalex.org/C62376455","wikidata":"https://www.wikidata.org/wiki/Q935210","display_name":"Spouge's approximation","level":3,"score":0.26820001006126404},{"id":"https://openalex.org/C96469262","wikidata":"https://www.wikidata.org/wiki/Q1324364","display_name":"Homogeneous space","level":2,"score":0.260699987411499},{"id":"https://openalex.org/C57869625","wikidata":"https://www.wikidata.org/wiki/Q1783502","display_name":"Rate of convergence","level":3,"score":0.25870001316070557},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.25859999656677246},{"id":"https://openalex.org/C158946198","wikidata":"https://www.wikidata.org/wiki/Q131187","display_name":"Taylor series","level":2,"score":0.2583000063896179}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:doi:10.48550/arxiv.2602.17952","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"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":"public-domain","license_id":"https://openalex.org/licenses/public-domain","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},{"id":"doi:10.48550/arxiv.2602.17952","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2602.17952","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":"public-domain","license_id":"https://openalex.org/licenses/public-domain","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"pmh:doi:10.48550/arxiv.2602.17952","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"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":"public-domain","license_id":"https://openalex.org/licenses/public-domain","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"sustainable_development_goals":[{"score":0.4832037389278412,"display_name":"No poverty","id":"https://metadata.un.org/sdg/1"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"One-dimensional":[0],"function":[1,62],"approximation":[2,19,63,139],"is":[3,24],"a":[4,58,85,173],"fundamental":[5],"problem":[6],"in":[7,53],"scientific":[8],"computing":[9],"and":[10,39,117,137,161,176],"engineering":[11],"applications.":[12],"While":[13],"neural":[14],"networks":[15],"possess":[16],"powerful":[17],"universal":[18],"capabilities,":[20],"their":[21],"optimization":[22],"process":[23],"often":[25],"hindered":[26],"by":[27,32,47,133,144],"flat":[28],"loss":[29],"landscapes":[30],"induced":[31],"parameter-space":[33],"symmetries,":[34],"leading":[35],"to":[36,83],"slow":[37],"convergence":[38,129],"poor":[40],"generalization,":[41],"particularly":[42],"for":[43,61,146,179],"high-frequency":[44],"components.":[45],"Inspired":[46],"the":[48,72,100,106,147,155],"principle":[49],"of":[50,157],"\\emph{symmetry":[51],"breaking}":[52],"physics,":[54],"this":[55],"paper":[56],"proposes":[57,172],"hardware-friendly":[59,177],"approach":[60],"through":[64],"\\emph{input-space":[65],"expansion}.":[66],"The":[67],"core":[68],"idea":[69],"involves":[70],"augmenting":[71],"original":[73],"one-dimensional":[74,111],"input":[75],"(e.g.,":[76,81,88],"$x$)":[77],"with":[78,164],"constant":[79,162],"values":[80],"$\u03c0$)":[82],"form":[84],"higher-dimensional":[86],"vector":[87],"$[\u03c0,":[89],"\u03c0,":[90,92],"x,":[91],"\u03c0]$),":[93],"effectively":[94],"breaking":[95],"parameter":[96,102],"symmetries":[97],"without":[98],"increasing":[99],"network's":[101],"count.":[103],"We":[104],"evaluate":[105],"method":[107],"on":[108,135],"ten":[109],"representative":[110],"functions,":[112],"including":[113],"smooth,":[114],"discontinuous,":[115],"high-frequency,":[116],"non-differentiable":[118],"functions.":[119],"Experimental":[120],"results":[121],"demonstrate":[122],"that":[123],"input-space":[124],"expansion":[125,159],"significantly":[126],"accelerates":[127],"training":[128],"(reducing":[130,141],"LBFGS":[131],"iterations":[132],"12\\%":[134],"average)":[136],"enhances":[138],"accuracy":[140],"final":[142],"MSE":[143],"66.3\\%":[145],"optimal":[148],"5D":[149],"expansion).":[150],"Ablation":[151],"studies":[152],"further":[153],"reveal":[154],"effects":[156],"different":[158],"dimensions":[160],"selections,":[163],"$\u03c0$":[165],"consistently":[166],"outperforming":[167],"other":[168],"constants.":[169],"Our":[170],"work":[171],"low-cost,":[174],"efficient,":[175],"technique":[178],"algorithm":[180],"design.":[181]},"counts_by_year":[],"updated_date":"2026-07-15T18:14:33.161393","created_date":"2026-02-24T00:00:00"}