{"id":"https://openalex.org/W4301455206","doi":"https://doi.org/10.48550/arxiv.2208.03811","title":"Decomposable Non-Smooth Convex Optimization with Nearly-Linear Gradient Oracle Complexity","display_name":"Decomposable Non-Smooth Convex Optimization with Nearly-Linear Gradient Oracle Complexity","publication_year":2022,"publication_date":"2022-08-07","ids":{"openalex":"https://openalex.org/W4301455206","doi":"https://doi.org/10.48550/arxiv.2208.03811"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2208.03811","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2208.03811","pdf_url":"https://arxiv.org/pdf/2208.03811","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},"type":"preprint","indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2208.03811","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5017229799","display_name":"Sally Dong","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Dong, Sally","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5075618349","display_name":"Haotian Jiang","orcid":"https://orcid.org/0000-0002-5952-7689"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jiang, Haotian","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5024980585","display_name":"Yin Tat Lee","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Lee, Yin Tat","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5042979350","display_name":"Swati Padmanabhan","orcid":"https://orcid.org/0000-0002-4834-2136"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Padmanabhan, Swati","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5089626644","display_name":"Guanghao Ye","orcid":"https://orcid.org/0000-0002-1197-0649"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ye, Guanghao","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5017229799"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9998999834060669,"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.9998999834060669,"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/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.9945999979972839,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"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.9939000010490417,"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/lipschitz-continuity","display_name":"Lipschitz continuity","score":0.7699533700942993},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6952856779098511},{"id":"https://openalex.org/keywords/oracle","display_name":"Oracle","score":0.6173136830329895},{"id":"https://openalex.org/keywords/convex-function","display_name":"Convex function","score":0.5730713605880737},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.536474883556366},{"id":"https://openalex.org/keywords/corollary","display_name":"Corollary","score":0.5308701992034912},{"id":"https://openalex.org/keywords/term","display_name":"Term (time)","score":0.519395649433136},{"id":"https://openalex.org/keywords/gradient-descent","display_name":"Gradient descent","score":0.5136758685112},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.49918103218078613},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.4833945333957672},{"id":"https://openalex.org/keywords/cutting-plane-method","display_name":"Cutting-plane method","score":0.4444352686405182},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4366375207901001},{"id":"https://openalex.org/keywords/stochastic-gradient-descent","display_name":"Stochastic gradient descent","score":0.429864764213562},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4170973300933838},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.413576602935791},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4006151556968689},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.3838666081428528},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3343994617462158},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.21957340836524963},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2149643898010254},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.0925518274307251}],"concepts":[{"id":"https://openalex.org/C22324862","wikidata":"https://www.wikidata.org/wiki/Q652707","display_name":"Lipschitz continuity","level":2,"score":0.7699533700942993},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6952856779098511},{"id":"https://openalex.org/C55166926","wikidata":"https://www.wikidata.org/wiki/Q2892946","display_name":"Oracle","level":2,"score":0.6173136830329895},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.5730713605880737},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.536474883556366},{"id":"https://openalex.org/C2780012671","wikidata":"https://www.wikidata.org/wiki/Q1343870","display_name":"Corollary","level":2,"score":0.5308701992034912},{"id":"https://openalex.org/C61797465","wikidata":"https://www.wikidata.org/wiki/Q1188986","display_name":"Term (time)","level":2,"score":0.519395649433136},{"id":"https://openalex.org/C153258448","wikidata":"https://www.wikidata.org/wiki/Q1199743","display_name":"Gradient descent","level":3,"score":0.5136758685112},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.49918103218078613},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.4833945333957672},{"id":"https://openalex.org/C109839438","wikidata":"https://www.wikidata.org/wiki/Q1762039","display_name":"Cutting-plane method","level":3,"score":0.4444352686405182},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4366375207901001},{"id":"https://openalex.org/C206688291","wikidata":"https://www.wikidata.org/wiki/Q7617819","display_name":"Stochastic gradient descent","level":3,"score":0.429864764213562},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4170973300933838},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.413576602935791},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4006151556968689},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.3838666081428528},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3343994617462158},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.21957340836524963},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2149643898010254},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0925518274307251},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.0},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","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/C115903868","wikidata":"https://www.wikidata.org/wiki/Q80993","display_name":"Software engineering","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:arXiv.org:2208.03811","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2208.03811","pdf_url":"https://arxiv.org/pdf/2208.03811","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},{"id":"doi:10.48550/arxiv.2208.03811","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2208.03811","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2208.03811","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2208.03811","pdf_url":"https://arxiv.org/pdf/2208.03811","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W4206903459","https://openalex.org/W2754816816","https://openalex.org/W4366280654","https://openalex.org/W3160167280","https://openalex.org/W4231621013","https://openalex.org/W4362706668","https://openalex.org/W3008318776","https://openalex.org/W2041416246","https://openalex.org/W3020853991","https://openalex.org/W3035836947"],"abstract_inverted_index":{"Many":[0],"fundamental":[1],"problems":[2],"in":[3,90],"machine":[4],"learning":[5],"can":[6],"be":[7],"formulated":[8],"by":[9,42,71,141],"the":[10,67,84,102,111,115,133],"convex":[11,86],"program":[12],"\\[":[13],"\\min_{\u03b8\\in":[14],"R^d}\\":[15],"\\sum_{i=1}^{n}f_{i}(\u03b8),":[16],"\\]":[17],"where":[18],"each":[19],"$f_i$":[20,49,158],"is":[21,114,151],"a":[22,28,62,128,164],"convex,":[23],"Lipschitz":[24],"function":[25],"supported":[26],"on":[27,61,101],"subset":[29],"of":[30,33,64,110,167],"$d_i$":[31],"coordinates":[32],"$\u03b8$.":[34],"One":[35],"common":[36],"approach":[37,58],"to":[38,54,88,155],"this":[39,76],"problem,":[40],"exemplified":[41],"stochastic":[43],"gradient":[44,96,125],"descent,":[45],"involves":[46],"sampling":[47],"one":[48],"term":[50,159],"at":[51,160],"every":[52,161],"iteration":[53,162],"make":[55],"progress.":[56],"This":[57],"crucially":[59],"relies":[60],"notion":[63],"uniformity":[65],"across":[66],"$f_i$'s,":[68],"formally":[69],"captured":[70],"their":[72],"condition":[73,103,112],"number.":[74,104],"In":[75],"work,":[77],"we":[78,130],"give":[79],"an":[80,152,157],"algorithm":[81,108],"that":[82],"minimizes":[83],"above":[85],"formulation":[87],"$\u03b5$-accuracy":[89],"$\\widetilde{O}(\\sum_{i=1}^n":[91],"d_i":[92],"\\log":[93,123],"(1":[94],"/\u03b5))$":[95],"computations,":[97],"with":[98],"no":[99],"assumptions":[100],"The":[105],"previous":[106],"best":[107],"independent":[109],"number":[113],"standard":[116],"cutting":[117],"plane":[118],"method,":[119],"which":[120],"requires":[121],"$O(nd":[122],"(1/\u03b5))$":[124],"computations.":[126],"As":[127],"corollary,":[129],"improve":[131],"upon":[132],"evaluation":[134],"oracle":[135],"complexity":[136],"for":[137],"decomposable":[138],"submodular":[139],"minimization":[140],"Axiotis":[142],"et":[143],"al.":[144],"(ICML":[145],"2021).":[146],"Our":[147],"main":[148],"technical":[149],"contribution":[150],"adaptive":[153],"procedure":[154],"select":[156],"via":[163],"novel":[165],"combination":[166],"cutting-plane":[168],"and":[169],"interior-point":[170],"methods.":[171]},"counts_by_year":[{"year":2023,"cited_by_count":1}],"updated_date":"2026-03-10T16:38:18.471706","created_date":"2022-10-05T00:00:00"}