{"id":"https://openalex.org/W7128634130","doi":"https://doi.org/10.1109/focs63196.2025.00096","title":"Optimal Smoothed Analysis of the Simplex Method","display_name":"Optimal Smoothed Analysis of the Simplex Method","publication_year":2025,"publication_date":"2025-12-14","ids":{"openalex":"https://openalex.org/W7128634130","doi":"https://doi.org/10.1109/focs63196.2025.00096"},"language":null,"primary_location":{"id":"doi:10.1109/focs63196.2025.00096","is_oa":false,"landing_page_url":"https://doi.org/10.1109/focs63196.2025.00096","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE 66th Annual Symposium on Foundations of Computer Science (FOCS)","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":null,"display_name":"Eleon Bach","orcid":null},"institutions":[{"id":"https://openalex.org/I62916508","display_name":"Technical University of Munich","ror":"https://ror.org/02kkvpp62","country_code":"DE","type":"education","lineage":["https://openalex.org/I62916508"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Eleon Bach","raw_affiliation_strings":["Technical University of Munich"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Technical University of Munich","institution_ids":["https://openalex.org/I62916508"]}]},{"author_position":"last","author":{"id":null,"display_name":"Sophie Huiberts","orcid":null},"institutions":[{"id":"https://openalex.org/I4210103002","display_name":"University of Clermont Auvergne","ror":null,"country_code":"FR","type":null,"lineage":["https://openalex.org/I4210103002"]},{"id":"https://openalex.org/I4210143836","display_name":"Clermont Universit\u00e9","ror":"https://ror.org/03yf5zr20","country_code":"FR","type":"education","lineage":["https://openalex.org/I4210143836"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Sophie Huiberts","raw_affiliation_strings":["Université Clermont Auvergne, LIMOS,CNRS"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Université Clermont Auvergne, LIMOS,CNRS","institution_ids":["https://openalex.org/I4210103002","https://openalex.org/I4210143836"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.673,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.89364477,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"1829","last_page":"1856"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.5159000158309937,"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.5159000158309937,"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/T12814","display_name":"Gaussian Processes and Bayesian Inference","score":0.12809999287128448,"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/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.11010000109672546,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/simplex-algorithm","display_name":"Simplex algorithm","score":0.7437000274658203},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6632999777793884},{"id":"https://openalex.org/keywords/simplex","display_name":"Simplex","score":0.5626999735832214},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5489000082015991},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5414000153541565},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.49059998989105225},{"id":"https://openalex.org/keywords/noise","display_name":"Noise (video)","score":0.39890000224113464}],"concepts":[{"id":"https://openalex.org/C144521790","wikidata":"https://www.wikidata.org/wiki/Q134164","display_name":"Simplex algorithm","level":3,"score":0.7437000274658203},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7412999868392944},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6632999777793884},{"id":"https://openalex.org/C62438384","wikidata":"https://www.wikidata.org/wiki/Q331350","display_name":"Simplex","level":2,"score":0.5626999735832214},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5489000082015991},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5414000153541565},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.49059998989105225},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.46779999136924744},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.44440001249313354},{"id":"https://openalex.org/C99498987","wikidata":"https://www.wikidata.org/wiki/Q2210247","display_name":"Noise (video)","level":3,"score":0.39890000224113464},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.35120001435279846},{"id":"https://openalex.org/C148043351","wikidata":"https://www.wikidata.org/wiki/Q4456944","display_name":"Current (fluid)","level":2,"score":0.34369999170303345},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.33649998903274536},{"id":"https://openalex.org/C54829058","wikidata":"https://www.wikidata.org/wiki/Q172937","display_name":"Polyhedron","level":2,"score":0.3228999972343445},{"id":"https://openalex.org/C163716315","wikidata":"https://www.wikidata.org/wiki/Q901177","display_name":"Gaussian","level":2,"score":0.31949999928474426},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.31790000200271606},{"id":"https://openalex.org/C143724316","wikidata":"https://www.wikidata.org/wiki/Q312468","display_name":"Series (stratigraphy)","level":2,"score":0.29739999771118164},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.2883000075817108},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.2784999907016754},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.27649998664855957},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.2732999920845032}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/focs63196.2025.00096","is_oa":false,"landing_page_url":"https://doi.org/10.1109/focs63196.2025.00096","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE 66th Annual Symposium on Foundations of Computer Science (FOCS)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Smoothed":[0],"analysis":[1,40,44],"is":[2,21,80,136],"a":[3,103,130,146],"method":[4,71,132],"for":[5,13],"analyzing":[6],"the":[7,38,49,69,81,90,108,154,158],"performance":[8],"of":[9,42,84,105,151,157],"algorithms,":[10],"used":[11],"especially":[12],"those":[14],"algorithms":[15],"whose":[16,133],"running":[17],"time":[18,74],"in":[19,73],"practice":[20],"significantly":[22],"better":[23],"than":[24],"what":[25],"can":[26],"be":[27],"proven":[28],"through":[29],"worst-case":[30],"analysis.":[31],"Spielman":[32,64,94],"and":[33,45,60,65,95,100,121],"Teng":[34,66],"(STOC":[35,123],"\u201901)":[36],"introduced":[37],"smoothed":[39,134],"framework":[41],"algorithm":[43,177],"applied":[46],"it":[47],"to":[48,89,118,187],"simplex":[50,70,131,184],"method.":[51],"Given":[52],"an":[53],"arbitrary":[54],"linear":[55],"program":[56],"with":[57,107],"d":[58],"variables":[59],"n":[61,166],"inequality":[62,169],"constraints,":[63],"proved":[67],"that":[68,127,175],"runs":[72],"O(\u03c3\u221230d55n86),":[75],"where":[76],"\u03c3":[77],">":[78],"0":[79],"standard":[82],"deviation":[83],"Gaussian":[85],"distributed":[86],"noise":[87,180],"added":[88],"original":[91],"LP":[92],"data.":[93],"Teng\u2019s":[96],"result":[97],"was":[98],"simplified":[99],"strengthened":[101],"over":[102],"series":[104],"works,":[106],"current":[109],"strongest":[110],"upper":[111,137],"bound":[112,150,173],"being":[113],"O(\u03c3\u22123/2d13/4log(n)7/4)":[114],"pivot":[115,141],"steps":[116],"due":[117],"Huiberts,":[119],"Lee":[120],"Zhang":[122],"\u201923).":[124],"We":[125],"prove":[126,145],"there":[128],"exists":[129],"complexity":[135],"bounded":[138],"by":[139],"O(\u03c3\u22121/2d11/4log(n)7/4)":[140],"steps.":[142],"Furthermore,":[143],"we":[144],"matching":[147],"high-probability":[148],"lower":[149,172],"\u03a9(\u03c3\u22121/2d1/2ln(4/\u03c3)\u22121/4)":[152],"on":[153,163],"combinatorial":[155],"diameter":[156],"feasible":[159],"polyhedron":[160],"after":[161],"smoothing,":[162],"instances":[164],"using":[165],"=":[167],"\u230a(4/\u03c3)d\u230b":[168],"constraints.":[170],"This":[171],"indicates":[174],"our":[176],"has":[178],"optimal":[179],"dependence":[181],"among":[182],"all":[183],"methods,":[185],"up":[186],"polylogarithmic":[188],"factors.":[189]},"counts_by_year":[{"year":2026,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-11-09T00:00:00"}