{"id":"https://openalex.org/W2963627250","doi":"https://doi.org/10.1109/globalsip.2017.8309172","title":"Exploiting the structure via sketched gradient algorithms","display_name":"Exploiting the structure via sketched gradient algorithms","publication_year":2017,"publication_date":"2017-11-01","ids":{"openalex":"https://openalex.org/W2963627250","doi":"https://doi.org/10.1109/globalsip.2017.8309172","mag":"2963627250"},"language":"en","primary_location":{"id":"doi:10.1109/globalsip.2017.8309172","is_oa":false,"landing_page_url":"https://doi.org/10.1109/globalsip.2017.8309172","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE Global Conference on Signal and Information Processing (GlobalSIP)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://birmingham.elsevierpure.com/en/publications/1c8d4bd7-6f0e-40b5-a300-c6551508b33a","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5054394663","display_name":"Junqi Tang","orcid":"https://orcid.org/0000-0003-4996-6079"},"institutions":[{"id":"https://openalex.org/I98677209","display_name":"University of Edinburgh","ror":"https://ror.org/01nrxwf90","country_code":"GB","type":"education","lineage":["https://openalex.org/I98677209"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Junqi Tang","raw_affiliation_strings":["Institute of Digital Communications, University of Edinburgh. EH9 3JL, UK"],"affiliations":[{"raw_affiliation_string":"Institute of Digital Communications, University of Edinburgh. EH9 3JL, UK","institution_ids":["https://openalex.org/I98677209"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5056404513","display_name":"Mohammad Golbabaee","orcid":"https://orcid.org/0000-0001-5822-2990"},"institutions":[{"id":"https://openalex.org/I98677209","display_name":"University of Edinburgh","ror":"https://ror.org/01nrxwf90","country_code":"GB","type":"education","lineage":["https://openalex.org/I98677209"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Mohammad Golbabaee","raw_affiliation_strings":["Institute of Digital Communications, University of Edinburgh. EH9 3JL, UK"],"affiliations":[{"raw_affiliation_string":"Institute of Digital Communications, University of Edinburgh. EH9 3JL, UK","institution_ids":["https://openalex.org/I98677209"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5057962470","display_name":"Mike E. Davies","orcid":"https://orcid.org/0000-0003-2327-236X"},"institutions":[{"id":"https://openalex.org/I98677209","display_name":"University of Edinburgh","ror":"https://ror.org/01nrxwf90","country_code":"GB","type":"education","lineage":["https://openalex.org/I98677209"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Mike Davies","raw_affiliation_strings":["Institute of Digital Communications, University of Edinburgh. EH9 3JL, UK"],"affiliations":[{"raw_affiliation_string":"Institute of Digital Communications, University of Edinburgh. EH9 3JL, UK","institution_ids":["https://openalex.org/I98677209"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5054394663"],"corresponding_institution_ids":["https://openalex.org/I98677209"],"apc_list":null,"apc_paid":null,"fwci":0.4802,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.65693546,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"1305","last_page":"1309"},"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.9970999956130981,"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/T12536","display_name":"Topological and Geometric Data Analysis","score":0.9865999817848206,"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/sketch","display_name":"Sketch","score":0.7508529424667358},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6671181917190552},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6580984592437744},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5879454016685486},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5766721367835999},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5644363760948181},{"id":"https://openalex.org/keywords/rate-of-convergence","display_name":"Rate of convergence","score":0.5598931312561035},{"id":"https://openalex.org/keywords/scale","display_name":"Scale (ratio)","score":0.48581695556640625},{"id":"https://openalex.org/keywords/exploit","display_name":"Exploit","score":0.4660072922706604},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4292270243167877},{"id":"https://openalex.org/keywords/projection","display_name":"Projection (relational algebra)","score":0.4188275933265686},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3317454755306244},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.24407696723937988},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.17963692545890808},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.0797964334487915}],"concepts":[{"id":"https://openalex.org/C2779231336","wikidata":"https://www.wikidata.org/wiki/Q7534724","display_name":"Sketch","level":2,"score":0.7508529424667358},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6671181917190552},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6580984592437744},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5879454016685486},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5766721367835999},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5644363760948181},{"id":"https://openalex.org/C57869625","wikidata":"https://www.wikidata.org/wiki/Q1783502","display_name":"Rate of convergence","level":3,"score":0.5598931312561035},{"id":"https://openalex.org/C2778755073","wikidata":"https://www.wikidata.org/wiki/Q10858537","display_name":"Scale (ratio)","level":2,"score":0.48581695556640625},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.4660072922706604},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4292270243167877},{"id":"https://openalex.org/C57493831","wikidata":"https://www.wikidata.org/wiki/Q3134666","display_name":"Projection (relational algebra)","level":2,"score":0.4188275933265686},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3317454755306244},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.24407696723937988},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.17963692545890808},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0797964334487915},{"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/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","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},{"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/globalsip.2017.8309172","is_oa":false,"landing_page_url":"https://doi.org/10.1109/globalsip.2017.8309172","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE Global Conference on Signal and Information Processing (GlobalSIP)","raw_type":"proceedings-article"},{"id":"pmh:oai:pure.atira.dk:publications/1c8d4bd7-6f0e-40b5-a300-c6551508b33a","is_oa":true,"landing_page_url":"https://birmingham.elsevierpure.com/en/publications/1c8d4bd7-6f0e-40b5-a300-c6551508b33a","pdf_url":null,"source":{"id":"https://openalex.org/S4306402634","display_name":"University of Birmingham Research Portal (University of Birmingham)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79619799","host_organization_name":"University of Birmingham","host_organization_lineage":["https://openalex.org/I79619799"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Tang , J , Golbabaee , M & Davies , M 2017 , Exploiting the structure via sketched gradient algorithms . in 2017 IEEE Global Conference on Signal and Information Processing (GlobalSIP) . https://doi.org/10.1109/GlobalSIP.2017.8309172","raw_type":"contributionToPeriodical"}],"best_oa_location":{"id":"pmh:oai:pure.atira.dk:publications/1c8d4bd7-6f0e-40b5-a300-c6551508b33a","is_oa":true,"landing_page_url":"https://birmingham.elsevierpure.com/en/publications/1c8d4bd7-6f0e-40b5-a300-c6551508b33a","pdf_url":null,"source":{"id":"https://openalex.org/S4306402634","display_name":"University of Birmingham Research Portal (University of Birmingham)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79619799","host_organization_name":"University of Birmingham","host_organization_lineage":["https://openalex.org/I79619799"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Tang , J , Golbabaee , M & Davies , M 2017 , Exploiting the structure via sketched gradient algorithms . in 2017 IEEE Global Conference on Signal and Information Processing (GlobalSIP) . https://doi.org/10.1109/GlobalSIP.2017.8309172","raw_type":"contributionToPeriodical"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320321108","display_name":"Academy of Finland","ror":"https://ror.org/05k73zm37"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W947105725","https://openalex.org/W1945899805","https://openalex.org/W1999352252","https://openalex.org/W2007399394","https://openalex.org/W2093813380","https://openalex.org/W2101043704","https://openalex.org/W2107438106","https://openalex.org/W2109449402","https://openalex.org/W2118901394","https://openalex.org/W2124659530","https://openalex.org/W2142224912","https://openalex.org/W2146482778","https://openalex.org/W2167077875","https://openalex.org/W2524385150","https://openalex.org/W2615547474","https://openalex.org/W2952215077","https://openalex.org/W2963002486","https://openalex.org/W2963060476","https://openalex.org/W2963459305","https://openalex.org/W2963627250","https://openalex.org/W2964299664","https://openalex.org/W2964309963","https://openalex.org/W3124617746","https://openalex.org/W6625167997","https://openalex.org/W6676105031","https://openalex.org/W6677959107","https://openalex.org/W6680196509","https://openalex.org/W6681413097","https://openalex.org/W6682597329","https://openalex.org/W6727533652","https://openalex.org/W6737749886"],"related_works":["https://openalex.org/W2378994405","https://openalex.org/W2385974820","https://openalex.org/W17155033","https://openalex.org/W2373478030","https://openalex.org/W2378679551","https://openalex.org/W3149739944","https://openalex.org/W2392363776","https://openalex.org/W2063051341","https://openalex.org/W2591066345","https://openalex.org/W1494563618"],"abstract_inverted_index":{"Sketched":[0],"gradient":[1,77],"algorithms":[2,89],"[1]":[3],"have":[4],"been":[5],"recently":[6],"introduced":[7],"for":[8,24],"efficiently":[9],"solving":[10],"the":[11,25,35,44,50,74,80,94],"large-scale":[12],"constrained":[13],"Least-squares":[14],"regressions.":[15],"In":[16],"this":[17],"paper":[18],"we":[19,60,71],"provide":[20],"novel":[21],"convergence":[22,38],"analysis":[23,59],"basic":[26],"method":[27],"Gradient":[28],"Projection":[29],"Classical":[30],"Sketch":[31],"(GPCS)":[32],"to":[33,43,57,97],"reveal":[34],"fast":[36],"linear":[37],"rate":[39],"of":[40,49,76,86],"GPCS":[41],"thanks":[42],"intrinsic":[45],"low-dimensional":[46,95],"geometric":[47],"structure":[48,96],"solution":[51],"prompted":[52],"by":[53],"constraint":[54],"set.":[55],"Similar":[56],"our":[58],"observe":[61],"computational":[62],"and":[63,79,105],"sketch":[64],"size":[65],"trade-offs":[66],"in":[67,100],"numerical":[68],"experiments.":[69],"Hence":[70],"justify":[72],"that":[73],"combination":[75],"methods":[78],"sketching":[81],"technique":[82],"is":[83],"a":[84],"way":[85],"designing":[87],"efficient":[88],"which":[90],"can":[91],"actively":[92],"exploit":[93],"accelerate":[98],"computation":[99],"large":[101],"scale":[102],"data":[103],"regression":[104],"signal":[106],"processing":[107],"applications.":[108]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}