paper-with-me

홈 › Papers

Disentangling Instructive Information from Ranked Multiple Candidates for Multi-Document Scientific Summarization

2024-04-16 · Pancheng Wang, Shasha Li, Dong Li, Kehan Long, Jintao Tang, Ting Wang

Automatically condensing multiple topic-related scientific papers into a succinct and concise summary is referred to as Multi-Document Scientific Summarization (MDSS). Currently, while commonly used abstractive MDSS methods can generate flexible and coherent summaries, the difficulty in handling global information and the lack of guidance during decoding still make it challenging to generate better summaries. To alleviate these two shortcomings, this paper introduces summary candidates into MDSS, utilizing the global information of the document set and additional guidance from the summary candidates to guide the decoding process. Our insights are twofold: Firstly, summary candidates can provide instructive information from both positive and negative perspectives, and secondly, selecting higher-quality candidates from multiple options contributes to producing better summaries. Drawing on the insights, we propose a summary candidates fusion framework -- Disentangling Instructive information from Ranked candidates (DIR) for MDSS. Specifically, DIR first uses a specialized pairwise comparison method towards multiple candidates to pick out those of higher quality. Then DIR disentangles the instructive information of summary candidates into positive and negative latent variables with Conditional Variational Autoencoder. These variables are further incorporated into the decoder to guide generation. We evaluate our approach with three different types of Transformer-based models and three different types of candidates, and consistently observe noticeable performance improvements according to automatic and human evaluation. More analyses further demonstrate the effectiveness of our model in handling global information and enhancing decoding controllability.

📄 PDF Abstract BibTeX arXiv:2404.10416

Code (1)

muguruzawang/dir 공식 구현 pytorch

Tasks

Decoder

Methods 이 논문이 사용한 방법론

SET Dynamic Sparse Training method where weight mask is updated randomly periodically

Similar Papers 제목 키워드 기반

Knowledge Transfer from Answer Ranking to Answer Generation

2022-10-23 · Matteo Gabburo, Rik Koncel-Kedziorski, Siddhant Garg, Luca Soldaini 외

Recent studies show that Question Answering (QA) based on Answer Sentence Selection (AS2) can be improved by generating an improved answer from the top-k ranked answer sentences (termed GenQA). This allows for synthesizi…

Answer GenerationQuestion AnsweringSentenceTransfer Learning

An Empirical Analysis of the Effect of Ballot Truncation on Ranked-Choice Electoral Outcomes

2023-06-09 · Mallory Dickerson, Erin Martin, David McCune

In ranked-choice elections voters cast preference ballots which provide a voter's ranking of the candidates. The method of ranked-choice voting (RCV) chooses a winner by using voter preferences to simulate a series of ru…

Large scale near-duplicate image retrieval using Triples of Adjacent Ranked Features (TARF) with embedded geometric information

2016-03-19 · Sergei Fedorov, Olga Kacher

Most approaches to large-scale image retrieval are based on the construction of the inverted index of local image descriptors or visual words. A search in such an index usually results in a large number of candidates. Th…

Image RetrievalRetrieval

FA*IR: A Fair Top-k Ranking Algorithm

2017-06-20 · Meike Zehlike, Francesco Bonchi, Carlos Castillo, Sara Hajian 외

In this work, we define and solve the Fair Top-k Ranking problem, in which we want to determine a subset of k candidates from a large pool of n >> k candidates, maximizing utility (i.e., select the "best" candidates) sub…

Fairness

An Outcome Test of Discrimination for Ranked Lists

2021-11-15 · Jonathan Roth, Guillaume Saint-Jacques, YinYin Yu

This paper extends Becker (1957)'s outcome test of discrimination to settings where a (human or algorithmic) decision-maker produces a ranked list of candidates. Ranked lists are particularly relevant in the context of o…