{"id":"https://openalex.org/W1773217197","doi":"https://doi.org/10.1137/120895731","title":"Near-Optimal Algorithms for Online Matrix Prediction","display_name":"Near-Optimal Algorithms for Online Matrix Prediction","publication_year":2017,"publication_date":"2017-01-01","ids":{"openalex":"https://openalex.org/W1773217197","doi":"https://doi.org/10.1137/120895731","mag":"1773217197"},"language":"en","primary_location":{"id":"doi:10.1137/120895731","is_oa":false,"landing_page_url":"https://doi.org/10.1137/120895731","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/A5024431603","display_name":"Elad Hazan","orcid":"https://orcid.org/0000-0002-1566-3216"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Elad Hazan","raw_affiliation_strings":["Computer Science"],"affiliations":[{"raw_affiliation_string":"Computer Science","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5114021051","display_name":"Satyen Kale","orcid":null},"institutions":[{"id":"https://openalex.org/I4210134091","display_name":"Yahoo (United States)","ror":"https://ror.org/040dkzz12","country_code":"US","type":"company","lineage":["https://openalex.org/I4210134091"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Satyen Kale","raw_affiliation_strings":["Yahoo Research Labs"],"affiliations":[{"raw_affiliation_string":"Yahoo Research Labs","institution_ids":["https://openalex.org/I4210134091"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5078263052","display_name":"Shai Shalev\u2010Shwartz","orcid":null},"institutions":[{"id":"https://openalex.org/I197251160","display_name":"Hebrew University of Jerusalem","ror":"https://ror.org/03qxff017","country_code":"IL","type":"education","lineage":["https://openalex.org/I197251160"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Shai Shalev-Shwartz","raw_affiliation_strings":["Hebrew University of Jerusalem ,"],"affiliations":[{"raw_affiliation_string":"Hebrew University of Jerusalem ,","institution_ids":["https://openalex.org/I197251160"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5024431603"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.775,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.74606719,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"46","issue":"2","first_page":"744","last_page":"773"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.9998999834060669,"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/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.9998999834060669,"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/T12288","display_name":"Optimization and Search Problems","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9958999752998352,"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/regret","display_name":"Regret","score":0.620841383934021},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5591015219688416},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.548225462436676},{"id":"https://openalex.org/keywords/matrix","display_name":"Matrix (chemical analysis)","score":0.5204898715019226},{"id":"https://openalex.org/keywords/collaborative-filtering","display_name":"Collaborative filtering","score":0.5172996520996094},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5047334432601929},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.4791959226131439},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.4579455256462097},{"id":"https://openalex.org/keywords/trace","display_name":"TRACE (psycholinguistics)","score":0.44828593730926514},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.44491592049598694},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.41266167163848877},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3907357454299927},{"id":"https://openalex.org/keywords/recommender-system","display_name":"Recommender system","score":0.3210054636001587},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3205653429031372},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.23637211322784424},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.21076470613479614}],"concepts":[{"id":"https://openalex.org/C50817715","wikidata":"https://www.wikidata.org/wiki/Q79895177","display_name":"Regret","level":2,"score":0.620841383934021},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5591015219688416},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.548225462436676},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.5204898715019226},{"id":"https://openalex.org/C21569690","wikidata":"https://www.wikidata.org/wiki/Q94702","display_name":"Collaborative filtering","level":3,"score":0.5172996520996094},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5047334432601929},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.4791959226131439},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.4579455256462097},{"id":"https://openalex.org/C75291252","wikidata":"https://www.wikidata.org/wiki/Q1315756","display_name":"TRACE (psycholinguistics)","level":2,"score":0.44828593730926514},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.44491592049598694},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.41266167163848877},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3907357454299927},{"id":"https://openalex.org/C557471498","wikidata":"https://www.wikidata.org/wiki/Q554950","display_name":"Recommender system","level":2,"score":0.3210054636001587},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3205653429031372},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.23637211322784424},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.21076470613479614},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/120895731","is_oa":false,"landing_page_url":"https://doi.org/10.1137/120895731","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":[{"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8","score":0.41999998688697815}],"awards":[{"id":"https://openalex.org/G8495683592","display_name":null,"funder_award_id":"AWD1004532","funder_id":"https://openalex.org/F4320332169","funder_display_name":"Directorate for Computer and Information Science and Engineering"}],"funders":[{"id":"https://openalex.org/F4320332169","display_name":"Directorate for Computer and Information Science and Engineering","ror":"https://ror.org/025kzpk63"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1495101539","https://openalex.org/W1537145174","https://openalex.org/W1995547833","https://openalex.org/W2008098735","https://openalex.org/W2102138843","https://openalex.org/W2128592496","https://openalex.org/W2150865801","https://openalex.org/W2164818780","https://openalex.org/W2164957410","https://openalex.org/W2169401877","https://openalex.org/W2170912114","https://openalex.org/W2294596448","https://openalex.org/W2606082375","https://openalex.org/W2611328865","https://openalex.org/W2953342608"],"related_works":["https://openalex.org/W1484355083","https://openalex.org/W4220714703","https://openalex.org/W2170391450","https://openalex.org/W2735929803","https://openalex.org/W2098758514","https://openalex.org/W3008845055","https://openalex.org/W2041004656","https://openalex.org/W2202724490","https://openalex.org/W2947263763","https://openalex.org/W2119611366"],"abstract_inverted_index":{"In":[0,73,140,198],"several":[1],"online":[2,19,36,53,90,132,134,138,205],"prediction":[3],"problems":[4,102,185],"of":[5,13,30,66,80,98,110,117,154,219],"recent":[6],"interest":[7],"the":[8,18,22,38,64,105,115,145,155,183,204,220],"comparison":[9,23,39,61,106],"class":[10,24,40,62,107],"is":[11,25,41,52,63,108],"composed":[12,109],"matrices.":[14,112],"For":[15],"example,":[16],"in":[17,35,56,103],"max-cut":[20],"problem,":[21],"matrices":[26,42,67],"which":[27,43,57,82,104],"represent":[28,44],"cuts":[29],"a":[31,58,69,78,95],"given":[32],"graph,":[33],"and":[34,86,123,137,166,169,186,216],"gambling":[37],"permutations":[45],"over":[46],"$n$":[47],"teams.":[48],"Another":[49],"important":[50],"example":[51],"collaborative":[54,135,206],"filtering,":[55,136],"widely":[59],"used":[60],"set":[65],"with":[68],"small":[70],"trace":[71],"norm.":[72],"this":[74,142],"paper":[75],"we":[76,83,126,178],"isolate":[77],"property":[79],"matrices,":[81,119,122,125],"call":[84],"$(\\beta,\\tau)$-decomposability,":[85],"derive":[87,127,179],"an":[88,147],"efficient":[89],"learning":[91],"algorithm":[92],"that":[93,188],"enjoys":[94],"regret":[96,129],"bound":[97,202],"$\\tilde{O}(\\sqrt{\\beta\\,\\tau\\,T})$":[99],"for":[100,131,182,203],"all":[101],"$(\\beta,\\tau)$-decomposable":[111],"By":[113],"analyzing":[114],"decomposability":[116],"cut":[118],"low":[120],"trace-norm":[121],"triangular":[124],"near-optimal":[128],"bounds":[130,181,191],"max-cut,":[133],"gambling.":[139],"particular,":[141,199],"resolves":[143,209],"(in":[144],"affirmative)":[146],"open":[148,211],"problem":[149,208,212],"posed":[150,213],"by":[151,214],"Abernethy":[152],"[Proceedings":[153,218],"23rd":[156],"Annual":[157,222],"Conference":[158,223],"on":[159,224],"Learning":[160,225],"Theory":[161,226],"(COLT":[162,227],"2010),":[163],"pp.":[164,175,229],"318--319]":[165],"Kleinberg,":[167],"Niculescu-Mizil,":[168],"Sharma":[170],"[Machine":[171],"Learning,":[172],"80":[173],"(2010),":[174],"245--272].":[176],"Finally,":[177],"lower":[180,201],"three":[184],"show":[187],"our":[189,200],"upper":[190],"are":[192],"optimal":[193],"up":[194],"to":[195],"logarithmic":[196],"factors.":[197],"filtering":[207],"another":[210],"Shamir":[215],"Srebro":[217],"24th":[221],"1011),":[228],"661--678].":[230]},"counts_by_year":[{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}