{"id":"https://openalex.org/W4416547764","doi":"https://doi.org/10.48550/arxiv.2507.23186","title":"NaN-Propagation: A Novel Method for Sparsity Detection in Black-Box Computational Functions","display_name":"NaN-Propagation: A Novel Method for Sparsity Detection in Black-Box Computational Functions","publication_year":2025,"publication_date":"2025-07-31","ids":{"openalex":"https://openalex.org/W4416547764","doi":"https://doi.org/10.48550/arxiv.2507.23186"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2507.23186","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2507.23186","pdf_url":"https://arxiv.org/pdf/2507.23186","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":null,"license_id":null,"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/2507.23186","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5004178617","display_name":"P. K. Sharpe","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Sharpe, Peter","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5004178617"],"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.3716999888420105,"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.3716999888420105,"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/T11697","display_name":"Numerical Methods and Algorithms","score":0.2379000037908554,"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.061000000685453415,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.6334999799728394},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5196999907493591},{"id":"https://openalex.org/keywords/bottleneck","display_name":"Bottleneck","score":0.501800000667572},{"id":"https://openalex.org/keywords/exploit","display_name":"Exploit","score":0.4848000109195709},{"id":"https://openalex.org/keywords/trace","display_name":"TRACE (psycholinguistics)","score":0.4496000111103058},{"id":"https://openalex.org/keywords/property","display_name":"Property (philosophy)","score":0.39570000767707825},{"id":"https://openalex.org/keywords/encoding","display_name":"Encoding (memory)","score":0.3871999979019165},{"id":"https://openalex.org/keywords/source-code","display_name":"Source code","score":0.3765000104904175},{"id":"https://openalex.org/keywords/jacobian-matrix-and-determinant","display_name":"Jacobian matrix and determinant","score":0.3736000061035156},{"id":"https://openalex.org/keywords/simd","display_name":"SIMD","score":0.3734999895095825}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7433000206947327},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.6334999799728394},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5196999907493591},{"id":"https://openalex.org/C2780513914","wikidata":"https://www.wikidata.org/wiki/Q18210350","display_name":"Bottleneck","level":2,"score":0.501800000667572},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.4848000109195709},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.47929999232292175},{"id":"https://openalex.org/C75291252","wikidata":"https://www.wikidata.org/wiki/Q1315756","display_name":"TRACE (psycholinguistics)","level":2,"score":0.4496000111103058},{"id":"https://openalex.org/C189950617","wikidata":"https://www.wikidata.org/wiki/Q937228","display_name":"Property (philosophy)","level":2,"score":0.39570000767707825},{"id":"https://openalex.org/C125411270","wikidata":"https://www.wikidata.org/wiki/Q18653","display_name":"Encoding (memory)","level":2,"score":0.3871999979019165},{"id":"https://openalex.org/C43126263","wikidata":"https://www.wikidata.org/wiki/Q128751","display_name":"Source code","level":2,"score":0.3765000104904175},{"id":"https://openalex.org/C113775141","wikidata":"https://www.wikidata.org/wiki/Q428691","display_name":"Computer engineering","level":1,"score":0.3765000104904175},{"id":"https://openalex.org/C200331156","wikidata":"https://www.wikidata.org/wiki/Q506041","display_name":"Jacobian matrix and determinant","level":2,"score":0.3736000061035156},{"id":"https://openalex.org/C150552126","wikidata":"https://www.wikidata.org/wiki/Q339387","display_name":"SIMD","level":2,"score":0.3734999895095825},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.3652999997138977},{"id":"https://openalex.org/C152745839","wikidata":"https://www.wikidata.org/wiki/Q5438153","display_name":"Fault detection and isolation","level":3,"score":0.3560999929904938},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3463999927043915},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.3449999988079071},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.3208000063896179},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.31769999861717224},{"id":"https://openalex.org/C134066672","wikidata":"https://www.wikidata.org/wiki/Q1424639","display_name":"Payload (computing)","level":3,"score":0.3125999867916107},{"id":"https://openalex.org/C34736171","wikidata":"https://www.wikidata.org/wiki/Q918333","display_name":"Preprocessor","level":2,"score":0.304500013589859},{"id":"https://openalex.org/C118505674","wikidata":"https://www.wikidata.org/wiki/Q42586063","display_name":"Encoder","level":2,"score":0.303600013256073},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.30219998955726624},{"id":"https://openalex.org/C56372850","wikidata":"https://www.wikidata.org/wiki/Q1050404","display_name":"Sparse matrix","level":3,"score":0.287200003862381},{"id":"https://openalex.org/C2778915421","wikidata":"https://www.wikidata.org/wiki/Q3643177","display_name":"Performance improvement","level":2,"score":0.2870999872684479},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.2849999964237213},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.28220000863075256},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.27300000190734863},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.26660001277923584},{"id":"https://openalex.org/C2989134064","wikidata":"https://www.wikidata.org/wiki/Q288510","display_name":"Execution time","level":2,"score":0.26440000534057617},{"id":"https://openalex.org/C78766204","wikidata":"https://www.wikidata.org/wiki/Q555032","display_name":"Multi-core processor","level":2,"score":0.258899986743927},{"id":"https://openalex.org/C139571649","wikidata":"https://www.wikidata.org/wiki/Q1156793","display_name":"Program optimization","level":3,"score":0.25429999828338623},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2513999938964844},{"id":"https://openalex.org/C115680565","wikidata":"https://www.wikidata.org/wiki/Q5977448","display_name":"Gradient method","level":2,"score":0.2500999867916107}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:arXiv.org:2507.23186","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2507.23186","pdf_url":"https://arxiv.org/pdf/2507.23186","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"doi:10.48550/arxiv.2507.23186","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2507.23186","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:2507.23186","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2507.23186","pdf_url":"https://arxiv.org/pdf/2507.23186","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"When":[0],"numerically":[1],"evaluating":[2],"a":[3,94,111,124],"function's":[4],"gradient,":[5],"sparsity":[6,19,90,181],"detection":[7,20,182],"can":[8,43],"enable":[9,171],"substantial":[10],"computational":[11],"speedups":[12],"through":[13,70],"Jacobian":[14],"coloring":[15],"and":[16,27,80,149],"compression.":[17],"However,":[18],"techniques":[21],"for":[22],"black-box":[23,157,180],"functions":[24],"are":[25,186],"limited,":[26],"existing":[28,156,179],"finite-difference-based":[29],"methods":[30,122],"suffer":[31],"from":[32,192],"false":[33,41,98],"negatives":[34,42],"due":[35],"to":[36,49,66,144,155,189],"coincidental":[37],"zero":[38],"gradients.":[39],"These":[40],"silently":[44],"corrupt":[45],"gradient":[46,129],"calculations,":[47],"leading":[48],"difficult-to-diagnose":[50],"errors.":[51],"We":[52,100],"introduce":[53],"NaN-propagation,":[54],"which":[55,82],"exploits":[56],"the":[57,86,133],"universal":[58],"contamination":[59],"property":[60],"of":[61,97,117],"IEEE":[62,141],"754":[63,142],"Not-a-Number":[64],"values":[65],"trace":[67],"input-output":[68],"dependencies":[69,118],"floating-point":[71],"numerical":[72],"computations.":[73],"By":[74],"systematically":[75],"contaminating":[76],"inputs":[77],"with":[78],"NaN":[79,164],"observing":[81],"outputs":[83],"become":[84],"NaN,":[85],"method":[87],"reconstructs":[88],"conservative":[89],"patterns":[91],"that":[92],"eliminate":[93],"major":[95],"source":[96],"negatives.":[99],"demonstrate":[101],"this":[102],"approach":[103],"on":[104],"an":[105],"aerospace":[106],"wing":[107],"weight":[108],"model,":[109],"achieving":[110],"1.52x":[112],"speedup":[113],"while":[114],"uncovering":[115],"dozens":[116],"missed":[119],"by":[120],"conventional":[121],"--":[123],"significant":[125],"practical":[126],"improvement":[127],"since":[128],"computation":[130],"is":[131],"often":[132],"bottleneck":[134],"in":[135,197],"optimization":[136],"workflows.":[137],"The":[138],"technique":[139],"leverages":[140],"compliance":[143],"work":[145],"across":[146],"programming":[147],"languages":[148],"math":[150],"libraries":[151],"without":[152],"requiring":[153],"modifications":[154],"codes.":[158],"Furthermore,":[159],"advanced":[160],"strategies":[161],"such":[162],"as":[163],"payload":[165],"encoding":[166],"via":[167],"direct":[168],"bit":[169],"manipulation":[170],"faster-than-linear":[172],"time":[173],"complexity,":[174],"yielding":[175],"speed":[176],"improvements":[177],"over":[178],"methods.":[183],"Practical":[184],"algorithms":[185],"also":[187],"proposed":[188],"mitigate":[190],"challenges":[191],"branching":[193],"code":[194],"execution":[195],"common":[196],"engineering":[198],"applications.":[199]},"counts_by_year":[],"updated_date":"2026-03-07T16:01:11.037858","created_date":"2025-10-10T00:00:00"}