{"id":"https://openalex.org/W2963082397","doi":"https://doi.org/10.1109/icassp.2019.8682059","title":"SignProx: One-bit Proximal Algorithm for Nonconvex Stochastic Optimization","display_name":"SignProx: One-bit Proximal Algorithm for Nonconvex Stochastic Optimization","publication_year":2019,"publication_date":"2019-04-16","ids":{"openalex":"https://openalex.org/W2963082397","doi":"https://doi.org/10.1109/icassp.2019.8682059","mag":"2963082397"},"language":"en","primary_location":{"id":"doi:10.1109/icassp.2019.8682059","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icassp.2019.8682059","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ICASSP 2019 - 2019 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5101423444","display_name":"Xiaojian Xu","orcid":"https://orcid.org/0000-0002-5264-8963"},"institutions":[{"id":"https://openalex.org/I204465549","display_name":"Washington University in St. Louis","ror":"https://ror.org/01yc7t268","country_code":"US","type":"education","lineage":["https://openalex.org/I204465549"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Xiaojian Xu","raw_affiliation_strings":["Department of Computer Science and Engineering, Washington University in St. Louis, St. Louis, MO"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Washington University in St. Louis, St. Louis, MO","institution_ids":["https://openalex.org/I204465549"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5024602237","display_name":"Ulugbek S. Kamilov","orcid":"https://orcid.org/0000-0001-6770-3278"},"institutions":[{"id":"https://openalex.org/I204465549","display_name":"Washington University in St. Louis","ror":"https://ror.org/01yc7t268","country_code":"US","type":"education","lineage":["https://openalex.org/I204465549"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ulugbek S. Kamilov","raw_affiliation_strings":["Department of Electrical and Systems Engineering, Washington University in St. Louis, MO"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Systems Engineering, Washington University in St. Louis, MO","institution_ids":["https://openalex.org/I204465549"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I204465549"],"apc_list":null,"apc_paid":null,"fwci":2.5568,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.95027328,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"3024","issue":null,"first_page":"7800","last_page":"7804"},"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.9998999834060669,"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.9998999834060669,"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.9998000264167786,"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/T10052","display_name":"Medical Image Segmentation Techniques","score":0.9789999723434448,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/bottleneck","display_name":"Bottleneck","score":0.757756233215332},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7475196123123169},{"id":"https://openalex.org/keywords/stochastic-gradient-descent","display_name":"Stochastic gradient descent","score":0.6758694648742676},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.6434303522109985},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.573978066444397},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5625194311141968},{"id":"https://openalex.org/keywords/rate-of-convergence","display_name":"Rate of convergence","score":0.5204575061798096},{"id":"https://openalex.org/keywords/gradient-descent","display_name":"Gradient descent","score":0.49448561668395996},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4835941195487976},{"id":"https://openalex.org/keywords/stochastic-approximation","display_name":"Stochastic approximation","score":0.4626390039920807},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.43592357635498047},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.42860496044158936},{"id":"https://openalex.org/keywords/stochastic-optimization","display_name":"Stochastic optimization","score":0.4268989861011505},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.419220894575119},{"id":"https://openalex.org/keywords/proximal-gradient-methods","display_name":"Proximal Gradient Methods","score":0.4120227098464966},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.2994633913040161},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.15900468826293945},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.15164253115653992},{"id":"https://openalex.org/keywords/artificial-neural-network","display_name":"Artificial neural network","score":0.10918477177619934}],"concepts":[{"id":"https://openalex.org/C2780513914","wikidata":"https://www.wikidata.org/wiki/Q18210350","display_name":"Bottleneck","level":2,"score":0.757756233215332},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7475196123123169},{"id":"https://openalex.org/C206688291","wikidata":"https://www.wikidata.org/wiki/Q7617819","display_name":"Stochastic gradient descent","level":3,"score":0.6758694648742676},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.6434303522109985},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.573978066444397},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5625194311141968},{"id":"https://openalex.org/C57869625","wikidata":"https://www.wikidata.org/wiki/Q1783502","display_name":"Rate of convergence","level":3,"score":0.5204575061798096},{"id":"https://openalex.org/C153258448","wikidata":"https://www.wikidata.org/wiki/Q1199743","display_name":"Gradient descent","level":3,"score":0.49448561668395996},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4835941195487976},{"id":"https://openalex.org/C55479107","wikidata":"https://www.wikidata.org/wiki/Q97663916","display_name":"Stochastic approximation","level":3,"score":0.4626390039920807},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.43592357635498047},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.42860496044158936},{"id":"https://openalex.org/C194387892","wikidata":"https://www.wikidata.org/wiki/Q1747770","display_name":"Stochastic optimization","level":2,"score":0.4268989861011505},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.419220894575119},{"id":"https://openalex.org/C10494615","wikidata":"https://www.wikidata.org/wiki/Q17086765","display_name":"Proximal Gradient Methods","level":4,"score":0.4120227098464966},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.2994633913040161},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.15900468826293945},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.15164253115653992},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"score":0.10918477177619934},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded system","level":1,"score":0.0},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icassp.2019.8682059","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icassp.2019.8682059","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ICASSP 2019 - 2019 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":35,"referenced_works":["https://openalex.org/W1494951781","https://openalex.org/W1779663849","https://openalex.org/W1953936588","https://openalex.org/W1973823738","https://openalex.org/W1994616650","https://openalex.org/W2015911499","https://openalex.org/W2028349405","https://openalex.org/W2058532290","https://openalex.org/W2060393849","https://openalex.org/W2067689904","https://openalex.org/W2073750241","https://openalex.org/W2083842231","https://openalex.org/W2100556411","https://openalex.org/W2103559027","https://openalex.org/W2110505738","https://openalex.org/W2115706991","https://openalex.org/W2124541940","https://openalex.org/W2128763644","https://openalex.org/W2138972044","https://openalex.org/W2142224912","https://openalex.org/W2164278908","https://openalex.org/W2293327468","https://openalex.org/W2407022425","https://openalex.org/W2554591675","https://openalex.org/W2763081248","https://openalex.org/W2769644379","https://openalex.org/W2913535645","https://openalex.org/W2963446712","https://openalex.org/W3141595720","https://openalex.org/W3148325197","https://openalex.org/W4244393449","https://openalex.org/W4250589301","https://openalex.org/W4292363360","https://openalex.org/W6680610635","https://openalex.org/W6746200960"],"related_works":["https://openalex.org/W4206903459","https://openalex.org/W4286899070","https://openalex.org/W4323366756","https://openalex.org/W3207830353","https://openalex.org/W4285259204","https://openalex.org/W3109737792","https://openalex.org/W3109198354","https://openalex.org/W937081240","https://openalex.org/W2760303966","https://openalex.org/W4401866412"],"abstract_inverted_index":{"Stochastic":[0],"gradient":[1,61],"descent":[2],"(SGD)":[3],"is":[4,29,63],"one":[5],"of":[6,18,22,26,53,59,79,95,104,119,132],"the":[7,23,30,35,57,80,92,96,111,116,120,124],"most":[8],"widely":[9],"used":[10,64],"optimization":[11,100],"methods":[12],"for":[13,98,129],"parallel":[14],"and":[15],"distributed":[16,27,130],"processing":[17,131],"large":[19,133],"datasets.":[20,134],"One":[21],"key":[24],"limitations":[25],"SGD":[28],"need":[31],"to":[32],"regularly":[33],"communicate":[34],"gradients":[36],"between":[37],"different":[38],"computation":[39],"nodes.":[40],"To":[41],"reduce":[42],"this":[43,68,72],"communication":[44],"bottleneck,":[45],"recent":[46],"work":[47],"has":[48],"considered":[49],"a":[50,76,102],"one-bit":[51,86],"variant":[52,78],"SGD,":[54],"where":[55],"only":[56],"sign":[58],"each":[60],"element":[62],"in":[65],"optimization.":[66],"In":[67],"paper,":[69],"we":[70],"extend":[71],"idea":[73],"by":[74],"proposing":[75],"stochastic":[77],"proximal-gradient":[81],"method":[82,97,113,126],"that":[83,110],"also":[84],"uses":[85],"per":[87],"update":[88],"element.":[89],"We":[90],"prove":[91],"theoretical":[93],"convergence":[94,117],"non-convex":[99],"under":[101],"set":[103],"explicit":[105],"assumptions.":[106],"Our":[107],"results":[108],"indicate":[109],"compressed":[112],"can":[114],"match":[115],"rate":[118],"uncompressed":[121],"one,":[122],"making":[123],"proposed":[125],"potentially":[127],"appealing":[128]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":3}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}