Beyond Privacy Trade-offs with Structured Transparency

• URL: http://arxiv.org/abs/2012.08347v2
• Date: Tue, 12 Mar 2024 16:09:35 GMT
• Title: Beyond Privacy Trade-offs with Structured Transparency
• Authors: Andrew Trask and Emma Bluemke and Teddy Collins and Ben Garfinkel Eric Drexler and Claudia Ghezzou Cuervas-Mons and Iason Gabriel and Allan Dafoe and William Isaac
• Abstract summary: We argue that many of these concerns reduce to 'the copy problem' We find that while the copy problem is not solvable, aspects of these amplifying problems have been addressed in a variety of disconnected fields. We propose a five-part framework which groups these efforts into specific capabilities and offers a foundation for their integration into an overarching vision we call "structured transparency"
• Score: 3.5087540566347513
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Successful collaboration involves sharing information. However, parties may disagree on how the information they need to share should be used. We argue that many of these concerns reduce to 'the copy problem': once a bit of information is copied and shared, the sender can no longer control how the recipient uses it. From the perspective of each collaborator, this presents a dilemma that can inhibit collaboration. The copy problem is often amplified by three related problems which we term the bundling, edit, and recursive enforcement problems. We find that while the copy problem is not solvable, aspects of these amplifying problems have been addressed in a variety of disconnected fields. We observe that combining these efforts could improve the governability of information flows and thereby incentivise collaboration. We propose a five-part framework which groups these efforts into specific capabilities and offers a foundation for their integration into an overarching vision we call "structured transparency". We conclude by surveying an array of use-cases that illustrate the structured transparency principles and their related capabilities.

Related papers

• Comparative Performance of Collaborative Bandit Algorithms: Effect of Sparsity and Exploration Intensity [0.6526824510982802]
  Collaborative bandits aim to improve the performance of contextual bandits by introducing relationships between arms (or items) This paper offers a comprehensive analysis of collaborative bandit algorithms and provides a thorough comparison of their performance.
  arXiv  Detail & Related papers  (2024-10-15T22:09:21Z)
• CollabEdit: Towards Non-destructive Collaborative Knowledge Editing [23.013415033531974]
  This manuscript dives into the first investigation of collaborative Knowledge Editing. We identify the unique three challenges therein, including knowledge overlap, knowledge conflict, and knowledge forgetting. We propose a non-destructive collaborative KE framework, COLLABEDIT, which employs a novel model merging mechanism to mimic the global KE behavior.
  arXiv  Detail & Related papers  (2024-10-12T12:10:14Z)
• Multi-Grained Multimodal Interaction Network for Entity Linking [65.30260033700338]
  Multimodal entity linking task aims at resolving ambiguous mentions to a multimodal knowledge graph. We propose a novel Multi-GraIned Multimodal InteraCtion Network $textbf(MIMIC)$ framework for solving the MEL task.
  arXiv  Detail & Related papers  (2023-07-19T02:11:19Z)
• Exploring the Trade-off between Plausibility, Change Intensity and Adversarial Power in Counterfactual Explanations using Multi-objective Optimization [73.89239820192894]
  We argue that automated counterfactual generation should regard several aspects of the produced adversarial instances. We present a novel framework for the generation of counterfactual examples.
  arXiv  Detail & Related papers  (2022-05-20T15:02:53Z)
• A relationship and not a thing: A relational approach to algorithmic accountability and assessment documentation [3.4438724671481755]
  We argue that developers largely have a monopoly on information about how their systems actually work. We argue that robust accountability regimes must establish opportunities for publics to cohere around shared experiences and interests.
  arXiv  Detail & Related papers  (2022-03-02T23:22:03Z)
• Algorithmic Fairness Datasets: the Story so Far [68.45921483094705]
  Data-driven algorithms are studied in diverse domains to support critical decisions, directly impacting people's well-being. A growing community of researchers has been investigating the equity of existing algorithms and proposing novel ones, advancing the understanding of risks and opportunities of automated decision-making for historically disadvantaged populations. Progress in fair Machine Learning hinges on data, which can be appropriately used only if adequately documented. Unfortunately, the algorithmic fairness community suffers from a collective data documentation debt caused by a lack of information on specific resources (opacity) and scatteredness of available information (sparsity)
  arXiv  Detail & Related papers  (2022-02-03T17:25:46Z)
• Towards Collaborative Question Answering: A Preliminary Study [63.91687114660126]
  We propose CollabQA, a novel QA task in which several expert agents coordinated by a moderator work together to answer questions that cannot be answered with any single agent alone. We make a synthetic dataset of a large knowledge graph that can be distributed to experts. We show that the problem can be challenging without introducing prior to the collaboration structure, unless experts are perfect and uniform.
  arXiv  Detail & Related papers  (2022-01-24T14:27:00Z)
• Understanding surrogate explanations: the interplay between complexity, fidelity and coverage [5.094061357656677]
  We show that transitioning from global to local - reducing coverage - allows for more favourable conditions. We discuss the interplay between complexity, fidelity and coverage, and consider how different user needs can lead to problem formulations.
  arXiv  Detail & Related papers  (2021-07-09T08:43:31Z)
• Relation Clustering in Narrative Knowledge Graphs [71.98234178455398]
  relational sentences in the original text are embedded (with SBERT) and clustered in order to merge together semantically similar relations. Preliminary tests show that such clustering might successfully detect similar relations, and provide a valuable preprocessing for semi-supervised approaches.
  arXiv  Detail & Related papers  (2020-11-27T10:43:04Z)
• Survey and Open Problems in Privacy Preserving Knowledge Graph: Merging, Query, Representation, Completion and Applications [17.68925521011772]
  Knowledge Graph (KG) has attracted more and more companies' attention for its ability to connect different types of data in meaningful ways. However, the data isolation problem limits the performance of KG and prevents its further development. How to conduct privacy preserving KG becomes an important research question to answer.
  arXiv  Detail & Related papers  (2020-11-20T02:35:47Z)
• Mitigating Manipulation in Peer Review via Randomized Reviewer Assignments [96.114824979298]
  Three important challenges in conference peer review are maliciously attempting to get assigned to certain papers and "torpedo reviewing" We present a framework that brings all these challenges under a common umbrella and present a (randomized) algorithm for reviewer assignment. Our algorithms can limit the chance that any malicious reviewer gets assigned to their desired paper to 50% while producing assignments with over 90% of the total optimal similarity.
  arXiv  Detail & Related papers  (2020-06-29T23:55:53Z)

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.