{"citation":{"mla":"Henzinger, Monika H., et al. “A Unifying Framework for Differentially Private Sums under Continual Observation.” <i>Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms</i>, vol. 2024, Society for Industrial and Applied Mathematics, 2024, pp. 995–1018, doi:<a href=\"https://doi.org/10.1137/1.9781611977912.38\">10.1137/1.9781611977912.38</a>.","apa":"Henzinger, M. H., Upadhyay, J., &#38; Upadhyay, S. (2024). A unifying framework for differentially private sums under continual observation. In <i>Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms</i> (Vol. 2024, pp. 995–1018). Alexandria, VA, United States: Society for Industrial and Applied Mathematics. <a href=\"https://doi.org/10.1137/1.9781611977912.38\">https://doi.org/10.1137/1.9781611977912.38</a>","ieee":"M. H. Henzinger, J. Upadhyay, and S. Upadhyay, “A unifying framework for differentially private sums under continual observation,” in <i>Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms</i>, Alexandria, VA, United States, 2024, vol. 2024, pp. 995–1018.","short":"M.H. Henzinger, J. Upadhyay, S. Upadhyay, in:, Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2024, pp. 995–1018.","chicago":"Henzinger, Monika H, Jalaj Upadhyay, and Sarvagya Upadhyay. “A Unifying Framework for Differentially Private Sums under Continual Observation.” In <i>Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms</i>, 2024:995–1018. Society for Industrial and Applied Mathematics, 2024. <a href=\"https://doi.org/10.1137/1.9781611977912.38\">https://doi.org/10.1137/1.9781611977912.38</a>.","ista":"Henzinger MH, Upadhyay J, Upadhyay S. 2024. A unifying framework for differentially private sums under continual observation. Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms vol. 2024, 995–1018.","ama":"Henzinger MH, Upadhyay J, Upadhyay S. A unifying framework for differentially private sums under continual observation. In: <i>Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms</i>. Vol 2024. Society for Industrial and Applied Mathematics; 2024:995-1018. doi:<a href=\"https://doi.org/10.1137/1.9781611977912.38\">10.1137/1.9781611977912.38</a>"},"publication_status":"published","scopus_import":"1","page":"995-1018","_id":"15253","title":"A unifying framework for differentially private sums under continual observation","intvolume":"      2024","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2307.08970","open_access":"1"}],"volume":2024,"publisher":"Society for Industrial and Applied Mathematics","author":[{"orcid":"0000-0002-5008-6530","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","full_name":"Henzinger, Monika H","first_name":"Monika H","last_name":"Henzinger"},{"full_name":"Upadhyay, Jalaj","first_name":"Jalaj","last_name":"Upadhyay"},{"first_name":"Sarvagya","full_name":"Upadhyay, Sarvagya","last_name":"Upadhyay"}],"ec_funded":1,"publication":"Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms","oa_version":"Preprint","month":"01","publication_identifier":{"eisbn":["9781611977912"]},"quality_controlled":"1","language":[{"iso":"eng"}],"abstract":[{"text":"We study the problem of maintaining a differentially private decaying sum under continual observation. We give a unifying framework and an efficient algorithm for this problem for any sufficiently smooth function. Our algorithm is the first differentially private algorithm that does not have a multiplicative error for polynomially decaying weights. Our algorithm improves on all prior works on differentially private decaying sums under continual observation and recovers exactly the additive error for the special case of continual counting from Henzinger et al. (SODA 2023) as a corollary.\r\nOur algorithm is a variant of the matrix mechanism whose error depends on the γ2 and γF norm of the underlying matrix. We give a constructive proof for an almost exact upper bound on the γ2 and γF norm and an almost tight lower bound on the γ2 norm for a large class of lower-triangular matrices. This is the first non-trivial lower bound for lower-triangular matrices whose non-zero entries are not all the same. It includes matrices for all continual decaying sums problems, resulting in an upper bound on the additive error of any differentially private decaying sums algorithm under continual observation.\r\nWe also explore some implications of our result in discrepancy theory and operator algebra. Given the importance of the γ2 norm in computer science and the extensive work in mathematics, we believe our result will have further applications.","lang":"eng"}],"project":[{"grant_number":"101019564","name":"The design and evaluation of modern fully dynamic data structures","_id":"bd9ca328-d553-11ed-ba76-dc4f890cfe62","call_identifier":"H2020"},{"grant_number":"Z00422","_id":"34def286-11ca-11ed-8bc3-da5948e1613c","name":"Wittgenstein Award - Monika Henzinger"},{"name":"Static and Dynamic Hierarchical Graph Decompositions","_id":"bda196b2-d553-11ed-ba76-8e8ee6c21103","grant_number":"I05982"},{"grant_number":"P33775 ","name":"Fast Algorithms for a Reactive Network Layer","_id":"bd9e3a2e-d553-11ed-ba76-8aa684ce17fe"}],"department":[{"_id":"MoHe"}],"date_created":"2024-03-31T22:01:13Z","external_id":{"arxiv":["2307.08970"]},"conference":{"location":"Alexandria, VA, United States","name":"SODA: Symposium on Discrete Algorithms","end_date":"2024-01-10","start_date":"2024-01-07"},"type":"conference","acknowledgement":"This  project  has  received  funding  from  the  European  Research  Council  (ERC)under the European Union’s Horizon 2020 research and innovation programme (Grant agreement No.101019564 “The Design of Modern Fully Dynamic Data Structures (MoDynStruct)” and the AustrianScience Fund (FWF) project Z 422-N, project “Static and Dynamic Hierarchical Graph Decompositions”, I 5982-N, andproject “Fast Algorithms for a Reactive Network Layer (ReactNet)”, P 33775-N, with additional funding from the netideeSCIENCE  Stiftung,  2020–2024.   JU’s  research  was  funded  by  the  Decanal  Research  Grant.   We  thank  the  anonymousreviewers for their useful feedback and pointing us to the results in Matousek et al","oa":1,"doi":"10.1137/1.9781611977912.38","status":"public","year":"2024","date_updated":"2024-04-02T08:04:57Z","article_processing_charge":"No","day":"04","date_published":"2024-01-04T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"}