Differentially Private Quasi-Concave Optimization: Bypassing the Lower Bound and Application to Geometric Problems

Kobbi Nissim, Eliad Tsfadia, Chao Yan

Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2026, Vancouver, BC, Canada, January 11-14, 2026  — 2026

BibTeX

@inproceedings{DBLP:conf/soda/NissimTY26,
  author = {Nissim, Kobbi and Tsfadia, Eliad and Yan, Chao},
  editor = {Larsen, Kasper Green and Saha, Barna},
  title = {Differentially Private Quasi-Concave Optimization: Bypassing the Lower
                    Bound and Application to Geometric Problems},
  booktitle = {Proceedings of the 2026 Annual {ACM-SIAM} Symposium on Discrete Algorithms,
                    {SODA} 2026, Vancouver, BC, Canada, January 11-14, 2026},
  pages = {5824--5842},
  publisher = {{SIAM}},
  year = {2026},
  url = {https://doi.org/10.1137/1.9781611978971.206},
  doi = {10.1137/1.9781611978971.206},
  timestamp = {Thu, 19 Feb 2026 16:57:23 +0100},
  biburl = {https://dblp.org/rec/conf/soda/NissimTY26.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}