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.

翻译：我们研究了Dong、Hartline和Vijayaraghavan（2022）在电子证据开示背景下提出的多方分类问题。基于请求方的证据开示请求，响应方需要提供与请求相关的文件，但法定特权文件除外。我们的目标是设计一种协议，既能验证响应方提交了几乎所有相关文件，又能将非相关文件的披露降至最低。我们在具有挑战性的非可实现场景中提出了协议，在该场景下实例可能无法被线性分类器完美分离。实验表明，我们的协议成功找到了几乎所有相关文件，同时仅导致少量非相关文件的披露。我们通过一维场景下的理论分析以及模拟数据上的其他实验进一步验证了该协议，结果表明协议产生的非相关文件披露可能是不可避免的。