Deconvolutional Paragraph Representation Learning
원문 초록
Learning latent representations from long text sequences is an important first step in many natural language processing applications. Recurrent Neural Networks (RNNs) have become a cornerstone for this challenging task. However, the quality of sentences during RNN-based decoding (reconstruction) decreases with the length of the text. We propose a sequence-to-sequence, purely convolutional and deconvolutional autoencoding framework that is free of the above issue, while also being computationally efficient. The proposed method is simple, easy to implement and can be leveraged as a building block for many applications. We show empirically that compared to RNNs, our framework is better at reconstructing and correcting long paragraphs. Quantitative evaluation on semi-supervised text classification and summarization tasks demonstrate the potential for better utilization of long unlabeled text data.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
MultiMatch: Multihead Consistency Regularization Matching for Semi-Supervised Text Classification
A Hybrid Classification Approach using Topic Modeling and Graph Convolution Networks
PD-Sparse : A Primal and Dual Sparse Approach to Extreme Multiclass and Multilabel Classification
Making Language Model a Hierarchical Classifier and Generator
Dual Dimensions Geometric Representation Learning Based Document Dewarping
Feed-Forward SceneDINO for Unsupervised Semantic Scene Completion
토론
이 논문과 연결된 포럼 글이 아직 없습니다.