{"id":"https://openalex.org/W7160924450","doi":"https://doi.org/10.48550/arxiv.2605.08358","title":"Online Matrix Factorization, Online Private Query Release, and Online Discrepancy Minimization","display_name":"Online Matrix Factorization, Online Private Query Release, and Online Discrepancy Minimization","publication_year":2026,"publication_date":"2026-05-08","ids":{"openalex":"https://openalex.org/W7160924450","doi":"https://doi.org/10.48550/arxiv.2605.08358"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2605.08358","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.08358","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2605.08358","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5135951161","display_name":"Aleksandar Nikolov","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Nikolov, Aleksandar","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5002395397","display_name":"Haohua Tang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Tang, Haohua","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5034669615","display_name":"Jonathan Ullman","orcid":"https://orcid.org/0000-0002-0323-5564"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ullman, Jonathan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"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/T10237","display_name":"Cryptography and Data Security","score":0.3425000011920929,"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/T10237","display_name":"Cryptography and Data Security","score":0.3425000011920929,"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/T10764","display_name":"Privacy-Preserving Technologies in Data","score":0.22300000488758087,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.13220000267028809,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/matrix-decomposition","display_name":"Matrix decomposition","score":0.6442000269889832},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.6407999992370605},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.6159999966621399},{"id":"https://openalex.org/keywords/row","display_name":"Row","score":0.5766000151634216},{"id":"https://openalex.org/keywords/factorization","display_name":"Factorization","score":0.5672000050544739},{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.4749999940395355},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.45730000734329224},{"id":"https://openalex.org/keywords/matrix","display_name":"Matrix (chemical analysis)","score":0.44929999113082886},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.44359999895095825}],"concepts":[{"id":"https://openalex.org/C42355184","wikidata":"https://www.wikidata.org/wiki/Q1361088","display_name":"Matrix decomposition","level":3,"score":0.6442000269889832},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.6407999992370605},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.6159999966621399},{"id":"https://openalex.org/C135598885","wikidata":"https://www.wikidata.org/wiki/Q1366302","display_name":"Row","level":2,"score":0.5766000151634216},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.573199987411499},{"id":"https://openalex.org/C187834632","wikidata":"https://www.wikidata.org/wiki/Q188804","display_name":"Factorization","level":2,"score":0.5672000050544739},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4918999969959259},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.4749999940395355},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.45730000734329224},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.44929999113082886},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.44359999895095825},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.4318000078201294},{"id":"https://openalex.org/C191795146","wikidata":"https://www.wikidata.org/wiki/Q3878446","display_name":"Norm (philosophy)","level":2,"score":0.4180999994277954},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4129999876022339},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.40639999508857727},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3828999996185303},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.37310001254081726},{"id":"https://openalex.org/C92207270","wikidata":"https://www.wikidata.org/wiki/Q939253","display_name":"Matrix norm","level":3,"score":0.3483000099658966},{"id":"https://openalex.org/C104140500","wikidata":"https://www.wikidata.org/wiki/Q2088159","display_name":"Row and column spaces","level":3,"score":0.33059999346733093},{"id":"https://openalex.org/C56372850","wikidata":"https://www.wikidata.org/wiki/Q1050404","display_name":"Sparse matrix","level":3,"score":0.3172000050544739},{"id":"https://openalex.org/C137559481","wikidata":"https://www.wikidata.org/wiki/Q1231787","display_name":"Dixon's factorization method","level":5,"score":0.31450000405311584},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.3018999993801117},{"id":"https://openalex.org/C23130292","wikidata":"https://www.wikidata.org/wiki/Q5275358","display_name":"Differential privacy","level":2,"score":0.29429998993873596},{"id":"https://openalex.org/C93226319","wikidata":"https://www.wikidata.org/wiki/Q193137","display_name":"Differential (mechanical device)","level":2,"score":0.28209999203681946},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.2574999928474426},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.2558000087738037}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2605.08358","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.08358","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"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":"article"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2605.08358","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.08358","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions","score":0.4493350386619568}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"In":[0,100],"this":[1,153],"paper":[2],"we":[3,11,83,169],"consider":[4],"several":[5],"related":[6],"online":[7,74,86,102,154,172],"computation":[8],"problems.":[9],"First,":[10],"study":[12],"answering":[13],"sequences":[14],"of":[15,38,48,110,160],"statistical":[16,39],"queries":[17,40,56],"arriving":[18],"online,":[19],"and":[20,119,139],"being":[21],"answered":[22],"immediately":[23],"when":[24],"they":[25],"arrive":[26,163],"with":[27,41],"differential":[28],"privacy.":[29],"Known":[30],"matrix":[31,103,112],"factorization":[32,87,95,104,126],"mechanisms":[33],"can":[34,69],"answer":[35],"a":[36,106,111,125,141],"set":[37],"error":[42,67],"bounded":[43],"by":[44],"the":[45,65,73,92,101,120,150,158,181],"$\u03b3_2$":[46,182],"norm":[47,183],"their":[49],"query":[50],"matrix,":[51],"but":[52],"require":[53],"that":[54,63,89,129,176],"all":[55],"are":[57],"known":[58],"in":[59,72],"advance.":[60],"We":[61],"show":[62],"nearly":[64],"same":[66],"bounds":[68],"be":[70],"achieved":[71],"setting":[75],"for":[76],"non-adaptively":[77],"chosen":[78],"queries.":[79],"To":[80],"do":[81],"so,":[82],"give":[84,170],"an":[85,171],"algorithm":[88,121,148,175],"competitively":[90],"matches":[91],"best":[93],"offline":[94],"up":[96,189],"to":[97,123,137,162,190],"logarithmic":[98,191],"factors.":[99,192],"problem,":[105],"new":[107,142],"row":[108,143],"$q_t$":[109],"arrives":[113],"at":[114,130],"each":[115,131],"time":[116,132],"step":[117],"$t$,":[118],"needs":[122],"maintain":[124],"$L_tR_t=Q_t$":[127],"such":[128],"it":[133],"appends":[134],"some":[135],"rows":[136,161],"$R_t$,":[138],"outputs":[140],"$\\ell_t$":[144],"s.t.":[145],"$\\ell_tR_t=q_t$.":[146],"Our":[147],"maintains":[149],"competitiveness":[151],"over":[152],"process,":[155],"even":[156],"if":[157],"number":[159],"is":[164],"unknown.":[165],"As":[166],"another":[167],"application,":[168],"discrepancy":[173,178],"minimization":[174],"achieves":[177],"competitive":[179],"against":[180,186],"(and":[184],"also":[185],"hereditary":[187],"discrepancy)":[188]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-05-13T00:00:00"}