{"id":"https://openalex.org/W2890181003","doi":"https://doi.org/10.1109/icassp.2018.8461449","title":"Parallel Stochastic Successive Convex Approximation Method for Large-Scale Dictionary Learning","display_name":"Parallel Stochastic Successive Convex Approximation Method for Large-Scale Dictionary Learning","publication_year":2018,"publication_date":"2018-04-01","ids":{"openalex":"https://openalex.org/W2890181003","doi":"https://doi.org/10.1109/icassp.2018.8461449","mag":"2890181003"},"language":"en","primary_location":{"id":"doi:10.1109/icassp.2018.8461449","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icassp.2018.8461449","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)","raw_type":"proceedings-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/A5025896653","display_name":"Alec Koppel","orcid":"https://orcid.org/0000-0003-2447-2873"},"institutions":[{"id":"https://openalex.org/I166416128","display_name":"DEVCOM Army Research Laboratory","ror":"https://ror.org/011hc8f90","country_code":"US","type":"government","lineage":["https://openalex.org/I1304082316","https://openalex.org/I1330347796","https://openalex.org/I166416128","https://openalex.org/I2802705668","https://openalex.org/I4210154437"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Alec Koppel","raw_affiliation_strings":["Computational and Information Sciences Directorate, U.S. Army Research Laboratory"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computational and Information Sciences Directorate, U.S. Army Research Laboratory","institution_ids":["https://openalex.org/I166416128"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5008417632","display_name":"Aryan Mokhtari","orcid":"https://orcid.org/0000-0001-6603-0091"},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Aryan Mokhtari","raw_affiliation_strings":["Sirnons Institute for the Theory of Computing, University of California Berkeley"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Sirnons Institute for the Theory of Computing, University of California Berkeley","institution_ids":["https://openalex.org/I95457486"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5078862959","display_name":"Alejandro Ribeiro","orcid":"https://orcid.org/0000-0003-4230-9906"},"institutions":[{"id":"https://openalex.org/I79576946","display_name":"University of Pennsylvania","ror":"https://ror.org/00b30xv10","country_code":"US","type":"education","lineage":["https://openalex.org/I79576946"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Alejandro Ribeiro","raw_affiliation_strings":["Department of Electrical and Systems Engineering, University of Pennsylvania"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Systems Engineering, University of Pennsylvania","institution_ids":["https://openalex.org/I79576946"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.8736,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.84218997,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"2771","last_page":"2775"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":1.0,"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":1.0,"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9997000098228455,"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.9977999925613403,"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/computer-science","display_name":"Computer science","score":0.535858690738678},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.5175803899765015},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.4896581768989563},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.4861588180065155},{"id":"https://openalex.org/keywords/proper-convex-function","display_name":"Proper convex function","score":0.4815266728401184},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4727433919906616},{"id":"https://openalex.org/keywords/convex-analysis","display_name":"Convex analysis","score":0.45696941018104553},{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.43605560064315796},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4183063209056854},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3945763409137726},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.37051230669021606},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.14130663871765137}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.535858690738678},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.5175803899765015},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.4896581768989563},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.4861588180065155},{"id":"https://openalex.org/C50862404","wikidata":"https://www.wikidata.org/wiki/Q3075259","display_name":"Proper convex function","level":5,"score":0.4815266728401184},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4727433919906616},{"id":"https://openalex.org/C12108790","wikidata":"https://www.wikidata.org/wiki/Q2234833","display_name":"Convex analysis","level":4,"score":0.45696941018104553},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.43605560064315796},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4183063209056854},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3945763409137726},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.37051230669021606},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.14130663871765137},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icassp.2018.8461449","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icassp.2018.8461449","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/4","display_name":"Quality Education","score":0.5}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W18046889","https://openalex.org/W1456665855","https://openalex.org/W1494085563","https://openalex.org/W1503398984","https://openalex.org/W1540764732","https://openalex.org/W1577245107","https://openalex.org/W1974661392","https://openalex.org/W1994616650","https://openalex.org/W2036749237","https://openalex.org/W2042451363","https://openalex.org/W2047152541","https://openalex.org/W2058361915","https://openalex.org/W2112447569","https://openalex.org/W2114122776","https://openalex.org/W2153663612","https://openalex.org/W2564717828","https://openalex.org/W2567455162","https://openalex.org/W2661056902","https://openalex.org/W2962930217","https://openalex.org/W2963648037","https://openalex.org/W3099514962","https://openalex.org/W4230167402","https://openalex.org/W4250589301","https://openalex.org/W4292023222","https://openalex.org/W4300001780","https://openalex.org/W6676727762","https://openalex.org/W6676758108","https://openalex.org/W6739947481"],"related_works":["https://openalex.org/W2040676043","https://openalex.org/W1977643895","https://openalex.org/W2391091101","https://openalex.org/W4256242347","https://openalex.org/W3125145310","https://openalex.org/W2051968184","https://openalex.org/W4317914276","https://openalex.org/W2153986439","https://openalex.org/W3107799181","https://openalex.org/W2510140549"],"abstract_inverted_index":{"We":[0,40,158],"consider":[1],"the":[2,27,63,84,94,108,156,160],"problem":[3],"of":[4,75,86,124,155,163],"dictionary":[5,64,144],"learning":[6,168],"over":[7],"training":[8,130,141],"sets":[9],"whose":[10],"sample":[11,103],"size":[12],"and":[13,35,65,70,106,129,169],"parameter":[14],"dimension":[15],"are":[16],"large-scale,":[17],"which":[18,59],"is":[19],"formulated":[20],"as":[21,50],"a":[22,31,36,42,51,100,152,180],"non-convex":[23,33,96],"stochastic":[24,97],"program":[25],"where":[26],"objective":[28,98],"decomposes":[29],"into":[30,68],"smooth":[32],"part":[34],"convex":[37,88,102,110],"sparsity-promoting":[38],"penalty.":[39],"propose":[41],"Doubly":[43],"Stochastic":[44],"Successive":[45],"Convex":[46],"approximation":[47,89],"scheme":[48],"(DSSC)":[49],"new":[52],"numerical":[53],"tool":[54],"to":[55,83,139,151,174],"address":[56],"this":[57,164],"task":[58],"operates":[60,71,121],"by":[61,99,179],"decomposing":[62],"sparse":[66],"codes":[67],"blocks":[69,76],"on":[72,122],"random":[73],"subsets":[74,123],"at":[77,134],"each":[78,113,135],"step.":[79,136],"The":[80,119],"algorithm":[81],"belongs":[82],"family":[85],"successive":[87],"methods":[90],"since":[91],"we":[92],"replace":[93],"original":[95],"strongly":[101],"surrogate":[104],"function,":[105],"solve":[107],"resulting":[109],"program,":[111],"for":[112,143,166],"randomly":[114],"selected":[115],"block":[116],"in":[117],"parallel.":[118],"method":[120],"features":[125],"(block":[126],"coordinate":[127],"methods)":[128],"examples":[131],"(stochas-tic":[132],"approximation)":[133],"In":[137],"contrast":[138],"many":[140],"schemes":[142],"learning,":[145],"DSSC":[146],"attains":[147],"almost":[148],"sure":[149],"convergence":[150],"stationary":[153],"solution":[154],"problem.":[157],"observe":[159],"practical":[161],"benefits":[162],"approach":[165],"stable":[167],"computational":[170],"speedup":[171],"when":[172],"applied":[173],"streaming":[175],"visual":[176],"data":[177],"gathered":[178],"field":[181],"robot.":[182]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":3}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}