{"id":"https://openalex.org/W7158501978","doi":"https://doi.org/10.48550/arxiv.2604.26132","title":"Sparse Graph Learning from Sparse Data via Fiedler Number Maximization","display_name":"Sparse Graph Learning from Sparse Data via Fiedler Number Maximization","publication_year":2026,"publication_date":"2026-04-28","ids":{"openalex":"https://openalex.org/W7158501978","doi":"https://doi.org/10.48550/arxiv.2604.26132"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2604.26132","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.26132","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.2604.26132","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5134895950","display_name":"Bahar Oveisgharan","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Oveisgharan, Bahar","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5038897476","display_name":"Gene Cheung","orcid":"https://orcid.org/0000-0002-5571-4137"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Cheung, Gene","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5109853225","display_name":"Andrew Eckford","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Eckford, Andrew","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/T11273","display_name":"Advanced Graph Neural Networks","score":0.7077000141143799,"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/T11273","display_name":"Advanced Graph Neural Networks","score":0.7077000141143799,"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/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.16249999403953552,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"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/T10057","display_name":"Face and Expression Recognition","score":0.02019999921321869,"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/dense-graph","display_name":"Dense graph","score":0.6790000200271606},{"id":"https://openalex.org/keywords/laplacian-matrix","display_name":"Laplacian matrix","score":0.6586999893188477},{"id":"https://openalex.org/keywords/graph-bandwidth","display_name":"Graph bandwidth","score":0.5241000056266785},{"id":"https://openalex.org/keywords/complement-graph","display_name":"Complement graph","score":0.512499988079071},{"id":"https://openalex.org/keywords/sparse-matrix","display_name":"Sparse matrix","score":0.4758000075817108},{"id":"https://openalex.org/keywords/sparse-approximation","display_name":"Sparse approximation","score":0.47429999709129333},{"id":"https://openalex.org/keywords/eigenvalues-and-eigenvectors","display_name":"Eigenvalues and eigenvectors","score":0.4708000123500824},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.4666000008583069},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.4643000066280365},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.45899999141693115}],"concepts":[{"id":"https://openalex.org/C13251829","wikidata":"https://www.wikidata.org/wiki/Q3085841","display_name":"Dense graph","level":5,"score":0.6790000200271606},{"id":"https://openalex.org/C115178988","wikidata":"https://www.wikidata.org/wiki/Q772067","display_name":"Laplacian matrix","level":3,"score":0.6586999893188477},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5462999939918518},{"id":"https://openalex.org/C134727501","wikidata":"https://www.wikidata.org/wiki/Q5597073","display_name":"Graph bandwidth","level":5,"score":0.5241000056266785},{"id":"https://openalex.org/C168291704","wikidata":"https://www.wikidata.org/wiki/Q902252","display_name":"Complement graph","level":5,"score":0.512499988079071},{"id":"https://openalex.org/C56372850","wikidata":"https://www.wikidata.org/wiki/Q1050404","display_name":"Sparse matrix","level":3,"score":0.4758000075817108},{"id":"https://openalex.org/C124066611","wikidata":"https://www.wikidata.org/wiki/Q28684319","display_name":"Sparse approximation","level":2,"score":0.47429999709129333},{"id":"https://openalex.org/C158693339","wikidata":"https://www.wikidata.org/wiki/Q190524","display_name":"Eigenvalues and eigenvectors","level":2,"score":0.4708000123500824},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.4666000008583069},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.4643000066280365},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.45899999141693115},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.44859999418258667},{"id":"https://openalex.org/C19332903","wikidata":"https://www.wikidata.org/wiki/Q7623247","display_name":"Strength of a graph","level":5,"score":0.447299987077713},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.44620001316070557},{"id":"https://openalex.org/C78913703","wikidata":"https://www.wikidata.org/wiki/Q5597087","display_name":"Graph energy","level":5,"score":0.43950000405311584},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.4081999957561493},{"id":"https://openalex.org/C7948225","wikidata":"https://www.wikidata.org/wiki/Q4723998","display_name":"Algebraic connectivity","level":4,"score":0.40720000863075256},{"id":"https://openalex.org/C17169500","wikidata":"https://www.wikidata.org/wiki/Q3033506","display_name":"Null graph","level":5,"score":0.4058000147342682},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.40529999136924744},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3822000026702881},{"id":"https://openalex.org/C180356752","wikidata":"https://www.wikidata.org/wiki/Q727035","display_name":"Adjacency matrix","level":3,"score":0.38190001249313354},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.34700000286102295},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.34619998931884766},{"id":"https://openalex.org/C5134670","wikidata":"https://www.wikidata.org/wiki/Q1626444","display_name":"Cut","level":4,"score":0.34549999237060547},{"id":"https://openalex.org/C2776135515","wikidata":"https://www.wikidata.org/wiki/Q17143721","display_name":"Regularization (linguistics)","level":2,"score":0.3310999870300293},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.33009999990463257},{"id":"https://openalex.org/C145580432","wikidata":"https://www.wikidata.org/wiki/Q6497118","display_name":"Lattice graph","level":5,"score":0.3203999996185303},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3163999915122986},{"id":"https://openalex.org/C165700671","wikidata":"https://www.wikidata.org/wiki/Q203484","display_name":"Laplace operator","level":2,"score":0.31060001254081726},{"id":"https://openalex.org/C123482549","wikidata":"https://www.wikidata.org/wiki/Q826467","display_name":"Regular graph","level":5,"score":0.3089999854564667},{"id":"https://openalex.org/C53052385","wikidata":"https://www.wikidata.org/wiki/Q17104046","display_name":"Mixed graph","level":5,"score":0.30160000920295715},{"id":"https://openalex.org/C173547177","wikidata":"https://www.wikidata.org/wiki/Q1503271","display_name":"Geometric graph theory","level":5,"score":0.29750001430511475},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.29440000653266907},{"id":"https://openalex.org/C74003402","wikidata":"https://www.wikidata.org/wiki/Q3180727","display_name":"Spectral graph theory","level":5,"score":0.2822999954223633},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.27880001068115234},{"id":"https://openalex.org/C148067565","wikidata":"https://www.wikidata.org/wiki/Q3323718","display_name":"Moral graph","level":5,"score":0.2750000059604645},{"id":"https://openalex.org/C124851039","wikidata":"https://www.wikidata.org/wiki/Q2665459","display_name":"Compressed sensing","level":2,"score":0.27239999175071716},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.27160000801086426},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.26429998874664307},{"id":"https://openalex.org/C64339825","wikidata":"https://www.wikidata.org/wiki/Q722659","display_name":"Graph property","level":5,"score":0.2621999979019165}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2604.26132","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.26132","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.2604.26132","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.26132","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":[{"display_name":"Reduced inequalities","score":0.5411067008972168,"id":"https://metadata.un.org/sdg/10"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,69],"aim":[1],"to":[2,83,100,129],"learn":[3],"a":[4,59,72,107],"sparse":[5,10,65,143,148],"and":[6,32],"connected":[7],"graph":[8,52,66,120,144,149],"from":[9],"data,":[11],"where":[12],"the":[13,23,33,51,64,85,93,101,112],"number":[14,46,140],"of":[15,50,96],"observations":[16],"K":[17],"can":[18],"be":[19],"substantially":[20],"smaller":[21],"than":[22],"signal":[24],"dimension":[25],"N":[26],"for":[27,81],"signals":[28],"x":[29],"in":[30,63],"R^N,":[31],"underlying":[34],"distribution":[35],"is":[36],"unknown.":[37],"In":[38],"this":[39],"severely":[40],"ill-posed":[41],"setting,":[42],"we":[43,105],"incorporate":[44],"Fiedler":[45,102,139],"(the":[47],"second":[48],"eigenvalue":[49,88],"Laplacian":[53],"matrix":[54],"that":[55,75,91,115,138],"quantifies":[56],"connectedness)":[57],"as":[58],"robust":[60],"regularization":[61],"term":[62],"learning":[67,150],"objective.":[68],"first":[70],"develop":[71],"greedy":[73],"algorithm":[74],"iteratively":[76],"selects":[77],"one":[78],"edge":[79,98],"globally":[80],"weakening/removal":[82],"reduce":[84],"objective,":[86],"leveraging":[87],"perturbation":[89],"theorems":[90],"bound":[92],"adverse":[94],"effect":[95],"an":[97,118,125,132],"change":[99],"number.":[103],"Next,":[104],"design":[106],"parallel":[108],"variant,":[109],"based":[110],"on":[111],"Cheeger's":[113],"inequality,":[114],"recursively":[116],"partitions":[117],"input":[119],"into":[121],"two":[122],"sub-graphs":[123],"using":[124],"approximate":[126],"Cheeger":[127],"cut":[128],"distributedly":[130],"find":[131],"optimal":[133],"edge.":[134],"Simulation":[135],"experiments":[136],"show":[137],"maximization":[141],"robustifies":[142],"estimates,":[145],"outperforming":[146],"previous":[147],"algorithms.":[151]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2026-05-01T00:00:00"}