Search papers, labs, and topics across Lattice.
This paper introduces ReBound, a novel framework that enhances differentially private decision support by allowing the reuse of cached results from previous queries, thereby reducing the privacy cost associated with answering new queries. By integrating a cache graph structure and a negotiation mechanism, ReBound maintains formal utility guarantees while enabling analysts to interactively refine their queries without incurring additional privacy losses. The key finding demonstrates that ReBound can significantly improve efficiency in decision support systems while preserving privacy, making it a valuable tool for analysts dealing with complex data queries.
ReBound allows analysts to refine their queries interactively without sacrificing privacy, achieving reduced or zero additional privacy costs.
Differentially private decision support frameworks answer complex aggregate threshold queries with formal bounds on false negative and false positive rates, but treat each query independently with no memory of past results. In practice, analysts work interactively, issuing sequences of related queries that refine bounds, adjust thresholds, or derive new functions from previous ones. We propose ReBound, a framework that reuses cached results from previous queries to answer new queries at reduced or zero additional privacy cost while maintaining formal utility guarantees. ReBound introduces a reuse framework for multiple refinement types, a cache graph structure for efficient lookup of reusable results, and a negotiation mechanism for when requested bounds cannot be met within budget.
