{"id":"https://openalex.org/W2946515652","doi":"https://doi.org/10.1145/3292500.3330915","title":"Dual Averaging Method for Online Graph-structured Sparsity","display_name":"Dual Averaging Method for Online Graph-structured Sparsity","publication_year":2019,"publication_date":"2019-07-25","ids":{"openalex":"https://openalex.org/W2946515652","doi":"https://doi.org/10.1145/3292500.3330915","mag":"2946515652"},"language":"en","primary_location":{"id":"doi:10.1145/3292500.3330915","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3292500.3330915","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3292500.3330915","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3292500.3330915","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Baojian Zhou","orcid":null},"institutions":[{"id":"https://openalex.org/I392282","display_name":"University at Albany, State University of New York","ror":"https://ror.org/012zs8222","country_code":"US","type":"education","lineage":["https://openalex.org/I392282"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Baojian Zhou","raw_affiliation_strings":["University at Albany, SUNY, ALBANY, NY, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University at Albany, SUNY, ALBANY, NY, USA","institution_ids":["https://openalex.org/I392282"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Feng Chen","orcid":null},"institutions":[{"id":"https://openalex.org/I392282","display_name":"University at Albany, State University of New York","ror":"https://ror.org/012zs8222","country_code":"US","type":"education","lineage":["https://openalex.org/I392282"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Feng Chen","raw_affiliation_strings":["University at Albany, SUNY, ALBANY, NY, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University at Albany, SUNY, ALBANY, NY, USA","institution_ids":["https://openalex.org/I392282"]}]},{"author_position":"last","author":{"id":null,"display_name":"Yiming Ying","orcid":null},"institutions":[{"id":"https://openalex.org/I392282","display_name":"University at Albany, State University of New York","ror":"https://ror.org/012zs8222","country_code":"US","type":"education","lineage":["https://openalex.org/I392282"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yiming Ying","raw_affiliation_strings":["University at Albany, SUNY, Albany, NY, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University at Albany, SUNY, Albany, NY, USA","institution_ids":["https://openalex.org/I392282"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I392282"],"apc_list":null,"apc_paid":null,"fwci":0.328,"has_fulltext":true,"cited_by_count":7,"citation_normalized_percentile":{"value":0.58740256,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"436","last_page":"446"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11273","display_name":"Advanced Graph Neural Networks","score":0.9890999794006348,"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.9890999794006348,"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/T11307","display_name":"Domain Adaptation and Few-Shot Learning","score":0.9797999858856201,"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.9778000116348267,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.6991999745368958},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.5475999712944031},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5045999884605408},{"id":"https://openalex.org/keywords/online-learning","display_name":"Online learning","score":0.4702000021934509},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.4650000035762787},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.42149999737739563},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.40059998631477356},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.3531999886035919},{"id":"https://openalex.org/keywords/baseline","display_name":"Baseline (sea)","score":0.351500004529953}],"concepts":[{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.6991999745368958},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6280999779701233},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.5475999712944031},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5045999884605408},{"id":"https://openalex.org/C2986087404","wikidata":"https://www.wikidata.org/wiki/Q15946010","display_name":"Online learning","level":2,"score":0.4702000021934509},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.46799999475479126},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.4650000035762787},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.42149999737739563},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.4027999937534332},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.40059998631477356},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3785000145435333},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.3531999886035919},{"id":"https://openalex.org/C12725497","wikidata":"https://www.wikidata.org/wiki/Q810247","display_name":"Baseline (sea)","level":2,"score":0.351500004529953},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.3495999872684479},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.3479999899864197},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.3472999930381775},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.3368000090122223},{"id":"https://openalex.org/C112313634","wikidata":"https://www.wikidata.org/wiki/Q7886648","display_name":"Complement (music)","level":5,"score":0.3327000141143799},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.31940001249313354},{"id":"https://openalex.org/C148483581","wikidata":"https://www.wikidata.org/wiki/Q446488","display_name":"Feature selection","level":2,"score":0.31520000100135803},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3131999969482422},{"id":"https://openalex.org/C12267149","wikidata":"https://www.wikidata.org/wiki/Q282453","display_name":"Support vector machine","level":2,"score":0.298799991607666},{"id":"https://openalex.org/C2987595161","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Optimization algorithm","level":2,"score":0.28760001063346863},{"id":"https://openalex.org/C2780490138","wikidata":"https://www.wikidata.org/wiki/Q7079636","display_name":"Offline learning","level":3,"score":0.27950000762939453},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.26930001378059387},{"id":"https://openalex.org/C22367795","wikidata":"https://www.wikidata.org/wiki/Q7625208","display_name":"Structured prediction","level":2,"score":0.2671999931335449},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.26669999957084656},{"id":"https://openalex.org/C198531522","wikidata":"https://www.wikidata.org/wiki/Q485146","display_name":"Sample (material)","level":2,"score":0.25429999828338623},{"id":"https://openalex.org/C2780102126","wikidata":"https://www.wikidata.org/wiki/Q10928179","display_name":"Online and offline","level":2,"score":0.25279998779296875},{"id":"https://openalex.org/C59404180","wikidata":"https://www.wikidata.org/wiki/Q17013334","display_name":"Feature learning","level":2,"score":0.2508000135421753}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3292500.3330915","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3292500.3330915","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3292500.3330915","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:1905.10714","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1905.10714","pdf_url":"https://arxiv.org/pdf/1905.10714","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"}],"best_oa_location":{"id":"doi:10.1145/3292500.3330915","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3292500.3330915","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3292500.3330915","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2489078938","display_name":"III: Small: Collaborative Research: A novel paradigm for detecting complex anomalous patterns in multi-modal, heterogeneous, and high-dimensional multi-source data sets","funder_award_id":"1815696","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G3735786873","display_name":"RI:Small: Online Maximization Algorithms for Streaming Data","funder_award_id":"1816227","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G4306074734","display_name":"CAREER: SPARK: A Theoretical Framework for Discovering Complex Patterns in Big Attributed Networks","funder_award_id":"1750911","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2946515652.pdf","grobid_xml":"https://content.openalex.org/works/W2946515652.grobid-xml"},"referenced_works_count":17,"referenced_works":["https://openalex.org/W1970554427","https://openalex.org/W1978259121","https://openalex.org/W1983481354","https://openalex.org/W2012405765","https://openalex.org/W2033855314","https://openalex.org/W2072157164","https://openalex.org/W2125680629","https://openalex.org/W2130357047","https://openalex.org/W2157825442","https://openalex.org/W2164431108","https://openalex.org/W2169713291","https://openalex.org/W2963297739","https://openalex.org/W2964224116","https://openalex.org/W4205841652","https://openalex.org/W4242418466","https://openalex.org/W4292022450","https://openalex.org/W6682455423"],"related_works":[],"abstract_inverted_index":{"Online":[0],"learning":[1,146,159],"algorithms":[2,37],"update":[3],"models":[4,40],"via":[5],"one":[6],"sample":[7],"per":[8],"iteration,":[9],"thus":[10,123],"efficient":[11],"to":[12,18,65,105,140,188],"process":[13],"large-scale":[14],"datasets":[15],"and":[16,29,46,113,178],"useful":[17],"detect":[19],"malicious":[20],"events":[21],"for":[22,38,52,58,87,144,161],"social":[23],"benefits,":[24],"such":[25],"as":[26,139],"disease":[27],"outbreak":[28],"traffic":[30],"congestion":[31],"on":[32,42,174],"the":[33,43,47,66,125,130,149,156],"fly.":[34],"However,":[35],"existing":[36],"graph-structured":[39,72,88,126,202],"focused":[41],"offline":[44],"setting":[45,60],"least":[48],"square":[49],"loss,":[50],"incapable":[51],"online":[53,59,93,145,158],"setting,":[54,94],"while":[55],"methods":[56],"designed":[57],"cannot":[61],"be":[62],"directly":[63],"applied":[64],"problem":[67],"of":[68,151],"complex":[69],"(usually":[70],"non-convex)":[71],"sparsity":[73,89,127],"model.":[74],"To":[75,148,166],"address":[76],"these":[77],"limitations,":[78],"in":[79,102],"this":[80],"paper":[81],"we":[82,96,170],"propose":[83],"a":[84],"new":[85],"algorithm":[86,160],"constraint":[90],"problems":[91],"under":[92],"which":[95],"call":[97],"GraphDA.":[98],"The":[99],"key":[100],"part":[101],"GraphDA":[103,154,192],"is":[104,155],"project":[106],"both":[107,175],"averaging":[108],"gradient":[109],"(in":[110,116],"dual":[111],"space)":[112,118],"primal":[114,117],"variables":[115],"onto":[119],"lower":[120],"dimensional":[121],"subspaces,":[122],"capturing":[124],"effectively.":[128],"Furthermore,":[129],"objective":[131],"functions":[132],"assumed":[133],"here":[134],"are":[135],"generally":[136],"convex":[137],"so":[138],"handle":[141],"different":[142],"losses":[143],"settings.":[147],"best":[150],"our":[152,168],"knowledge,":[153],"first":[157],"graph-structure":[162],"constrained":[163],"optimization":[164],"problems.":[165],"validate":[167],"method,":[169],"conduct":[171],"extensive":[172],"experiments":[173],"benchmark":[176],"graph":[177,180],"real-world":[179],"datasets.":[181],"Our":[182],"experiment":[183],"results":[184],"show":[185],"that,":[186],"compared":[187],"other":[189],"baseline":[190],"methods,":[191],"not":[193],"only":[194],"improves":[195],"classification":[196],"performance,":[197],"but":[198],"also":[199],"successfully":[200],"captures":[201],"features":[203],"more":[204],"effectively,":[205],"hence":[206],"stronger":[207],"interpretability.":[208]},"counts_by_year":[{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1}],"updated_date":"2026-08-05T07:39:15.569665","created_date":"2019-05-29T00:00:00"}