{"id":"https://openalex.org/W4288773398","doi":"https://doi.org/10.1109/tsp.2022.3195089","title":"On the Benefits of Progressively Increasing Sampling Sizes in Stochastic Greedy Weak Submodular Maximization","display_name":"On the Benefits of Progressively Increasing Sampling Sizes in Stochastic Greedy Weak Submodular Maximization","publication_year":2022,"publication_date":"2022-01-01","ids":{"openalex":"https://openalex.org/W4288773398","doi":"https://doi.org/10.1109/tsp.2022.3195089"},"language":"en","primary_location":{"id":"doi:10.1109/tsp.2022.3195089","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tsp.2022.3195089","pdf_url":null,"source":{"id":"https://openalex.org/S168680287","display_name":"IEEE Transactions on Signal Processing","issn_l":"1053-587X","issn":["1053-587X","1941-0476"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Signal Processing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5036900440","display_name":"Abolfazl Hashemi","orcid":"https://orcid.org/0000-0002-8421-4270"},"institutions":[{"id":"https://openalex.org/I219193219","display_name":"Purdue University West Lafayette","ror":"https://ror.org/02dqehb95","country_code":"US","type":"education","lineage":["https://openalex.org/I219193219"]},{"id":"https://openalex.org/I86519309","display_name":"The University of Texas at Austin","ror":"https://ror.org/00hj54h04","country_code":"US","type":"education","lineage":["https://openalex.org/I86519309"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Abolfazl Hashemi","raw_affiliation_strings":["School of Electrical and Computer Engineering, Purdue University, West Lafayette, IN, USA","Department of Electrical and Computer Engineering, University of Texas at Austin"],"affiliations":[{"raw_affiliation_string":"School of Electrical and Computer Engineering, Purdue University, West Lafayette, IN, USA","institution_ids":["https://openalex.org/I219193219"]},{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Texas at Austin","institution_ids":["https://openalex.org/I86519309"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5067602750","display_name":"Haris Vikalo","orcid":"https://orcid.org/0000-0002-7945-4114"},"institutions":[{"id":"https://openalex.org/I86519309","display_name":"The University of Texas at Austin","ror":"https://ror.org/00hj54h04","country_code":"US","type":"education","lineage":["https://openalex.org/I86519309"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Haris Vikalo","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Texas at Austin, Austin, TX, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Texas at Austin, Austin, TX, USA","institution_ids":["https://openalex.org/I86519309"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5008917819","display_name":"Gustavo de Veciana","orcid":"https://orcid.org/0000-0002-1498-494X"},"institutions":[{"id":"https://openalex.org/I86519309","display_name":"The University of Texas at Austin","ror":"https://ror.org/00hj54h04","country_code":"US","type":"education","lineage":["https://openalex.org/I86519309"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Gustavo de Veciana","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Texas at Austin, Austin, TX, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Texas at Austin, Austin, TX, USA","institution_ids":["https://openalex.org/I86519309"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5036900440"],"corresponding_institution_ids":["https://openalex.org/I219193219","https://openalex.org/I86519309"],"apc_list":null,"apc_paid":null,"fwci":0.8271,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.65719518,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"70","issue":null,"first_page":"3978","last_page":"3992"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9998000264167786,"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"}},"topics":[{"id":"https://openalex.org/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9998000264167786,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9994000196456909,"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9991999864578247,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/submodular-set-function","display_name":"Submodular set function","score":0.8169861435890198},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.7098212242126465},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6047719120979309},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5771499872207642},{"id":"https://openalex.org/keywords/sampling","display_name":"Sampling (signal processing)","score":0.4875490069389343},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.4664779305458069},{"id":"https://openalex.org/keywords/sample-size-determination","display_name":"Sample size determination","score":0.4480826258659363},{"id":"https://openalex.org/keywords/multiplicative-function","display_name":"Multiplicative function","score":0.41402193903923035},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4113766551017761},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3444492518901825},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.31404274702072144},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.1469981074333191},{"id":"https://openalex.org/keywords/filter","display_name":"Filter (signal processing)","score":0.1256398856639862}],"concepts":[{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.8169861435890198},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.7098212242126465},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6047719120979309},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5771499872207642},{"id":"https://openalex.org/C140779682","wikidata":"https://www.wikidata.org/wiki/Q210868","display_name":"Sampling (signal processing)","level":3,"score":0.4875490069389343},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.4664779305458069},{"id":"https://openalex.org/C129848803","wikidata":"https://www.wikidata.org/wiki/Q2564360","display_name":"Sample size determination","level":2,"score":0.4480826258659363},{"id":"https://openalex.org/C42747912","wikidata":"https://www.wikidata.org/wiki/Q1048447","display_name":"Multiplicative function","level":2,"score":0.41402193903923035},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4113766551017761},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3444492518901825},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.31404274702072144},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.1469981074333191},{"id":"https://openalex.org/C106131492","wikidata":"https://www.wikidata.org/wiki/Q3072260","display_name":"Filter (signal processing)","level":2,"score":0.1256398856639862},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C31972630","wikidata":"https://www.wikidata.org/wiki/Q844240","display_name":"Computer vision","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tsp.2022.3195089","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tsp.2022.3195089","pdf_url":null,"source":{"id":"https://openalex.org/S168680287","display_name":"IEEE Transactions on Signal Processing","issn_l":"1053-587X","issn":["1053-587X","1941-0476"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Signal Processing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":60,"referenced_works":["https://openalex.org/W1593065816","https://openalex.org/W1680189815","https://openalex.org/W1898824936","https://openalex.org/W2002240881","https://openalex.org/W2003217181","https://openalex.org/W2007800125","https://openalex.org/W2018324106","https://openalex.org/W2061820396","https://openalex.org/W2062570725","https://openalex.org/W2063517468","https://openalex.org/W2091893102","https://openalex.org/W2101295974","https://openalex.org/W2116148865","https://openalex.org/W2117215586","https://openalex.org/W2123921160","https://openalex.org/W2126885789","https://openalex.org/W2127271355","https://openalex.org/W2129131372","https://openalex.org/W2134474909","https://openalex.org/W2140856955","https://openalex.org/W2143996311","https://openalex.org/W2147329339","https://openalex.org/W2169207653","https://openalex.org/W2264830470","https://openalex.org/W2414043010","https://openalex.org/W2500139799","https://openalex.org/W2531699011","https://openalex.org/W2547648546","https://openalex.org/W2797074460","https://openalex.org/W2809318113","https://openalex.org/W2883693373","https://openalex.org/W2886985401","https://openalex.org/W2897973071","https://openalex.org/W2951815872","https://openalex.org/W2962827663","https://openalex.org/W2963098825","https://openalex.org/W2963840432","https://openalex.org/W2973226608","https://openalex.org/W3003506411","https://openalex.org/W3011038560","https://openalex.org/W3011416673","https://openalex.org/W3162527011","https://openalex.org/W4205585032","https://openalex.org/W4212899103","https://openalex.org/W4231490457","https://openalex.org/W4292070111","https://openalex.org/W6639467292","https://openalex.org/W6640822425","https://openalex.org/W6677742982","https://openalex.org/W6679608865","https://openalex.org/W6681909378","https://openalex.org/W6685093893","https://openalex.org/W6704306196","https://openalex.org/W6715815293","https://openalex.org/W6730123057","https://openalex.org/W6734247149","https://openalex.org/W6735112817","https://openalex.org/W6743579140","https://openalex.org/W6762556467","https://openalex.org/W6780268074"],"related_works":["https://openalex.org/W2896347948","https://openalex.org/W2402949237","https://openalex.org/W2950500962","https://openalex.org/W2915041254","https://openalex.org/W4302557420","https://openalex.org/W2964314169","https://openalex.org/W2594118609","https://openalex.org/W2765425000","https://openalex.org/W3204684126","https://openalex.org/W2735578456"],"abstract_inverted_index":{"Many":[0],"problems":[1],"in":[2,67,210],"signal":[3],"processing":[4],"and":[5,79,118,197,214,220],"machine":[6],"learning":[7],"can":[8,173],"be":[9,174],"formalized":[10],"as":[11],"weak":[12],"submodular":[13],"optimization":[14],"tasks.":[15],"For":[16],"such":[17],"problems,":[18],"a":[19,28,34,135,140,191],"simple":[20,192],"greedy":[21,195],"algorithm":[22,196],"(<small>Greedy</small>)":[23],"is":[24,47],"guaranteed":[25],"to":[26,53,84,88,123,154],"find":[27,155],"solution":[29],"achieving":[30],"the":[31,42,48,54,61,75,90,98,124,156,163,179,182,207],"objective":[32],"with":[33,121,134,148,169],"value":[35],"no":[36],"worse":[37],"than":[38],"<inline-formula><tex-math":[39,45],"notation=\"LaTeX\">$1-e^{-1/c}$</tex-math></inline-formula>":[40],"of":[41,57,63,93,100,113,165,181,206],"optimal,":[43],"where":[44],"notation=\"LaTeX\">$c$</tex-math></inline-formula>":[46],"multiplicative":[49],"weak-submodularity":[50],"constant.":[51],"Due":[52],"high":[55],"cost":[56],"querying":[58],"large-scale":[59],"systems,":[60],"complexity":[62,80,92],"<small>Greedy</small>":[64],"becomes":[65],"prohibitive":[66],"contemporary":[68],"applications.":[69],"In":[70],"this":[71,187],"work,":[72],"we":[73,96,145,189,203],"study":[74,198],"tradeoff":[76],"between":[77],"performance":[78,106],"when":[81],"one":[82],"resorts":[83],"random":[85],"sampling":[86,102,132,137,167],"strategies":[87,103,133,168],"reduce":[89],"query":[91],"<small>Greedy</small>.":[94],"Specifically,":[95],"quantify":[97],"effect":[99],"uniform":[101,131,166],"on":[104],"<small>Greedy</small>&#x0027;s":[105],"through":[107],"two":[108],"metrics:":[109],"(i)":[110],"asymptotic":[111],"probability":[112],"identifying":[114],"an":[115],"optimal":[116,125,157],"subset,":[117],"(ii)":[119],"suboptimality":[120],"respect":[122],"solution.":[126],"The":[127],"latter":[128],"implies":[129],"that":[130,147,162],"fixed":[136,170],"size":[138,172,180],"achieve":[139],"non-trivial":[141],"approximation":[142,200],"factor;":[143],"however,":[144],"show":[146],"overwhelming":[149],"probability,":[150],"these":[151],"methods":[152],"fail":[153],"subset.":[158],"Our":[159],"analysis":[160],"shows":[161],"failure":[164],"sample":[171],"circumvented":[175],"by":[176],"successively":[177],"increasing":[178],"search":[183],"space.":[184],"Building":[185],"upon":[186],"insight,":[188],"propose":[190],"progressive":[193],"stochastic":[194],"its":[199],"guarantees.":[201],"Moreover,":[202],"demonstrate":[204],"effectiveness":[205],"proposed":[208],"method":[209],"dimensionality":[211],"reduction":[212],"applications":[213],"feature":[215],"selection":[216],"tasks":[217],"for":[218],"clustering":[219],"object":[221],"tracking.":[222]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":3}],"updated_date":"2026-03-27T05:58:40.876381","created_date":"2025-10-10T00:00:00"}