{"id":"https://openalex.org/W4415328664","doi":"https://doi.org/10.48550/arxiv.2505.15228","title":"Degree-Optimized Cumulative Polynomial Kolmogorov-Arnold Networks","display_name":"Degree-Optimized Cumulative Polynomial Kolmogorov-Arnold Networks","publication_year":2025,"publication_date":"2025-05-21","ids":{"openalex":"https://openalex.org/W4415328664","doi":"https://doi.org/10.48550/arxiv.2505.15228"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2505.15228","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2505.15228","pdf_url":"https://arxiv.org/pdf/2505.15228","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"type":"preprint","indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2505.15228","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5120054710","display_name":"Mathew Vanherreweghe","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Vanherreweghe, Mathew","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5034092931","display_name":"Lirand\u00eb Pira","orcid":"https://orcid.org/0000-0002-6305-1150"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Pira, Lirand\u00eb","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5003208881","display_name":"Patrick Rebentrost","orcid":"https://orcid.org/0000-0002-6728-8163"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Rebentrost, Patrick","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5120054710"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"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.9672999978065491,"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.9672999978065491,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.9120000004768372,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/robustness","display_name":"Robustness (evolution)","score":0.4634000062942505},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.454800009727478},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.43860000371932983},{"id":"https://openalex.org/keywords/selection","display_name":"Selection (genetic algorithm)","score":0.39410001039505005},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.3700999915599823},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.3653999865055084},{"id":"https://openalex.org/keywords/polynomial-regression","display_name":"Polynomial regression","score":0.3540000021457672},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.34850001335144043}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5260000228881836},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4779999852180481},{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.4634000062942505},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.454800009727478},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.453000009059906},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.43860000371932983},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.39410001039505005},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3901999890804291},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.3700999915599823},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3653999865055084},{"id":"https://openalex.org/C120068334","wikidata":"https://www.wikidata.org/wiki/Q45343","display_name":"Polynomial regression","level":3,"score":0.3540000021457672},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.34850001335144043},{"id":"https://openalex.org/C2776135515","wikidata":"https://www.wikidata.org/wiki/Q17143721","display_name":"Regularization (linguistics)","level":2,"score":0.34220001101493835},{"id":"https://openalex.org/C112972136","wikidata":"https://www.wikidata.org/wiki/Q7595718","display_name":"Stability (learning theory)","level":2,"score":0.33959999680519104},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"score":0.32170000672340393},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.32109999656677246},{"id":"https://openalex.org/C129785596","wikidata":"https://www.wikidata.org/wiki/Q619511","display_name":"Chebyshev polynomials","level":2,"score":0.3091999888420105},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.3009999990463257},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.30079999566078186},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.2976999878883362},{"id":"https://openalex.org/C177179195","wikidata":"https://www.wikidata.org/wiki/Q7268372","display_name":"Quadratic unconstrained binary optimization","level":4,"score":0.2743000090122223},{"id":"https://openalex.org/C83546350","wikidata":"https://www.wikidata.org/wiki/Q1139051","display_name":"Regression","level":2,"score":0.2736000120639801},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2685000002384186},{"id":"https://openalex.org/C93959086","wikidata":"https://www.wikidata.org/wiki/Q6888345","display_name":"Model selection","level":2,"score":0.26660001277923584},{"id":"https://openalex.org/C145242015","wikidata":"https://www.wikidata.org/wiki/Q774123","display_name":"Approximation theory","level":2,"score":0.2662000060081482}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:arXiv.org:2505.15228","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2505.15228","pdf_url":"https://arxiv.org/pdf/2505.15228","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"doi:10.48550/arxiv.2505.15228","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2505.15228","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":"article"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2505.15228","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2505.15228","pdf_url":"https://arxiv.org/pdf/2505.15228","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G5305115752","display_name":null,"funder_award_id":"RF2021-QEP2-02-P05","funder_id":"https://openalex.org/F4320320709","funder_display_name":"National Research Foundation Singapore"},{"id":"https://openalex.org/G5428356290","display_name":null,"funder_award_id":"NRF2021-QEP2-02-P05","funder_id":"https://openalex.org/F4320320709","funder_display_name":"National Research Foundation Singapore"}],"funders":[{"id":"https://openalex.org/F4320320671","display_name":"National Research Foundation","ror":"https://ror.org/05s0g1g46"},{"id":"https://openalex.org/F4320320709","display_name":"National Research Foundation Singapore","ror":"https://ror.org/03cpyc314"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4415328664.pdf","grobid_xml":"https://content.openalex.org/works/W4415328664.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0],"introduce":[1],"cumulative":[2],"polynomial":[3,12,80],"Kolmogorov-Arnold":[4],"networks":[5,132],"(CP-KAN),":[6],"a":[7,31,40],"neural":[8],"architecture":[9,59],"combining":[10],"Chebyshev":[11],"basis":[13],"functions":[14],"and":[15,74,90,117],"quadratic":[16],"unconstrained":[17],"binary":[18],"optimization":[19,42],"(QUBO).":[20],"Our":[21,96,122],"primary":[22],"contribution":[23],"involves":[24],"reformulating":[25],"the":[26,35],"degree":[27,50],"selection":[28,51],"problem":[29],"as":[30],"QUBO":[32],"task,":[33],"reducing":[34],"complexity":[36],"from":[37,78],"$O(D^N)$":[38],"to":[39,71,106],"single":[41],"step":[43],"per":[44],"layer.":[45],"This":[46],"approach":[47],"enables":[48],"efficient":[49],"across":[52,99],"neurons":[53],"while":[54],"maintaining":[55],"computational":[56,128],"tractability.":[57],"The":[58],"performs":[60],"well":[61],"in":[62,112,130,135],"regression":[63],"tasks":[64],"with":[65],"limited":[66],"data,":[67],"showing":[68],"good":[69],"robustness":[70],"input":[72],"scales":[73],"natural":[75],"regularization":[76],"properties":[77,91],"its":[79],"basis.":[81],"Additionally,":[82],"theoretical":[83],"analysis":[84],"establishes":[85],"connections":[86],"between":[87],"CP-KAN's":[88],"performance":[89,104],"of":[92],"financial":[93],"time":[94],"series.":[95],"empirical":[97],"validation":[98],"multiple":[100],"domains":[101],"demonstrates":[102],"competitive":[103],"compared":[105],"several":[107],"traditional":[108],"architectures":[109],"tested,":[110],"especially":[111],"scenarios":[113],"where":[114],"data":[115],"efficiency":[116],"numerical":[118],"stability":[119],"are":[120],"important.":[121],"implementation,":[123],"including":[124],"strategies":[125],"for":[126],"managing":[127],"overhead":[129],"larger":[131],"is":[133],"available":[134],"Ref.~\\citep{cpkan_implementation}.":[136]},"counts_by_year":[],"updated_date":"2026-04-21T08:09:41.155169","created_date":"2025-10-19T00:00:00"}