{"id":"https://openalex.org/W7161687166","doi":"https://doi.org/10.48550/arxiv.2605.17403","title":"Self-Supervised Learning for Sparse Matrix Reordering","display_name":"Self-Supervised Learning for Sparse Matrix Reordering","publication_year":2026,"publication_date":"2026-05-17","ids":{"openalex":"https://openalex.org/W7161687166","doi":"https://doi.org/10.48550/arxiv.2605.17403"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2605.17403","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.17403","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":null,"license_id":null,"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.2605.17403","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5136469997","display_name":"Ziwei Li","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Li, Ziwei","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5136465351","display_name":"Tao Yuan","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Yuan, Tao","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5136485950","display_name":"Fangfang Liu","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Liu, Fangfang","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5067174475","display_name":"Shuzi Niu","orcid":"https://orcid.org/0000-0001-9648-1803"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Niu, Shuzi","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5136474143","display_name":"Huiyuan Li","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Li, Huiyuan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5027481784","display_name":"Wenjia Wu","orcid":"https://orcid.org/0000-0002-4437-0850"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Wu, Wenjia","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/T12292","display_name":"Graph Theory and Algorithms","score":0.3677000105381012,"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"}},"topics":[{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.3677000105381012,"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"}},{"id":"https://openalex.org/T11273","display_name":"Advanced Graph Neural Networks","score":0.1324000060558319,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.11159999668598175,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/sparse-matrix","display_name":"Sparse matrix","score":0.703000009059906},{"id":"https://openalex.org/keywords/matrix","display_name":"Matrix (chemical analysis)","score":0.5264999866485596},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.5220000147819519},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.49950000643730164},{"id":"https://openalex.org/keywords/row","display_name":"Row","score":0.4909000098705292},{"id":"https://openalex.org/keywords/matrix-decomposition","display_name":"Matrix decomposition","score":0.4562999904155731},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.44589999318122864},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.42719998955726624},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.39629998803138733}],"concepts":[{"id":"https://openalex.org/C56372850","wikidata":"https://www.wikidata.org/wiki/Q1050404","display_name":"Sparse matrix","level":3,"score":0.703000009059906},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6360999941825867},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5831000208854675},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.5264999866485596},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.5220000147819519},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.49950000643730164},{"id":"https://openalex.org/C135598885","wikidata":"https://www.wikidata.org/wiki/Q1366302","display_name":"Row","level":2,"score":0.4909000098705292},{"id":"https://openalex.org/C42355184","wikidata":"https://www.wikidata.org/wiki/Q1361088","display_name":"Matrix decomposition","level":3,"score":0.4562999904155731},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.44589999318122864},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.42719998955726624},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.39629998803138733},{"id":"https://openalex.org/C140779682","wikidata":"https://www.wikidata.org/wiki/Q210868","display_name":"Sampling (signal processing)","level":3,"score":0.3952000141143799},{"id":"https://openalex.org/C187834632","wikidata":"https://www.wikidata.org/wiki/Q188804","display_name":"Factorization","level":2,"score":0.3930000066757202},{"id":"https://openalex.org/C5134670","wikidata":"https://www.wikidata.org/wiki/Q1626444","display_name":"Cut","level":4,"score":0.3808000087738037},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.37929999828338623},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.3668999969959259},{"id":"https://openalex.org/C104140500","wikidata":"https://www.wikidata.org/wiki/Q2088159","display_name":"Row and column spaces","level":3,"score":0.34689998626708984},{"id":"https://openalex.org/C2780551164","wikidata":"https://www.wikidata.org/wiki/Q2306599","display_name":"Column (typography)","level":3,"score":0.2962999939918518},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.29490000009536743},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.2935999929904938},{"id":"https://openalex.org/C124066611","wikidata":"https://www.wikidata.org/wiki/Q28684319","display_name":"Sparse approximation","level":2,"score":0.27970001101493835},{"id":"https://openalex.org/C54848796","wikidata":"https://www.wikidata.org/wiki/Q339011","display_name":"Symmetric matrix","level":3,"score":0.2689000070095062},{"id":"https://openalex.org/C137119250","wikidata":"https://www.wikidata.org/wiki/Q1413101","display_name":"Multigrid method","level":3,"score":0.26750001311302185},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.267300009727478},{"id":"https://openalex.org/C2778459887","wikidata":"https://www.wikidata.org/wiki/Q6787865","display_name":"Matrix completion","level":3,"score":0.2667999863624573},{"id":"https://openalex.org/C13251829","wikidata":"https://www.wikidata.org/wiki/Q3085841","display_name":"Dense graph","level":5,"score":0.263700008392334},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2630000114440918},{"id":"https://openalex.org/C54219892","wikidata":"https://www.wikidata.org/wiki/Q4080929","display_name":"Matrix-free methods","level":4,"score":0.25609999895095825},{"id":"https://openalex.org/C108583219","wikidata":"https://www.wikidata.org/wiki/Q197536","display_name":"Deep learning","level":2,"score":0.2531000077724457},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2531000077724457},{"id":"https://openalex.org/C124851039","wikidata":"https://www.wikidata.org/wiki/Q2665459","display_name":"Compressed sensing","level":2,"score":0.2526000142097473}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2605.17403","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.17403","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":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2605.17403","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.17403","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":null,"license_id":null,"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":{"Rearranging":[0],"the":[1,66,70,111,124,131,134],"rows":[2],"or":[3],"columns":[4],"of":[5,69,113,133,139],"a":[6,57,80,94],"sparse":[7,67],"matrix":[8,22,71,128],"using":[9],"an":[10,31,104],"appropriate":[11],"ordering":[12,32],"can":[13],"significantly":[14],"reduce":[15,110],"fill-ins,":[16],"i.e.,":[17],"new":[18],"nonzeros":[19],"introduced":[20],"during":[21],"factorization,":[23],"decreasing":[24],"memory":[25],"usage":[26],"and":[27,42,59,65,143],"runtime.":[28],"However,":[29],"finding":[30],"that":[33],"minimizes":[34],"fill-ins":[35],"is":[36],"NP-complete.":[37],"Existing":[38],"approaches,":[39],"including":[40],"graph-theoretic":[41],"deep":[43],"learning":[44],"methods,":[45],"rely":[46],"on":[47,99,123],"surrogate":[48],"objectives":[49],"without":[50],"theoretical":[51],"guarantees.":[52],"The":[53],"Fill-Path":[54],"Theorem":[55],"reveals":[56],"direct":[58],"intrinsic":[60],"relationship":[61],"between":[62],"fill-in":[63,141],"generation":[64],"structure":[68],"as":[72],"path":[73],"triplet":[74,95],"inequalities.":[75,100,120],"Here":[76],"we":[77,102],"first":[78],"employ":[79],"multigrid":[81],"graph":[82],"network":[83],"to":[84,109],"capture":[85],"structural":[86],"information":[87],"for":[88],"each":[89],"vertex.":[90],"We":[91],"then":[92],"derive":[93],"sampling":[96],"strategy":[97],"based":[98],"Finally,":[101],"introduce":[103],"end-max":[105],"chain":[106],"loss":[107],"function":[108],"number":[112],"triplets":[114],"whose":[115],"predicted":[116],"scores":[117],"satisfy":[118],"these":[119],"Experimental":[121],"evaluations":[122],"publicly":[125],"available":[126],"SuiteSparse":[127],"collection":[129],"demonstrate":[130],"superiority":[132],"proposed":[135],"method":[136],"in":[137,145],"terms":[138],"both":[140],"reduction":[142],"speedup":[144],"LU":[146],"factorization":[147],"time.":[148]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2026-05-20T00:00:00"}