A Tale of Two Imperatives: Privacy and Explainability

• URL: http://arxiv.org/abs/2412.20798v2
• Date: Tue, 31 Dec 2024 16:13:54 GMT
• Title: A Tale of Two Imperatives: Privacy and Explainability
• Authors: Supriya Manna, Niladri Sett,
• Abstract summary: Deep learning's preponderance across scientific domains has reshaped high-stakes decision-making. This paper examines the complexities of combining Right-to-Privacy (RTP) and Right-to-Explanation (RTE)
• Score: 0.0
• License:
• Abstract: Deep learning's preponderance across scientific domains has reshaped high-stakes decision-making, making it essential to follow rigorous operational frameworks that include both Right-to-Privacy (RTP) and Right-to-Explanation (RTE). This paper examines the complexities of combining these two requirements. For RTP, we focus on `Differential privacy' (DP), which is considered the current \textit{gold standard} for privacy-preserving machine learning due to its strong quantitative guarantee of privacy. For RTE, we focus on post-hoc explainers: they are the \textit{go-to} option for model auditing as they operate independently of model training. We formally investigate DP models and various commonly-used post-hoc explainers: how to evaluate these explainers subject to RTP, and analyze the intrinsic interactions between DP models and these explainers. Furthermore, our work throws light on how RTP and RTE can be effectively combined in high-stakes applications. Our study concludes by outlining an industrial software pipeline, with the example of a wildly used use-case, that respects both RTP and RTE requirements.

Related papers

• ReasoningRank: Teaching Student Models to Rank through Reasoning-Based Knowledge Distillation [11.756344944226495]
  We propose Reason-to-Rank (R2R), a novel open-source reranking approach that enhances transparency. R2R generates two types of reasoning: direct relevance reasoning, which explains how a document addresses the query, and comparison reasoning, which justifies the relevance of one document over another. Our student models are trained to generate meaningful reasoning and rerank documents, achieving competitive performance across multiple datasets.
  arXiv  Detail & Related papers  (2024-10-07T16:25:39Z)
• Tractable Offline Learning of Regular Decision Processes [50.11277112628193]
  This work studies offline Reinforcement Learning (RL) in a class of non-Markovian environments called Regular Decision Processes (RDPs) Ins, the unknown dependency of future observations and rewards from the past interactions can be captured experimentally. Many algorithms first reconstruct this unknown dependency using automata learning techniques.
  arXiv  Detail & Related papers  (2024-09-04T14:26:58Z)
• Not All Prompts Are Made Equal: Prompt-based Pruning of Text-to-Image Diffusion Models [59.16287352266203]
  We introduce Adaptive Prompt-Tailored Pruning (APTP), a novel prompt-based pruning method for text-to-image (T2I) models. APTP learns to determine the required capacity for an input text prompt and routes it to an architecture code, given a total desired compute budget for prompts. APTP outperforms the single-model pruning baselines in terms of FID, CLIP, and CMMD scores.
  arXiv  Detail & Related papers  (2024-06-17T19:22:04Z)
• CELA: Cost-Efficient Language Model Alignment for CTR Prediction [70.65910069412944]
  Click-Through Rate (CTR) prediction holds a paramount position in recommender systems. Recent efforts have sought to mitigate these challenges by integrating Pre-trained Language Models (PLMs) We propose textbfCost-textbfEfficient textbfLanguage Model textbfAlignment (textbfCELA) for CTR prediction.
  arXiv  Detail & Related papers  (2024-05-17T07:43:25Z)
• Benchmarking Deep Facial Expression Recognition: An Extensive Protocol with Balanced Dataset in the Wild [5.044138778500218]
  Facial expression recognition (FER) is a crucial part of human-computer interaction. We collected a new in-the-wild facial expression dataset for cross-domain validation. We ranked network architectures and summarized a set of recommendations on deploying deep FER methods in real scenarios.
  arXiv  Detail & Related papers  (2023-11-06T06:48:49Z)
• Generative Judge for Evaluating Alignment [84.09815387884753]
  We propose a generative judge with 13B parameters, Auto-J, designed to address these challenges. Our model is trained on user queries and LLM-generated responses under massive real-world scenarios. Experimentally, Auto-J outperforms a series of strong competitors, including both open-source and closed-source models.
  arXiv  Detail & Related papers  (2023-10-09T07:27:15Z)
• Towards End-to-End Open Conversational Machine Reading [57.18251784418258]
  In open-retrieval conversational machine reading (OR-CMR) task, machines are required to do multi-turn question answering given dialogue history and a textual knowledge base. We model OR-CMR as a unified text-to-text task in a fully end-to-end style. Experiments on the ShARC and OR-ShARC dataset show the effectiveness of our proposed end-to-end framework.
  arXiv  Detail & Related papers  (2022-10-13T15:50:44Z)
• Benchmarking Constraint Inference in Inverse Reinforcement Learning [19.314352936252444]
  In many real-world problems, the constraints followed by expert agents are often hard to specify mathematically and unknown to the RL agents. In this paper, we construct a CIRL benchmark in the context of two major application domains: robot control and autonomous driving. The benchmark, including the information for reproducing the performance of CIRL algorithms, is publicly available at https://github.com/Guiliang/CIRL-benchmarks-public.
  arXiv  Detail & Related papers  (2022-06-20T09:22:20Z)
• Relational-Grid-World: A Novel Relational Reasoning Environment and An Agent Model for Relational Information Extraction [0.0]
  Reinforcement learning (RL) agents are often designed specifically for a particular problem and they generally have uninterpretable working processes. Statistical methods-based RL algorithms can be improved in terms of generalizability and interpretability using symbolic Artificial Intelligence (AI) tools such as logic programming. We present a model-free RL architecture that is supported with explicit relational representations of the environmental objects.
  arXiv  Detail & Related papers  (2020-07-12T11:30:48Z)
• DEPARA: Deep Attribution Graph for Deep Knowledge Transferability [91.06106524522237]
  We propose the DEeP Attribution gRAph (DEPARA) to investigate the transferability of knowledge learned from PR-DNNs. In DEPARA, nodes correspond to the inputs and are represented by their vectorized attribution maps with regards to the outputs of the PR-DNN. The knowledge transferability of two PR-DNNs is measured by the similarity of their corresponding DEPARAs.
  arXiv  Detail & Related papers  (2020-03-17T02:07:50Z)

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.