{"id":"https://openalex.org/W4417080710","doi":"https://doi.org/10.4230/lipics.forc.2026.5","title":"Normalized Square Root: Sharper Matrix Factorization Bounds for Differentially Private Continual Counting","display_name":"Normalized Square Root: Sharper Matrix Factorization Bounds for Differentially Private Continual Counting","publication_year":2025,"publication_date":"2025-09-17","ids":{"openalex":"https://openalex.org/W4417080710","doi":"https://doi.org/10.4230/lipics.forc.2026.5"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:25976","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FORC.2026.5","pdf_url":null,"source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":null,"raw_type":"publishedVersion"},"type":"article","indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FORC.2026.5","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5003641345","display_name":"Monika Henzinger","orcid":"https://orcid.org/0000-0002-5008-6530"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Henzinger, Monika","raw_affiliation_strings":["Institute of Science and Technology Austria (ISTA), Klosterneuburg, Austria"],"raw_orcid":"https://orcid.org/0000-0002-5008-6530","affiliations":[{"raw_affiliation_string":"Institute of Science and Technology Austria (ISTA), Klosterneuburg, Austria","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5073288292","display_name":"Nikita Kalinin","orcid":"https://orcid.org/0000-0002-1613-5175"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Kalinin, Nikita","raw_affiliation_strings":["Institute of Science and Technology Austria (ISTA), Klosterneuburg, Austria"],"raw_orcid":"https://orcid.org/0009-0003-1134-8141","affiliations":[{"raw_affiliation_string":"Institute of Science and Technology Austria (ISTA), Klosterneuburg, Austria","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5073803308","display_name":"Jalaj Upadhyay","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Upadhyay, Jalaj","raw_affiliation_strings":["Rutgers University, Piscataway, NJ, USA"],"raw_orcid":"https://orcid.org/0009-0004-3305-5101","affiliations":[{"raw_affiliation_string":"Rutgers University, Piscataway, NJ, USA","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.18214781,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"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/T10764","display_name":"Privacy-Preserving Technologies in Data","score":0.9315000176429749,"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/T10764","display_name":"Privacy-Preserving Technologies in Data","score":0.9315000176429749,"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/T10237","display_name":"Cryptography and Data Security","score":0.02669999934732914,"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.015699999406933784,"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/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.8309000134468079},{"id":"https://openalex.org/keywords/factorization","display_name":"Factorization","score":0.7936000227928162},{"id":"https://openalex.org/keywords/matrix-decomposition","display_name":"Matrix decomposition","score":0.5458999872207642},{"id":"https://openalex.org/keywords/dixons-factorization-method","display_name":"Dixon's factorization method","score":0.4702000021934509},{"id":"https://openalex.org/keywords/differential-privacy","display_name":"Differential privacy","score":0.41690000891685486},{"id":"https://openalex.org/keywords/matrix","display_name":"Matrix (chemical analysis)","score":0.3926999866962433}],"concepts":[{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.8309000134468079},{"id":"https://openalex.org/C187834632","wikidata":"https://www.wikidata.org/wiki/Q188804","display_name":"Factorization","level":2,"score":0.7936000227928162},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6570000052452087},{"id":"https://openalex.org/C42355184","wikidata":"https://www.wikidata.org/wiki/Q1361088","display_name":"Matrix decomposition","level":3,"score":0.5458999872207642},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4731000065803528},{"id":"https://openalex.org/C137559481","wikidata":"https://www.wikidata.org/wiki/Q1231787","display_name":"Dixon's factorization method","level":5,"score":0.4702000021934509},{"id":"https://openalex.org/C23130292","wikidata":"https://www.wikidata.org/wiki/Q5275358","display_name":"Differential privacy","level":2,"score":0.41690000891685486},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.3926999866962433},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3919999897480011},{"id":"https://openalex.org/C135692309","wikidata":"https://www.wikidata.org/wiki/Q111124","display_name":"Square (algebra)","level":2,"score":0.3463999927043915},{"id":"https://openalex.org/C134978465","wikidata":"https://www.wikidata.org/wiki/Q1654069","display_name":"Incomplete LU factorization","level":4,"score":0.3253999948501587},{"id":"https://openalex.org/C93226319","wikidata":"https://www.wikidata.org/wiki/Q193137","display_name":"Differential (mechanical device)","level":2,"score":0.32249999046325684},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.2815999984741211},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.26339998841285706},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.2572000026702881}],"mesh":[],"locations_count":4,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:25976","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FORC.2026.5","pdf_url":null,"source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":null,"raw_type":"publishedVersion"},{"id":"pmh:oai:arXiv.org:2509.14334","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2509.14334","pdf_url":"https://arxiv.org/pdf/2509.14334","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"doi:10.48550/arxiv.2509.14334","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2509.14334","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"},{"id":"doi:10.4230/lipics.forc.2026.5","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.forc.2026.5","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":""}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:25976","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FORC.2026.5","pdf_url":null,"source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":null,"raw_type":"publishedVersion"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"The":[0],"factorization":[1,103,118,233],"norms":[2],"of":[3,28,31,39,108],"the":[4,29,32,49,68,90,100,106,129,134,160,163,221,224],"lower-triangular":[5],"all-ones":[6],"n\u00d7":[7],"n":[8],"matrix,":[9],"\u03b3\u2082(M_{count})":[10,55,149],"and":[11,64,67,95,111,165,172,196,226],"\u03b3_{F}(M_{count}),":[12],"play":[13],"a":[14,186],"central":[15],"role":[16],"in":[17,128,175],"differential":[18],"privacy":[19],"as":[20],"they":[21],"are":[22],"used":[23],"to":[24,46,168,193],"give":[25],"theoretical":[26],"justification":[27],"accuracy":[30],"only":[33],"known":[34,51,70],"production-level":[35],"private":[36],"training":[37],"algorithm":[38],"deep":[40],"neural":[41],"networks":[42],"by":[43,60,230],"Google.":[44],"Prior":[45],"this":[47,126],"work,":[48,195],"best":[50,69],"upper":[52,164,188,227],"bound":[53,72,107,136,167,189,203,228],"on":[54,121],"was":[56,73],"1":[57],"+":[58,76,80,144,146,152,154,170,207,209,215,217,236],"(log(n))/\u03c0":[59,81,147,153,210,216],"Mathias":[61,109],"(Linear":[62],"Algebra":[63],"Applications,":[65],"1993),":[66],"lower":[71,135,166,202,225],"1/\u03c0":[74],"(2":[75],"log((2n+1)/3))":[77],"\u2248":[78],"0.507":[79],"(Matou\u0161ek,":[82],"Nikolov,":[83],"Talwar,":[84],"IMRN":[85],"2020),":[86],"where":[87],"log(\u22c5)":[88],"is":[89,234],"natural":[91],"logarithm.":[92],"Recently,":[93],"Henzinger":[94],"Upadhyay":[96],"(SODA":[97],"2025)":[98],"gave":[99],"first":[101,173],"explicit":[102,117,232],"that":[104,119,142,182],"meets":[105],"(1993)":[110],"asked":[112],"whether":[113],"there":[114],"exists":[115],"an":[116,200],"improves":[120],"Mathias\u2019":[122],"bound.":[123],"We":[124],"answer":[125],"question":[127],"affirmative.":[130],"Additionally,":[131,179],"we":[132,140,158,180,197],"improve":[133],"significantly.":[137],"More":[138],"specifically,":[139],"show":[141,181],"o(1)":[143,171,206],"0.701":[145,208],"\u2264":[148,150,211,213],"0.846":[151],"o(1).":[155,218,237],"That":[156,219],"is,":[157,220],"reduce":[159],"gap":[161,222],"between":[162,223],"0.14":[169],"improvement":[174],"over":[176],"three":[177],"decades.":[178],"our":[183,231],"factors":[184],"achieve":[185],"better":[187],"for":[190,204],"\u03b3_{F}(M_{count})":[191,212],"compared":[192],"prior":[194],"also":[198],"establish":[199],"improved":[201],"\u03b3_{F}(M_{count}):":[205],"0.748":[214],"provided":[229],"0.047":[235]},"counts_by_year":[],"updated_date":"2026-06-22T08:00:12.763002","created_date":"2025-10-10T00:00:00"}