论文标题
披露最少的分类协议
Classification Protocols with Minimal Disclosure
论文作者
论文摘要
我们考虑由法院诉讼中的电子发现诸如诸如诸如电子发现之类的申请激励的分类的多方协议。我们确定一项协议，该协议保证请求方收到所有响应文件，而发送方揭示了证明已收到所有响应文件所需的最少数量的非反应性文件。该协议可以嵌入到机器学习框架中，该框架能够自动标记点，而由此产生的多方协议等同于标准的一党分类问题（如果单党分类问题满足自然的独立性，则具有自然的Irrrelevant Alternestives财产）。我们的正式保证专注于有正确分配文档的线性分类器的情况。
We consider multi-party protocols for classification that are motivated by applications such as e-discovery in court proceedings. We identify a protocol that guarantees that the requesting party receives all responsive documents and the sending party discloses the minimal amount of non-responsive documents necessary to prove that all responsive documents have been received. This protocol can be embedded in a machine learning framework that enables automated labeling of points and the resulting multi-party protocol is equivalent to the standard one-party classification problem (if the one-party classification problem satisfies a natural independence-of-irrelevant-alternatives property). Our formal guarantees focus on the case where there is a linear classifier that correctly partitions the documents.
