paper-with-me

홈 › Papers

A Token-wise CNN-based Method for Sentence Compression

2020-09-23 · Weiwei Hou, Hanna Suominen, Piotr Koniusz, Sabrina Caldwell, Tom Gedeon

Sentence compression is a Natural Language Processing (NLP) task aimed at shortening original sentences and preserving their key information. Its applications can benefit many fields e.g. one can build tools for language education. However, current methods are largely based on Recurrent Neural Network (RNN) models which suffer from poor processing speed. To address this issue, in this paper, we propose a token-wise Convolutional Neural Network, a CNN-based model along with pre-trained Bidirectional Encoder Representations from Transformers (BERT) features for deletion-based sentence compression. We also compare our model with RNN-based models and fine-tuned BERT. Although one of the RNN-based models outperforms marginally other models given the same input, our CNN-based model was ten times faster than the RNN-based approach.

📄 PDF Abstract BibTeX arXiv:2009.11260

Code (0)

등록된 구현이 없습니다.

Tasks

SentenceSentence Compression

Methods 이 논문이 사용한 방법론

Linear Layer A Linear Layer is a projection $\mathbf{XW + b}$.
Adam 설명 없음
Softmax The Softmax output function transforms a previous layer's output into a vector of probabilities. It is commonly used for multiclass classification. Given an input vector $x$…
Refunds@Expedia|||How do I get a full refund from Expedia? “How do I get a full refund from Expedia? How do I get a full refund from Expedia? – Call ☎️ +1-(888) 829 (0881) or +1-805-330-4056 or +1-805-330-4056 for Quick Help &…
Dense Connections Dense Connections, or Fully Connected Connections, are a type of layer in a deep neural network that use a linear operation where every input is connected to every output…
Dropout Dropout is a regularization technique for neural networks that drops a unit (along with connections) at training time with a specified probability $p$ (a common value is…
Linear Warmup With Linear Decay Linear Warmup With Linear Decay is a learning rate schedule in which we increase the learning rate linearly for $n$ updates and then linearly decay afterwards.
Weight Decay 설명 없음

Similar Papers 제목 키워드 기반

Prompt Compression with Context-Aware Sentence Encoding for Fast and Improved LLM Inference

2024-09-02 · Barys Liskavets, Maxim Ushakov, Shuvendu Roy, Mark Klibanov 외

Large language models (LLMs) have triggered a new stream of research focusing on compressing the context length to reduce the computational cost while ensuring the retention of helpful information for LLMs to answer the …

Computational EfficiencySentence

LaCo: Efficient Layer-wise Compression of Visual Tokens for Multimodal Large Language Models

2025-07-03 · Juntao Liu, Liqiang Niu, Wenchao Chen, Jie Zhou 외 arxiv

Existing visual token compression methods for Multimodal Large Language Models (MLLMs) predominantly operate as post-encoder modules, limiting their potential for efficiency gains. To address this limitation, we propose …

SkipKV: Selective Skipping of KV Generation and Storage for Efficient Inference with Large Reasoning Models

2025-12-08 · Jiayi Tian, Seyedarmin Azizi, Yequan Zhao, Erfan Baghaei Potraghloo 외 arxiv

Large reasoning models (LRMs) often incur significant key-value (KV) cache overhead, due to their linear growth with the verbose chain-of-thought (CoT) reasoning. This incurs both memory overhead and throughput bottlenec…

TaDSE: Template-aware Dialogue Sentence Embeddings

2023-05-23 · Minsik Oh, Jiwei Li, Guoyin Wang

Learning high quality sentence embeddings from dialogues has drawn increasing attentions as it is essential to solve a variety of dialogue-oriented tasks with low annotation cost. However, directly annotating and gatheri…

Contrastive Learningintent-classificationIntent ClassificationSemantic Compression+6

DSPC: Dual-Stage Progressive Compression Framework for Efficient Long-Context Reasoning

2025-09-17 · Yaxin Gao, Yao Lu, Zongfei Zhang, Jiaqi Nie 외 arxiv

Large language models (LLMs) have achieved remarkable success in many natural language processing (NLP) tasks. To achieve more accurate output, the prompts used to drive LLMs have become increasingly longer, which incurs…