{"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","doi":"https://doi.org/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,"listed_in":["anvur-scientific","cwts-core","dongbi-a","jufo-3","ki-jl-1","norway-2","poland-140","russia-white-list-1","vabb-shw"],"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"},"volume":null,"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","observed_orcids":["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":false,"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"],"raw_orcid":"https://orcid.org/0000-0002-8421-4270","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","observed_orcids":["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"],"raw_orcid":"https://orcid.org/0000-0002-7945-4114","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 A. De Veciana","orcid":"https://orcid.org/0000-0002-1498-494X","observed_orcids":["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"],"raw_orcid":"https://orcid.org/0000-0002-1498-494X","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":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":2195,"currency":"USD","value_usd":2195},"apc_paid":null,"fwci":0.312,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.52507375,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.28999999165534973,"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.28999999165534973,"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.18709999322891235,"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.07169999927282333,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/progressive-sampling","display_name":"progressive sampling","score":0.6629999876022339},{"id":"https://openalex.org/keywords/uniform-sampling","display_name":"uniform sampling","score":0.6620000004768372},{"id":"https://openalex.org/keywords/query-complexity","display_name":"query complexity","score":0.7699999809265137},{"id":"https://openalex.org/keywords/approximation-guarantees","display_name":"approximation guarantees","score":0.9629999995231628},{"id":"https://openalex.org/keywords/submodular-optimization","display_name":"submodular optimization","score":0.6819999814033508},{"id":"https://openalex.org/keywords/dimensionality-reduction","display_name":"dimensionality reduction","score":0.925000011920929},{"id":"https://openalex.org/keywords/feature-selection","display_name":"feature selection","score":0.9679999947547913},{"id":"https://openalex.org/keywords/clustering","display_name":"clustering","score":0.8629999756813049},{"id":"https://openalex.org/keywords/object-tracking","display_name":"object tracking","score":0.9990000128746033}],"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","doi":"https://doi.org/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,"listed_in":["anvur-scientific","cwts-core","dongbi-a","jufo-3","ki-jl-1","norway-2","poland-140","russia-white-list-1","vabb-shw"],"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":[],"study_designs":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":57,"referenced_works":["https://openalex.org/W1593065816","https://openalex.org/W1680189815","https://openalex.org/W1875482710","https://openalex.org/W1898824936","https://openalex.org/W1899379166","https://openalex.org/W1952656308","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/W2117659259","https://openalex.org/W2123921160","https://openalex.org/W2126885789","https://openalex.org/W2127271355","https://openalex.org/W2129131372","https://openalex.org/W2131824593","https://openalex.org/W2134474909","https://openalex.org/W2140856955","https://openalex.org/W2143996311","https://openalex.org/W2147329339","https://openalex.org/W2169207653","https://openalex.org/W2170735271","https://openalex.org/W2264830470","https://openalex.org/W2341459421","https://openalex.org/W2414043010","https://openalex.org/W2500139799","https://openalex.org/W2531699011","https://openalex.org/W2547648546","https://openalex.org/W2560274656","https://openalex.org/W2592313125","https://openalex.org/W2596846716","https://openalex.org/W2753380796","https://openalex.org/W2757008575","https://openalex.org/W2797074460","https://openalex.org/W2809318113","https://openalex.org/W2883693373","https://openalex.org/W2886985401","https://openalex.org/W2897973071","https://openalex.org/W2945389092","https://openalex.org/W2949212323","https://openalex.org/W2951815872","https://openalex.org/W2963840432","https://openalex.org/W2973226608","https://openalex.org/W2978212076","https://openalex.org/W3007725408","https://openalex.org/W3035670338","https://openalex.org/W3162527011","https://openalex.org/W4231490457","https://openalex.org/W4292070111","https://openalex.org/W6730123057"],"related_works":["https://openalex.org/W3216925025","https://openalex.org/W3162527011","https://openalex.org/W2962811043","https://openalex.org/W4393380011","https://openalex.org/W4403260597","https://openalex.org/W4378531166","https://openalex.org/W3150912491","https://openalex.org/W2596846716","https://openalex.org/W2735578456","https://openalex.org/W2968068505"],"abstract_inverted_index":{"Many":[0],"problems":[1],"in":[2,59,200],"signal":[3],"processing":[4],"and":[5,71,108,187,204,210],"machine":[6],"learning":[7],"can":[8,163],"be":[9,164],"formalized":[10],"as":[11],"weak":[12],"submodular":[13],"optimization":[14],"tasks.":[15],"For":[16],"such":[17],"problems,":[18],"a":[19,28,34,125,130,181],"simple":[20,182],"greedy":[21,185],"algorithm":[22,186],"(Greedy)":[23],"is":[24],"guaranteed":[25],"to":[26,47,76,80,113,144],"find":[27,145],"solution":[29],"achieving":[30],"the":[31,39,42,48,55,67,82,89,114,146,153,169,172,197],"objective":[32],"with":[33,111,124,138,159],"value":[35],"no":[36],"worse":[37],"than$1-e^{-1/c}$of":[38],"optimal,":[40],"where$c$is":[41],"multiplicative":[43],"weak-submodularity":[44],"constant.":[45],"Due":[46],"high":[49],"cost":[50],"of":[51,91,103,155,171,196],"querying":[52],"large-scale":[53],"systems,":[54],"complexity":[56,72,84],"ofGreedybecomes":[57],"prohibitive":[58],"contemporary":[60],"applications.":[61],"In":[62],"this":[63,177],"work,":[64],"we":[65,87,135,179,193],"study":[66,188],"tradeoff":[68],"between":[69],"performance":[70,96],"when":[73],"one":[74],"resorts":[75],"random":[77],"sampling":[78,93,122,127,157],"strategies":[79,94,123,158],"reduce":[81],"query":[83],"ofGreedy.":[85],"Specifically,":[86],"quantify":[88],"effect":[90],"uniform":[92,121,156],"onGreedy's":[95],"through":[97],"two":[98],"metrics:":[99],"(i)":[100],"asymptotic":[101],"probability":[102],"identifying":[104],"an":[105],"optimal":[106,115,147],"subset,":[107],"(ii)":[109],"suboptimality":[110],"respect":[112],"solution.":[116],"The":[117],"latter":[118],"implies":[119],"that":[120,137,152],"fixed":[126,160],"size":[128,162,170],"achieve":[129],"non-trivial":[131],"approximation":[132,190],"factor;":[133],"however,":[134],"show":[136],"overwhelming":[139],"probability,":[140],"these":[141],"methods":[142],"fail":[143],"subset.":[148],"Our":[149],"analysis":[150],"shows":[151],"failure":[154],"sample":[161],"circumvented":[165],"by":[166],"successively":[167],"increasing":[168],"search":[173],"space.":[174],"Building":[175],"upon":[176],"insight,":[178],"propose":[180],"progressive":[183],"stochastic":[184],"its":[189],"guarantees.":[191],"Moreover,":[192],"demonstrate":[194],"effectiveness":[195],"proposed":[198],"method":[199],"dimensionality":[201],"reduction":[202],"applications":[203],"feature":[205],"selection":[206],"tasks":[207],"for":[208],"clustering":[209],"object":[211],"tracking.":[212]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":3}],"updated_date":"2026-11-04T10:54:05.112534","created_date":"2022-07-30T00:00:00"}