{"id":"https://openalex.org/W4417077361","doi":"https://doi.org/10.48550/arxiv.2509.14836","title":"Sampling Method for Generalized Graph Signals with Pre-selected Vertices via DC Optimization","display_name":"Sampling Method for Generalized Graph Signals with Pre-selected Vertices via DC Optimization","publication_year":2025,"publication_date":"2025-09-18","ids":{"openalex":"https://openalex.org/W4417077361","doi":"https://doi.org/10.48550/arxiv.2509.14836"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2509.14836","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2509.14836","pdf_url":"https://arxiv.org/pdf/2509.14836","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/2509.14836","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5083249193","display_name":"Keitaro Yamashita","orcid":"https://orcid.org/0000-0002-5442-7582"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Yamashita, Keitaro","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5086289349","display_name":"Kazuki Naganuma","orcid":"https://orcid.org/0000-0002-7180-3017"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Naganuma, Kazuki","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5074225463","display_name":"Shunsuke Ono","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ono, Shunsuke","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5083249193"],"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.963100016117096,"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.963100016117096,"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.00430000014603138,"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/T10064","display_name":"Complex Network Analysis Techniques","score":0.003000000026077032,"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/solver","display_name":"Solver","score":0.5135999917984009},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5008999705314636},{"id":"https://openalex.org/keywords/sampling","display_name":"Sampling (signal processing)","score":0.4805000126361847},{"id":"https://openalex.org/keywords/operator","display_name":"Operator (biology)","score":0.4101000130176544},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.39809998869895935},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.3763999938964844},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.3547999858856201}],"concepts":[{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.5135999917984009},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5008999705314636},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.49320000410079956},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4918999969959259},{"id":"https://openalex.org/C140779682","wikidata":"https://www.wikidata.org/wiki/Q210868","display_name":"Sampling (signal processing)","level":3,"score":0.4805000126361847},{"id":"https://openalex.org/C17020691","wikidata":"https://www.wikidata.org/wiki/Q139677","display_name":"Operator (biology)","level":5,"score":0.4101000130176544},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.39809998869895935},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3887999951839447},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.3763999938964844},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.36079999804496765},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.3547999858856201},{"id":"https://openalex.org/C55660270","wikidata":"https://www.wikidata.org/wiki/Q5164377","display_name":"Constrained optimization","level":2,"score":0.3343000113964081},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.32829999923706055},{"id":"https://openalex.org/C165526019","wikidata":"https://www.wikidata.org/wiki/Q942557","display_name":"Maximum cut","level":3,"score":0.31290000677108765},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.29829999804496765},{"id":"https://openalex.org/C191795146","wikidata":"https://www.wikidata.org/wiki/Q3878446","display_name":"Norm (philosophy)","level":2,"score":0.28859999775886536},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.259799987077713},{"id":"https://openalex.org/C5134670","wikidata":"https://www.wikidata.org/wiki/Q1626444","display_name":"Cut","level":4,"score":0.25459998846054077},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.25099998712539673}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:arXiv.org:2509.14836","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2509.14836","pdf_url":"https://arxiv.org/pdf/2509.14836","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.2509.14836","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2509.14836","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":"article"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2509.14836","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2509.14836","pdf_url":"https://arxiv.org/pdf/2509.14836","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":{"This":[0,29],"paper":[1],"proposes":[2],"a":[3,10,34,51,90,94,120,131,142],"method":[4,56,157],"for":[5,57,108,134],"vertex-wise":[6,58],"flexible":[7,59],"sampling":[8,27,35,60],"of":[9,13,67,75,96,99,155],"broad":[11],"class":[12],"graph":[14,164],"signals,":[15],"designed":[16],"to":[17,63,179],"attain":[18],"the":[19,25,46,65,86,97,127,147,174],"best":[20,47],"possible":[21,48],"recovery":[22,49,175],"based":[23,145],"on":[24,105,146,162],"generalized":[26],"theory.":[28],"is":[30,42,61,158],"achieved":[31],"by":[32,37,125,177],"designing":[33],"operator":[36,87],"an":[38],"optimization":[39,123],"problem,":[40],"which":[41],"inherently":[43],"non-convex,":[44],"as":[45,89],"imposes":[50],"rank":[52],"constraint.":[53],"An":[54],"existing":[55,180],"able":[62],"control":[64],"number":[66,98],"active":[68,100],"vertices":[69,101,107],"but":[70],"cannot":[71],"incorporate":[72],"prior":[73,103],"knowledge":[74,104],"mandatory":[76,110],"or":[77,112],"forbidden":[78],"vertices.":[79],"To":[80,137],"address":[81],"these":[82],"challenges,":[83],"we":[84,140],"formulate":[85],"design":[88],"problem":[91,118,124],"that":[92],"handles":[93],"constraint":[95],"and":[102,130],"specific":[106],"sampling,":[109],"inclusion":[111],"exclusion.":[113],"We":[114],"transformed":[115],"this":[116],"constrained":[117],"into":[119],"difference-of-convex":[121],"(DC)":[122],"using":[126],"nuclear":[128],"norm":[129],"DC":[132,151],"penalty":[133],"vertex":[135],"selection.":[136],"solve":[138],"this,":[139],"develop":[141],"convergent":[143],"solver":[144],"general":[148],"double-proximal":[149],"gradient":[150],"algorithm.":[152],"The":[153],"effectiveness":[154],"our":[156],"demonstrated":[159],"through":[160],"experiments":[161],"various":[163],"signal":[165],"models,":[166],"including":[167],"real-world":[168],"data,":[169],"showing":[170],"superior":[171],"performance":[172],"in":[173],"accuracy":[176],"comparing":[178],"methods.":[181]},"counts_by_year":[],"updated_date":"2026-03-07T16:01:11.037858","created_date":"2025-10-10T00:00:00"}