{"id":"https://openalex.org/W2568203473","doi":"https://doi.org/10.1137/110851833","title":"Pareto Optimal Solutions for Smoothed Analysts","display_name":"Pareto Optimal Solutions for Smoothed Analysts","publication_year":2012,"publication_date":"2012-01-01","ids":{"openalex":"https://openalex.org/W2568203473","doi":"https://doi.org/10.1137/110851833","mag":"2568203473"},"language":"en","primary_location":{"id":"doi:10.1137/110851833","is_oa":false,"landing_page_url":"https://doi.org/10.1137/110851833","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":"article","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":"https://openalex.org/A5045798295","display_name":"Ankur Moitra","orcid":"https://orcid.org/0000-0001-7047-0495"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Ankur Moitra","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5051167298","display_name":"Ryan O\u2019Donnell","orcid":"https://orcid.org/0009-0005-5609-5795"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ryan O'Donnell","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5045798295"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.3993,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.89749565,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"41","issue":"5","first_page":"1266","last_page":"1284"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11413","display_name":"Risk and Portfolio Optimization","score":0.9945999979972839,"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"}},"topics":[{"id":"https://openalex.org/T11413","display_name":"Risk and Portfolio Optimization","score":0.9945999979972839,"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"}},{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.98580002784729,"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9771999716758728,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/pareto-principle","display_name":"Pareto principle","score":0.7326745986938477},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6938670873641968},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.6670504808425903},{"id":"https://openalex.org/keywords/random-variable","display_name":"Random variable","score":0.5246541500091553},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4914795160293579},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.46508947014808655},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.451550155878067},{"id":"https://openalex.org/keywords/variable","display_name":"Variable (mathematics)","score":0.42420700192451477},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3690876364707947},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3269606828689575},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.1190679669380188}],"concepts":[{"id":"https://openalex.org/C137635306","wikidata":"https://www.wikidata.org/wiki/Q182667","display_name":"Pareto principle","level":2,"score":0.7326745986938477},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6938670873641968},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.6670504808425903},{"id":"https://openalex.org/C122123141","wikidata":"https://www.wikidata.org/wiki/Q176623","display_name":"Random variable","level":2,"score":0.5246541500091553},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4914795160293579},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.46508947014808655},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.451550155878067},{"id":"https://openalex.org/C182365436","wikidata":"https://www.wikidata.org/wiki/Q50701","display_name":"Variable (mathematics)","level":2,"score":0.42420700192451477},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3690876364707947},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3269606828689575},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.1190679669380188},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/110851833","is_oa":false,"landing_page_url":"https://doi.org/10.1137/110851833","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1968246336","https://openalex.org/W1981507127","https://openalex.org/W1992963068","https://openalex.org/W2007458506","https://openalex.org/W2034053794","https://openalex.org/W2049833095","https://openalex.org/W2164845984","https://openalex.org/W2170959740","https://openalex.org/W3022308742","https://openalex.org/W3029201735","https://openalex.org/W4240438018"],"related_works":["https://openalex.org/W3162204513","https://openalex.org/W2371138613","https://openalex.org/W2048963458","https://openalex.org/W43109613","https://openalex.org/W2359952343","https://openalex.org/W2080152487","https://openalex.org/W2239445980","https://openalex.org/W2766091780","https://openalex.org/W2768210113","https://openalex.org/W2149931498"],"abstract_inverted_index":{"Consider":[0],"an":[1,22,97,113],"optimization":[2],"problem":[3,210],"with":[4],"$n$":[5],"binary":[6],"variables":[7,151],"and":[8,27,111,155,174],"$d+1$":[9],"linear":[10],"objective":[11,23],"functions.":[12],"Each":[13],"valid":[14],"solution":[15],"$x":[16],"\\in":[17],"\\{0,1\\}^n$":[18],"gives":[19],"rise":[20],"to":[21,31,199,222],"vector":[24],"in":[25,55,68,115,152,203],"$\\R^{d+1}$,":[26],"one":[28],"often":[29],"wants":[30],"enumerate":[32],"the":[33,39,59,63,71,102,109,116,142,149,153,160,165,172,178,187,230,234],"Pareto":[34,47,131],"optima":[35],"among":[36],"them.":[37],"In":[38],"worst":[40],"case":[41],"there":[42],"may":[43],"be":[44],"exponentially":[45],"many":[46],"optima;":[48],"however,":[49],"it":[50],"was":[51],"recently":[52],"shown":[53],"that":[54,121,135,193],"(a":[56],"generalization":[57],"of)":[58],"smoothed":[60],"analysis":[61],"framework,":[62],"expected":[64],"number":[65],"is":[66,93,168,197],"polynomial":[67],"$n$.":[69],"Unfortunately,":[70],"bound":[72,88],"obtained":[73],"had":[74],"a":[75,85,119,124,130,145,215],"rather":[76],"bad":[77],"dependence":[78],"on":[79,95,108,208,214],"$d$,":[80],"roughly":[81],"$n^{d!}$.":[82],"We":[83,133,201],"show":[84],"significantly":[86],"improved":[87],"of":[89,118,127,144,148,177,233,236],"$n^{2d}$.":[90],"Our":[91],"proof":[92],"based":[94,213],"defining":[96],"algorithm,":[98],"which":[99],"we":[100,139,182,219,228],"call":[101],"$\\mathtt{Witness}$":[103,166],"mapping.":[104],"This":[105,190],"algorithm":[106],"runs":[107],"data":[110],"produces":[112],"event,":[114],"form":[117],"testimony,":[120,138],"serves":[122],"as":[123,211],"concise":[125],"description":[126,231],"what":[128],"caused":[129],"optimum.":[132],"prove":[134,223],"given":[136,171],"any":[137,194],"can":[140,183,202],"check":[141],"values":[143],"strict":[146],"subset":[147],"random":[150,162,180],"input":[154,179],"deduce":[156,184],"some":[157,176],"information":[158,185],"about":[159,186],"remaining":[161,188],"variables.":[163],"Hence":[164],"mapping":[167],"predictable":[169],"because,":[170],"output":[173,235],"just":[175],"variables,":[181],"inputs.":[189],"immediately":[191],"implies":[192],"particular":[195],"testimony":[196],"unlikely":[198],"occur.":[200],"fact":[204],"regard":[205],"prior":[206],"work":[207],"this":[209],"being":[212],"similar":[216],"principle.":[217],"Here":[218],"are":[220],"able":[221],"much":[224],"stronger":[225],"bounds":[226],"because":[227],"minimize":[229],"complexity":[232],"$\\mathtt{Witness}$.":[237]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}