Fast and Private Max-Sum Diversification

arXiv:2607.17196 · cs.CR, cs.DS · Submitted 2026-07-19 · Read on arXiv

Ron Zadicario, Tova Milo

cs.CR, cs.DS

Submitted: 2026-07-19

Comments: VLDB 2026

Code: https://github.com/ronzadi/Differentially-

License: http://creativecommons.org/licenses/by/4.0/

The gist: Result diversification is crucial for generating informative, non-redundant data summaries and query outputs.

Terminology

Abstract

Result diversification is crucial for generating informative, non-redundant data summaries and query outputs. Although its various formulations have been extensively studied across an array of data-driven disciplines, existing methods fail to address the privacy concerns that arise when the underlying data is sensitive. In this work, we initiate the study of result diversification under differential privacy, focusing on the max-sum diversification (MSD) problem, a widely adopted model with the objective of maximizing a linear combination of a submodular function, quantifying relevance, and the sum of pairwise distances between selected items, quantifying diversity. We propose differentially private algorithms for MSD under both cardinality and matroid constraints, achieving nearly optimal utility guarantees. At the same time, we design more efficient algorithms that maintain strong guarantees. Notably, the proposed algorithms are faster than existing non-private methods, making them appealing even in non-private settings. Experimental evaluations on real-world datasets demonstrate that the proposed approach achieves utility comparable to that of non-private baselines even under strong privacy guarantees, and significantly improves execution times for cardinality constraints.

Sources

Related papers