  We consider the multi-party classification problem introduced by Dong,
Hartline, and Vijayaraghavan (2022) in the context of electronic discovery
(e-discovery). Based on a request for production from the requesting party, the
responding party is required to provide documents that are responsive to the
request except for those that are legally privileged. Our goal is to find a
protocol that verifies that the responding party sends almost all responsive
documents while minimizing the disclosure of non-responsive documents. We
provide protocols in the challenging non-realizable setting, where the instance
may not be perfectly separated by a linear classifier. We demonstrate
empirically that our protocol successfully manages to find almost all relevant
documents, while incurring only a small disclosure of non-responsive documents.
We complement this with a theoretical analysis of our protocol in the
single-dimensional setting, and other experiments on simulated data which
suggest that the non-responsive disclosure incurred by our protocol may be
unavoidable.
