MétaCan
Menu
Back to cohort
Record W3098123193 · doi:10.18653/v1/2020.codi-1.13

Do We Really Need That Many Parameters In Transformer For Extractive Summarization? Discourse Can Help !

2020· article· en· W3098123193 on OpenAlexaff
Wen Xiao, Patrick Huber, Giuseppe Carenini

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicTopic Modeling
Canadian institutionsUniversity of British Columbia
FundersHuawei Technologies
KeywordsAutomatic summarizationTransformerComputer scienceArtificial intelligenceNatural language processingSentenceLanguage modelMachine learning

Abstract

fetched live from OpenAlex

The multi-head self-attention of popular transformer models is widely used within Natural Language Processing (NLP), including for the task of extractive summarization.With the goal of analyzing and pruning the parameterheavy self-attention mechanism, there are multiple approaches proposing more parameterlight self-attention alternatives.In this paper, we present a novel parameter-lean self-attention mechanism using discourse priors.Our new tree self-attention is based on document-level discourse information, extending the recently proposed "Synthesizer" framework with another lightweight alternative.We show empirical results that our tree self-attention approach achieves competitive ROUGE-scores on the task of extractive summarization.When compared to the original single-head transformer model, the tree attention approach reaches similar performance on both, EDU and sentence level, despite the significant reduction of parameters in the attention component.We further significantly outperform the 8-head transformer model on sentence level when applying a more balanced hyper-parameter setting, requiring an order of magnitude less parameters 1 .

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.005
metaresearch head score (Gemma)0.030
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.023
Threshold uncertainty score0.076

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0050.030
Meta-epidemiology (narrow)0.0020.001
Meta-epidemiology (broad)0.0020.001
Bibliometrics0.0010.001
Science and technology studies0.0010.002
Scholarly communication0.0040.028
Open science0.0020.003
Research integrity0.0030.005
Insufficient payload (model declined to judge)0.0230.015

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.050
GPT teacher head0.286
Teacher spread0.236 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreMethods

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations16
Published2020
Admission routes1
Has abstractyes

Explore more

Same topicTopic ModelingFrench-language works237,207