{"id":"https://openalex.org/W2999758721","doi":"https://doi.org/10.1137/21m1397854","title":"How to Trap a Gradient Flow","display_name":"How to Trap a Gradient Flow","publication_year":2024,"publication_date":"2024-07-03","ids":{"openalex":"https://openalex.org/W2999758721","doi":"https://doi.org/10.1137/21m1397854","mag":"2999758721"},"language":"en","primary_location":{"id":"doi:10.1137/21m1397854","is_oa":false,"landing_page_url":"https://doi.org/10.1137/21m1397854","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},"type":"preprint","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2001.02968","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5021842384","display_name":"S\u00e9bastien Bubeck","orcid":"https://orcid.org/0000-0001-9122-4410"},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"S\u00e9bastien Bubeck","raw_affiliation_strings":["Microsoft Research, Redmond, WA 98052 USA","Microsoft (United States), Redmond, United States"],"affiliations":[{"raw_affiliation_string":"Microsoft Research, Redmond, WA 98052 USA","institution_ids":["https://openalex.org/I1290206253"]},{"raw_affiliation_string":"Microsoft (United States), Redmond, United States","institution_ids":["https://openalex.org/I1290206253"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5086897744","display_name":"Dan Mikulincer","orcid":"https://orcid.org/0000-0003-3597-3550"},"institutions":[{"id":"https://openalex.org/I53964585","display_name":"Weizmann Institute of Science","ror":"https://ror.org/0316ej306","country_code":"IL","type":"education","lineage":["https://openalex.org/I53964585"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Dan Mikulincer","raw_affiliation_strings":["Weizmann Institute of Science, Rehovot, 7610001 Israel","Weizmann Institute of Science, Rehovot, Israel"],"affiliations":[{"raw_affiliation_string":"Weizmann Institute of Science, Rehovot, 7610001 Israel","institution_ids":["https://openalex.org/I53964585"]},{"raw_affiliation_string":"Weizmann Institute of Science, Rehovot, Israel","institution_ids":["https://openalex.org/I53964585"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5021842384"],"corresponding_institution_ids":["https://openalex.org/I1290206253"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.00092676,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"53","issue":"4","first_page":"803","last_page":"824"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"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"}},"topics":[{"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9990000128746033,"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/dimension","display_name":"Dimension (graph theory)","score":0.6556951999664307},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6387135982513428},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5953308343887329},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.557999849319458},{"id":"https://openalex.org/keywords/gradient-descent","display_name":"Gradient descent","score":0.5368156433105469},{"id":"https://openalex.org/keywords/omega","display_name":"Omega","score":0.5278862714767456},{"id":"https://openalex.org/keywords/balanced-flow","display_name":"Balanced flow","score":0.5112686157226562},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4919247627258301},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.45529699325561523},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.4478955864906311},{"id":"https://openalex.org/keywords/domain","display_name":"Domain (mathematical analysis)","score":0.43363502621650696},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.42648112773895264},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3956957161426544},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.20564651489257812},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.16400140523910522},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.08962118625640869}],"concepts":[{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.6556951999664307},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6387135982513428},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5953308343887329},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.557999849319458},{"id":"https://openalex.org/C153258448","wikidata":"https://www.wikidata.org/wiki/Q1199743","display_name":"Gradient descent","level":3,"score":0.5368156433105469},{"id":"https://openalex.org/C2779557605","wikidata":"https://www.wikidata.org/wiki/Q9890","display_name":"Omega","level":2,"score":0.5278862714767456},{"id":"https://openalex.org/C167879884","wikidata":"https://www.wikidata.org/wiki/Q727568","display_name":"Balanced flow","level":2,"score":0.5112686157226562},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4919247627258301},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.45529699325561523},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.4478955864906311},{"id":"https://openalex.org/C36503486","wikidata":"https://www.wikidata.org/wiki/Q11235244","display_name":"Domain (mathematical analysis)","level":2,"score":0.43363502621650696},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.42648112773895264},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3956957161426544},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.20564651489257812},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.16400140523910522},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.08962118625640869},{"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/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"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/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1137/21m1397854","is_oa":false,"landing_page_url":"https://doi.org/10.1137/21m1397854","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:2001.02968","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2001.02968","pdf_url":"https://arxiv.org/pdf/2001.02968","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":"mag:2999758721","is_oa":true,"landing_page_url":"https://arxiv.org/pdf/2001.02968","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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv (Cornell University)","raw_type":null},{"id":"doi:10.48550/arxiv.2001.02968","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2001.02968","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"},{"id":"mag:3046642216","is_oa":false,"landing_page_url":"http://proceedings.mlr.press/v125/bubeck20b/bubeck20b.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306418075","display_name":"Conference on Learning Theory","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"Conference on Learning Theory","raw_type":null}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2001.02968","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2001.02968","pdf_url":"https://arxiv.org/pdf/2001.02968","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":[{"id":"https://openalex.org/F4320308943","display_name":"Microsoft Research","ror":"https://ror.org/00d0nc645"},{"id":"https://openalex.org/F4320323139","display_name":"Azrieli Foundation","ror":"https://ror.org/009svts64"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1505731132","https://openalex.org/W2007111443","https://openalex.org/W2025373303","https://openalex.org/W2032556376","https://openalex.org/W2047917675","https://openalex.org/W2056243826","https://openalex.org/W2070165567","https://openalex.org/W2124541940","https://openalex.org/W2963326510","https://openalex.org/W2963680311","https://openalex.org/W2964000362","https://openalex.org/W2970072581","https://openalex.org/W3023447009","https://openalex.org/W3141595720","https://openalex.org/W4206742934"],"related_works":["https://openalex.org/W2963668673","https://openalex.org/W3007721825","https://openalex.org/W3012977545","https://openalex.org/W3191173952","https://openalex.org/W3007011025","https://openalex.org/W2970072581","https://openalex.org/W2928696485","https://openalex.org/W2914765585","https://openalex.org/W3021144020","https://openalex.org/W3005833069","https://openalex.org/W3098081551","https://openalex.org/W3108011577","https://openalex.org/W2914757914","https://openalex.org/W2978538948","https://openalex.org/W3195288470","https://openalex.org/W796181159","https://openalex.org/W2947319806","https://openalex.org/W3039254508","https://openalex.org/W3127970339","https://openalex.org/W2886596322"],"abstract_inverted_index":{"We":[0,216],"consider":[1],"the":[2,33,63,77,115,126,166,180,194,202],"problem":[3],"of":[4,10,18,67,89,117,152,169,183,197],"finding":[5],"an":[6,52,105],"$\\varepsilon$-approximate":[7],"stationary":[8],"point":[9],"a":[11,15,86,134,150,171],"smooth":[12],"function":[13],"on":[14,32],"compact":[16],"domain":[17],"$\\mathbb{R}^d$.":[19],"In":[20,121,145,161,189],"contrast":[21,178],"with":[22,128,179,220],"dimension-free":[23],"approaches":[24],"such":[25],"as":[26,137],"gradient":[27,68,110,184],"descent,":[28],"we":[29,108,138,148],"focus":[30],"here":[31],"case":[34],"where":[35],"$d$":[36],"is":[37,104],"finite,":[38],"and":[39,114,225],"potentially":[40],"small.":[41],"This":[42],"viewpoint":[43],"was":[44],"explored":[45],"in":[46,176,233],"1993":[47],"by":[48],"Vavasis,":[49],"who":[50],"proposed":[51],"algorithm":[53,232],"which,":[54],"for":[55,72,81,91,209],"any":[56,234],"fixed":[57,235],"finite":[58],"dimension":[59,122,146],"$d$,":[60],"improves":[61,199,229],"upon":[62,155,201,230],"$O(1/\\varepsilon^2)$":[64],"oracle":[65,119],"complexity":[66,78,143,151],"descent.":[69],"For":[70],"example":[71],"$d=2$,":[73,123],"Vavasis'":[74,129,156,187,231],"approach":[75],"obtains":[76],"$O(1/\\varepsilon)$.":[79],"Moreover":[80],"$d=2$":[82],"he":[83],"also":[84],"proved":[85],"lower":[87,130],"bound":[88,131],"$\u03a9(1/\\sqrt{\\varepsilon})$":[90],"deterministic":[92],"algorithms":[93],"(we":[94],"extend":[95],"this":[96,190,210,218],"result":[97,219],"to":[98,133],"randomized":[99],"algorithms).":[100],"Our":[101],"main":[102],"contribution":[103],"algorithm,":[106,222],"which":[107,228],"call":[109],"flow":[111],"trapping":[112],"(GFT),":[113],"analysis":[116],"its":[118],"complexity.":[120],"GFT":[124,164,198],"closes":[125],"gap":[127],"(up":[132],"logarithmic":[135,172],"factor),":[136],"show":[139,149],"that":[140],"it":[141],"has":[142,165],"$O\\left(\\sqrt{\\frac{\\log(1/\\varepsilon)}{\\varepsilon}}\\right)$.":[144],"$d=3$,":[147],"$O\\left(\\frac{\\log(1/\\varepsilon)}{\\varepsilon}\\right)$,":[153],"improving":[154],"$O\\left(1":[157],"/":[158],"\\varepsilon^{1.2}":[159],"\\right)$.":[160],"higher":[162,191],"dimensions,":[163],"remarkable":[167],"property":[168],"being":[170],"parallel":[173],"depth":[174,182,207],"strategy,":[175],"stark":[177],"polynomial":[181],"descent":[185],"or":[186],"algorithm.":[188],"dimensional":[192],"regime,":[193],"total":[195],"work":[196],"quadratically":[200],"only":[203],"other":[204],"known":[205],"polylogarithmic":[206],"strategy":[208],"problem,":[211],"namely":[212],"naive":[213],"grid":[214],"search.":[215],"augment":[217],"another":[221],"named":[223],"\\emph{cut":[224],"flow}":[226],"(CF),":[227],"dimension.":[236]},"counts_by_year":[],"updated_date":"2026-04-09T08:11:56.329763","created_date":"2025-10-10T00:00:00"}