{"id":"https://openalex.org/W2151450177","doi":null,"title":"Efficient algorithms using the multiplicative weights update method","display_name":"Efficient algorithms using the multiplicative weights update method","alternate_titles":[],"publication_year":2007,"publication_date":"2007-01-01","ids":{"openalex":"https://openalex.org/W2151450177","mag":"2151450177"},"language":"en","primary_location":{"id":"mag:2151450177","doi":null,"is_oa":false,"landing_page_url":"http://www.satyenkale.com/papers/thesis.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},"parent_works":[],"lineage":["https://openalex.org/W2151450177"],"child_works_count":0,"type":"dissertation","is_traditional":true,"indexed_in":[],"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/A5114021051","display_name":"Satyen Kale","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Satyen Kale","raw_affiliation_strings":["Princeton University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Princeton University","institution_ids":["https://openalex.org/I20089843"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5114021051"],"corresponding_institution_ids":["https://openalex.org/I20089843"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":99,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9916999936103821,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9916999936103821,"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"}},{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.002300000051036477,"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"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.0012000000569969416,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"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/semidefinite-programming","display_name":"semidefinite programming","score":0.9330000281333923},{"id":"https://openalex.org/keywords/primal-dual-algorithm","display_name":"primal-dual algorithm","score":0.6629999876022339},{"id":"https://openalex.org/keywords/graph-partitioning","display_name":"graph partitioning","score":0.8930000066757202},{"id":"https://openalex.org/keywords/sparsest-cut","display_name":"sparsest cut","score":0.9829999804496765},{"id":"https://openalex.org/keywords/balanced-separators","display_name":"balanced separators","score":0.9890000224113464},{"id":"https://openalex.org/keywords/constraint-satisfaction","display_name":"constraint satisfaction","score":0.7710000276565552},{"id":"https://openalex.org/keywords/derandomization","display_name":"derandomization","score":0.7879999876022339},{"id":"https://openalex.org/keywords/cayley-graphs","display_name":"Cayley graphs","score":0.8130000233650208},{"id":"https://openalex.org/keywords/expander-graphs","display_name":"expander graphs","score":0.800000011920929},{"id":"https://openalex.org/keywords/fat-shattering-dimension","display_name":"fat-shattering dimension","score":0.8349999785423279},{"id":"https://openalex.org/keywords/quantum-states","display_name":"quantum states","score":0.7630000114440918},{"id":"https://openalex.org/keywords/approximation-algorithms","display_name":"approximation algorithms","score":0.5830000042915344},{"id":"https://openalex.org/keywords/meta-algorithms","display_name":"meta-algorithms","score":0.6629999876022339}],"concepts":[{"id":"https://openalex.org/C101901036","wikidata":"https://www.wikidata.org/wiki/Q2269096","display_name":"Semidefinite programming","level":2,"score":0.6829463839530945},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6770256161689758},{"id":"https://openalex.org/C42747912","wikidata":"https://www.wikidata.org/wiki/Q1048447","display_name":"Multiplicative function","level":2,"score":0.5862889885902405},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.46076440811157227},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.45304420590400696},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.43356990814208984},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.432006299495697},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.33733057975769043},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"mag:2151450177","doi":null,"is_oa":false,"landing_page_url":"http://www.satyenkale.com/papers/thesis.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.115.8427","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.115.8427","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.princeton.edu/~satyen/papers/thesis.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.89.5892","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.89.5892","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.princeton.edu/~satyen/papers/thesis.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":98,"referenced_works":["https://openalex.org/W9333331","https://openalex.org/W100944330","https://openalex.org/W391578156","https://openalex.org/W1485997076","https://openalex.org/W1488435683","https://openalex.org/W1489434708","https://openalex.org/W1505310183","https://openalex.org/W1506345875","https://openalex.org/W1537145174","https://openalex.org/W1544515183","https://openalex.org/W1566939909","https://openalex.org/W1573558634","https://openalex.org/W1578099820","https://openalex.org/W1581656968","https://openalex.org/W1598056440","https://openalex.org/W1598169364","https://openalex.org/W1599814229","https://openalex.org/W1631603072","https://openalex.org/W1830670376","https://openalex.org/W1917797959","https://openalex.org/W1927738121","https://openalex.org/W1962291245","https://openalex.org/W1963753244","https://openalex.org/W1968864043","https://openalex.org/W1980869082","https://openalex.org/W1985123706","https://openalex.org/W1988790447","https://openalex.org/W1990811538","https://openalex.org/W1993111701","https://openalex.org/W1995547833","https://openalex.org/W2002272911","https://openalex.org/W2002617302","https://openalex.org/W2010223239","https://openalex.org/W2010791033","https://openalex.org/W2018047324","https://openalex.org/W2020632401","https://openalex.org/W2021145763","https://openalex.org/W2025809050","https://openalex.org/W2026483567","https://openalex.org/W2030458698","https://openalex.org/W2033040247","https://openalex.org/W2034053794","https://openalex.org/W2035652501","https://openalex.org/W2040466831","https://openalex.org/W2051540665","https://openalex.org/W2053924317","https://openalex.org/W2057648657","https://openalex.org/W2059774588","https://openalex.org/W2063491776","https://openalex.org/W2065861851","https://openalex.org/W2067136705","https://openalex.org/W2068190866","https://openalex.org/W2071570468","https://openalex.org/W2075247318","https://openalex.org/W2085751730","https://openalex.org/W2093825590","https://openalex.org/W2099463627","https://openalex.org/W2100440346","https://openalex.org/W2103012681","https://openalex.org/W2104103056","https://openalex.org/W2106887613","https://openalex.org/W2107881198","https://openalex.org/W2116921087","https://openalex.org/W2117595194","https://openalex.org/W2120041647","https://openalex.org/W2122003440","https://openalex.org/W2126746199","https://openalex.org/W2127114399","https://openalex.org/W2129113961","https://openalex.org/W2129192653","https://openalex.org/W2130246629","https://openalex.org/W2134348739","https://openalex.org/W2135730283","https://openalex.org/W2139819161","https://openalex.org/W2139841919","https://openalex.org/W2145701440","https://openalex.org/W2149254401","https://openalex.org/W2150148016","https://openalex.org/W2150865801","https://openalex.org/W2152666411","https://openalex.org/W2154952480","https://openalex.org/W2158177004","https://openalex.org/W2164818780","https://openalex.org/W2164957410","https://openalex.org/W2165956524","https://openalex.org/W2167061810","https://openalex.org/W2167681887","https://openalex.org/W2169401877","https://openalex.org/W2176446742","https://openalex.org/W2179061877","https://openalex.org/W2293569770","https://openalex.org/W2295428206","https://openalex.org/W2296319761","https://openalex.org/W2599168675","https://openalex.org/W2611147814","https://openalex.org/W2611804663","https://openalex.org/W2626503362","https://openalex.org/W3016299094"],"related_works":["https://openalex.org/W4410021862","https://openalex.org/W2346816364","https://openalex.org/W7096148189","https://openalex.org/W2559761435","https://openalex.org/W7097867562","https://openalex.org/W7098482137","https://openalex.org/W2126746199","https://openalex.org/W189296720","https://openalex.org/W7024361774","https://openalex.org/W2577876501"],"abstract_inverted_index":{"Abstract":[0],"Algorithms":[1],"based":[2,109],"on":[3,88,110,117,288],"convex":[4],"optimization,":[5],"especially":[6],"linear":[7],"and":[8,40,94,206,210,218],"semidefinite":[9,177],"programming,":[10],"are":[11,18],"ubiquitous":[12],"in":[13,60,76,133,203,251],"Computer":[14],"Science.":[15],"While":[16],"there":[17],"polynomial":[19],"time":[20,31,225,260],"algorithms":[21,34,43,65,175,186],"known":[22,128],"to":[23,142,192],"solve":[24],"such":[25,197,214],"problems,":[26,196],"quite":[27,77],"often":[28],"the":[29,56,61,100,118,140,143,154,158,228,267,282],"running":[30,114],"of":[32,55,63,92,103,130,145,157,227,231,241,254,276,279,285],"these":[33,180],"is":[35,44,80,291],"very":[36],"high.":[37],"Designing":[38],"simpler":[39],"more":[41],"efficient":[42,64,174],"important":[45],"for":[46,66,172,176,187,266],"practical":[47],"impact.":[48],"In":[49],"this":[50,131],"thesis,":[51],"we":[52,138,182],"explore":[53],"applications":[54,129,156],"Multiplicative":[57,161],"Weights":[58,162],"method":[59,132,141,171],"design":[62],"various":[67,193],"optimization":[68],"problems.":[69],"This":[70],"method,":[71],"which":[72,84,125,245],"was":[73],"repeatedly":[74],"discovered":[75],"diverse":[78],"fields,":[79],"an":[81,247],"algorithmic":[82],"technique":[83],"maintains":[85],"a":[86,89,122,134,239,277],"distribution":[87],"certain":[90],"set":[91,240],"interest,":[93],"updates":[95],"it":[96],"iteratively":[97],"by":[98,105,113],"multiplying":[99],"probability":[101],"mass":[102],"elements":[104,244],"suitably":[106],"chosen":[107],"factors":[108],"feedback":[111],"obtained":[112],"another":[115],"algorithm":[116,237,265],"distribution.":[119],"We":[120,152],"present":[121],"single":[123],"meta-algorithm":[124],"unifies":[126],"all":[127],"common":[135],"framework.":[136],"Next,":[137],"generalize":[139],"setting":[144],"symmetric":[146],"matrices":[147],"rather":[148],"than":[149],"real":[150],"numbers.":[151],"derive":[153],"following":[155],"resulting":[159],"Matrix":[160],"algorithm:":[163],"1.":[164],"The":[165,236],"first":[166],"truly":[167],"general,":[168],"combinatorial,":[169],"primal-dual":[170],"designing":[173],"programming.":[178],"Using":[179],"techniques,":[181],"obtain":[183],"significantly":[184],"faster":[185],"obtaining":[188],"O(plog":[189],"n)":[190,243,263],"approximations":[191],"graph":[194,250],"partitioning":[195],"as":[198,215],"Sparsest":[199],"Cut,":[200],"Balanced":[201],"Separator":[202],"both":[204],"directed":[205],"undirected":[207],"weighted":[208],"graphs,":[209],"constraint":[211],"satisfaction":[212],"problems":[213],"Min":[216,219],"UnCut":[217],"2CNF":[220],"Deletion.":[221],"2.":[222],"An":[223,258,273],"~O(n3)":[224,259],"derandomization":[226],"Alon-Roichman":[229],"construction":[230],"expanders":[232],"using":[233],"Cayley":[234,249],"graphs.":[235],"yields":[238],"O(log":[242,262],"generates":[246],"expanding":[248],"any":[252],"group":[253],"n":[255,289],"elements.":[256],"3.":[257],"deterministic":[261],"approximation":[264],"quantum":[268,286],"hypergraph":[269],"covering":[270],"problem.":[271],"4.":[272],"alternative":[274],"proof":[275],"result":[278],"Aaronson":[280],"that":[281],"fl-fat-shattering":[283],"dimension":[284],"states":[287],"qubits":[290],"O":[292],"(":[293],"nfl2).":[294]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2151450177","counts_by_year":[{"year":2026,"cited_by_count":4},{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":7},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":7},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":8},{"year":2012,"cited_by_count":11}],"updated_date":"2026-11-16T12:05:36.265796","created_date":"2016-06-24T00:00:00"}
