{"id":"https://openalex.org/W3195278466","doi":"https://doi.org/10.5075/epfl-thesis-8120","title":"Adaptation in Stochastic Algorithms: From Nonsmooth Optimization to Min-Max Problems and Beyond","display_name":"Adaptation in Stochastic Algorithms: From Nonsmooth Optimization to Min-Max Problems and Beyond","publication_year":2021,"publication_date":"2021-01-01","ids":{"openalex":"https://openalex.org/W3195278466","doi":"https://doi.org/10.5075/epfl-thesis-8120","mag":"3195278466"},"language":"en","primary_location":{"id":"pmh:oai:infoscience.epfl.ch:287952","is_oa":true,"landing_page_url":"http://infoscience.epfl.ch/record/287952","pdf_url":"https://infoscience.epfl.ch/record/287952/files/EPFL_TH8120.pdf","source":{"id":"https://openalex.org/S4306400487","display_name":"Infoscience (Ecole Polytechnique F\u00e9d\u00e9rale de Lausanne)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://infoscience.epfl.ch/record/287952","raw_type":"Text"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://infoscience.epfl.ch/record/287952/files/EPFL_TH8120.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5031238214","display_name":"Ahmet Alacaoglu","orcid":"https://orcid.org/0000-0002-2911-7048"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Alacaoglu, Ahmet","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5031238214"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":0,"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.8303999900817871,"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.8303999900817871,"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.7803000211715698,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.7455999851226807,"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/adaptation","display_name":"Adaptation (eye)","score":0.5493752360343933},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.47671785950660706},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.46231967210769653},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.45414942502975464},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3466227352619171},{"id":"https://openalex.org/keywords/biology","display_name":"Biology","score":0.11612513661384583}],"concepts":[{"id":"https://openalex.org/C139807058","wikidata":"https://www.wikidata.org/wiki/Q352374","display_name":"Adaptation (eye)","level":2,"score":0.5493752360343933},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.47671785950660706},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.46231967210769653},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.45414942502975464},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3466227352619171},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.11612513661384583},{"id":"https://openalex.org/C169760540","wikidata":"https://www.wikidata.org/wiki/Q207011","display_name":"Neuroscience","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"pmh:oai:infoscience.epfl.ch:287952","is_oa":true,"landing_page_url":"http://infoscience.epfl.ch/record/287952","pdf_url":"https://infoscience.epfl.ch/record/287952/files/EPFL_TH8120.pdf","source":{"id":"https://openalex.org/S4306400487","display_name":"Infoscience (Ecole Polytechnique F\u00e9d\u00e9rale de Lausanne)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://infoscience.epfl.ch/record/287952","raw_type":"Text"},{"id":"doi:10.5075/epfl-thesis-8120","is_oa":true,"landing_page_url":"https://doi.org/10.5075/epfl-thesis-8120","pdf_url":null,"source":{"id":"https://openalex.org/S4306400488","display_name":"Infoscience (Ecole Polytechnique F\u00e9d\u00e9rale de Lausanne)","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":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"thesis"},{"id":"mag:3195278466","is_oa":false,"landing_page_url":"https://infoscience.epfl.ch/record/287952","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":null}],"best_oa_location":{"id":"pmh:oai:infoscience.epfl.ch:287952","is_oa":true,"landing_page_url":"http://infoscience.epfl.ch/record/287952","pdf_url":"https://infoscience.epfl.ch/record/287952/files/EPFL_TH8120.pdf","source":{"id":"https://openalex.org/S4306400487","display_name":"Infoscience (Ecole Polytechnique F\u00e9d\u00e9rale de Lausanne)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://infoscience.epfl.ch/record/287952","raw_type":"Text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3195278466.pdf","grobid_xml":"https://content.openalex.org/works/W3195278466.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W3120332322","https://openalex.org/W3204926104","https://openalex.org/W3109166754","https://openalex.org/W2948746540","https://openalex.org/W3009707357","https://openalex.org/W2891238145","https://openalex.org/W2990668843","https://openalex.org/W2751333275","https://openalex.org/W2608175946","https://openalex.org/W3158102619","https://openalex.org/W1983212821","https://openalex.org/W3092878522","https://openalex.org/W2083235994","https://openalex.org/W1495720111","https://openalex.org/W3041473029","https://openalex.org/W406762770","https://openalex.org/W2803702329","https://openalex.org/W2048249717","https://openalex.org/W3164461583","https://openalex.org/W602702121"],"abstract_inverted_index":{"Stochastic":[0],"gradient":[1,95,387],"descent":[2,7,149],"(SGD)":[3],"and":[4,51,68,145,237,298,395],"randomized":[5],"coordinate":[6,148],"(RCD)":[8],"are":[9,26],"two":[10,222,341],"of":[11,23,37,48,59,77,92,188,221,224,245,247,292,312,385,402],"the":[12,34,56,75,78,82,86,104,154,159,164,165,185,194,203,218,227,243,248,289,300,363,381,400],"workhorses":[13],"for":[14,97,303,315,339,346],"training":[15],"modern":[16],"automated":[17],"decision":[18],"systems.":[19],"Intriguingly,":[20],"convergence":[21,91,200],"properties":[22,220],"these":[24,189,253],"methods":[25,157,338],"not":[27],"well-established":[28],"as":[29,294],"we":[30,43,63,89,135,213,268,330],"move":[31,136],"away":[32],"from":[33,393,404],"specific":[35],"case":[36],"smooth":[38,110],"minimization.":[39],"In":[40,85],"this":[41,256,316,353],"dissertation,":[42],"focus":[44],"on":[45,108,137,163,206,242,335],"related":[46],"problems":[47,125,141,277,307],"nonsmooth":[49],"optimization":[50,53,337],"min-max":[52,140,276,306,357],"to":[54,122,138,183,252,362,369],"improve":[55,299],"theoretical":[57,265],"understanding":[58],"stochastic":[60,396],"algorithms.":[61,151],"First,":[62],"study":[64],"SGD-based":[65],"adaptive":[66,94,198],"algorithms":[67,190,285,314],"propose":[69,114,214],"a":[70,207,322,355],"regret":[71],"analysis":[72,180],"framework":[73],"overcoming":[74],"limitations":[76],"existing":[79],"ones":[80],"in":[81,321,359],"convex":[83,101,124],"case.":[84],"nonconvex":[87],"case,":[88],"prove":[90],"an":[93,115,174,215,371,377],"algoritm":[96],"solving":[98,304,340],"constrained":[99],"weakly":[100],"optimization,":[102,398],"generalizing":[103],"previously":[105],"known":[106],"results":[107,334],"unconstrained":[109],"optimization.":[111,406],"We":[112,152,281,375],"also":[113,181],"algorithm":[116,216,378],"combining":[117,217],"Nesterov's":[118],"smoothing":[119],"with":[120,126,131,142,158,234,278,308],"SGD":[121],"solve":[123],"infinitely":[127],"many":[128],"linear":[129,199],"constraints,":[130],"optimal":[132,160],"rates.":[133],"Then,":[134],"convex-concave":[139,275,305,405],"bilinear":[143],"coupling":[144],"analyze":[146],"primal-dual":[147,170,397],"(PDCD)":[150],"obtain":[153],"first":[155],"PDCD":[156,225],"$\\mathcal{O}(1/k)$":[161],"rate":[162],"standard":[166],"optimality":[167],"measure":[168],"expected":[169],"gap,":[171],"which":[172],"was":[173],"open":[175],"question":[176],"since":[177],"2014.":[178],"Our":[179],"aims":[182],"explain":[184],"practical":[186,260],"behavior":[187],"by":[191],"showing":[192,399],"that":[193,273,286,379],"last":[195],"iterate":[196],"enjoys":[197,258],"without":[201],"altering":[202],"parameters,":[204],"depending":[205],"certain":[208],"error":[209],"bound":[210],"condition.":[211],"Furthermore,":[212],"favorable":[219],"branches":[223],"methods:":[226],"new":[228],"method":[229,257],"uses":[230],"large":[231],"step":[232],"sizes":[233],"dense":[235],"data":[236,249],"its":[238,263],"per-iteration":[239],"cost":[240],"depends":[241],"number":[244],"nonzeros":[246],"matrix.":[250],"Thanks":[251],"unique":[254],"properties,":[255],"compelling":[259],"performance":[261],"complementing":[262],"rigorous":[264],"guarantees.":[266],"Next,":[267],"consider":[269],"monotone":[270],"variational":[271],"inequalities":[272],"generalize":[274],"nonbilinear":[279],"coupling.":[280],"introduce":[282,376],"variance":[283],"reduced":[284],"converge":[287],"under":[288],"same":[290],"set":[291],"assumptions":[293],"their":[295],"deterministic":[296],"counterparts":[297],"best-known":[301,382],"complexities":[302],"finite-sum":[309],"structure.":[310],"Optimality":[311],"our":[313,332],"problem":[317,358],"class":[318],"is":[319,354,367],"established":[320],"recent":[323],"work":[324],"via":[325],"matching":[326],"lower":[327],"bounds.":[328],"Finally,":[329],"show":[331],"preliminary":[333],"policy":[336,386],"player":[342],"zero-sum":[343],"Markov":[344],"games":[345],"competitive":[347],"reinforcement":[348],"learning":[349],"(RL).":[350],"Even":[351],"though":[352],"nonconvex-nonconcave":[356],"general,":[360],"thanks":[361],"special":[364],"structure,":[365],"it":[366],"tractable":[368],"find":[370],"approximate":[372],"Nash":[373],"equilibrium.":[374],"improves":[380],"sample":[383],"complexity":[384],"methods.":[388],"This":[389],"development":[390],"combines":[391],"tools":[392],"RL":[394],"importance":[401],"techniques":[403]},"counts_by_year":[],"updated_date":"2025-11-06T06:51:31.235846","created_date":"2025-10-10T00:00:00"}