Error-Tolerant E-Discovery Protocols
- URL: http://arxiv.org/abs/2401.17952v1
- Date: Wed, 31 Jan 2024 15:59:16 GMT
- Title: Error-Tolerant E-Discovery Protocols
- Authors: Jinshuo Dong, Jason D. Hartline, Liren Shan, Aravindan Vijayaraghavan
- Abstract summary: We consider the multi-party classification problem introduced by Dong, Hartline, and Vijayaraghavan (2022)
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.
- Score: 18.694850127330973
- License: http://creativecommons.org/licenses/by-nc-sa/4.0/
- Abstract: 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.
Related papers
- Pessimism of the Will, Optimism of the Intellect: Fair Protocols with Malicious but Rational Agents [0.6990493129893112]
We present a game-based framework for the study of fairness protocols.
It is based on the notion of strong secure equilibria, and leverages the conceptual and algorithmic toolbox of game theory.
arXiv Detail & Related papers (2024-05-29T10:15:36Z) - On the Detection of Reviewer-Author Collusion Rings From Paper Bidding [71.43634536456844]
Collusion rings pose a major threat to the peer-review systems of computer science conferences.
One approach to solve this problem would be to detect the colluding reviewers from their manipulated bids.
No research has yet established that detecting collusion rings is even possible.
arXiv Detail & Related papers (2024-02-12T18:12:09Z) - Bicoptor 2.0: Addressing Challenges in Probabilistic Truncation for Enhanced Privacy-Preserving Machine Learning [6.733212399517445]
This paper focuses on analyzing the problems and proposing solutions for the probabilistic truncation protocol in existing PPML works.
In terms of accuracy, we reveal that precision selections recommended in some of the existing works are incorrect.
We propose a solution and a precision selection guideline for future works.
arXiv Detail & Related papers (2023-09-10T01:43:40Z) - WiCE: Real-World Entailment for Claims in Wikipedia [63.234352061821625]
We propose WiCE, a new fine-grained textual entailment dataset built on natural claim and evidence pairs extracted from Wikipedia.
In addition to standard claim-level entailment, WiCE provides entailment judgments over sub-sentence units of the claim.
We show that real claims in our dataset involve challenging verification and retrieval problems that existing models fail to address.
arXiv Detail & Related papers (2023-03-02T17:45:32Z) - Robustness of implemented device-independent protocols against
constrained leakage [0.0]
Device-independent (DI) protocols have experienced significant progress in recent years.
Security proofs for those demonstrations rely on a typical assumption in DI cryptography, that the devices do not leak any unwanted information to each other or to an adversary.
arXiv Detail & Related papers (2023-02-27T16:28:23Z) - Zero-Shot On-the-Fly Event Schema Induction [61.91468909200566]
We present a new approach in which large language models are utilized to generate source documents that allow predicting, given a high-level event definition, the specific events, arguments, and relations between them.
Using our model, complete schemas on any topic can be generated on-the-fly without any manual data collection, i.e., in a zero-shot manner.
arXiv Detail & Related papers (2022-10-12T14:37:00Z) - Classification Protocols with Minimal Disclosure [12.308957254601243]
We consider multi-party protocols for classification 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.
This protocol can be embedded in a machine learning framework that enables automated labeling of points.
arXiv Detail & Related papers (2022-09-06T17:57:52Z) - A Dataset on Malicious Paper Bidding in Peer Review [84.68308372858755]
Malicious reviewers strategically bid in order to unethically manipulate the paper assignment.
A critical impediment towards creating and evaluating methods to mitigate this issue is the lack of publicly-available data on malicious paper bidding.
We release a novel dataset, collected from a mock conference activity where participants were instructed to bid either honestly or maliciously.
arXiv Detail & Related papers (2022-06-24T20:23:33Z) - Data post-processing for the one-way heterodyne protocol under
composable finite-size security [62.997667081978825]
We study the performance of a practical continuous-variable (CV) quantum key distribution protocol.
We focus on the Gaussian-modulated coherent-state protocol with heterodyne detection in a high signal-to-noise ratio regime.
This allows us to study the performance for practical implementations of the protocol and optimize the parameters connected to the steps above.
arXiv Detail & Related papers (2022-05-20T12:37:09Z) - GERE: Generative Evidence Retrieval for Fact Verification [57.78768817972026]
We propose GERE, the first system that retrieves evidences in a generative fashion.
The experimental results on the FEVER dataset show that GERE achieves significant improvements over the state-of-the-art baselines.
arXiv Detail & Related papers (2022-04-12T03:49:35Z) - An Accurate, Scalable and Verifiable Protocol for Federated
Differentially Private Averaging [0.0]
We tackle challenges regarding the privacy guarantees provided to participants and the correctness of the computation in the presence of malicious parties.
Our first contribution is a scalable protocol in which participants exchange correlated Gaussian noise along the edges of a network graph.
Our second contribution enables users to prove the correctness of their computations without compromising the efficiency and privacy guarantees of the protocol.
arXiv Detail & Related papers (2020-06-12T14:21:10Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.