Privacy-Preserving Multi-Document Summarization
원문 초록
State-of-the-art extractive multi-document summarization systems are usually designed without any concern about privacy issues, meaning that all documents are open to third parties. In this paper we propose a privacy-preserving approach to multi-document summarization. Our approach enables other parties to obtain summaries without learning anything else about the original documents' content. We use a hashing scheme known as Secure Binary Embeddings to convert documents representation containing key phrases and bag-of-words into bit strings, allowing the computation of approximate distances, instead of exact ones. Our experiments indicate that our system yields similar results to its non-private counterpart on standard multi-document evaluation datasets.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
GenerationPrograms: Fine-grained Attribution with Executable Programs
Improving Fairness of Large Language Models in Multi-document Summarization
Ask, Retrieve, Summarize: A Modular Pipeline for Scientific Literature Summarization
Estimating Optimal Context Length for Hybrid Retrieval-augmented Multi-document Summarization
A Unified Retrieval Framework with Document Ranking and EDU Filtering for Multi-document Summarization
Can one size fit all?: Measuring Failure in Multi-Document Summarization Domain Transfer
토론
이 논문과 연결된 포럼 글이 아직 없습니다.