Learning Word Representations with Hierarchical Sparse Coding
원문 초록
We propose a new method for learning word representations using hierarchical regularization in sparse coding inspired by the linguistic study of word meanings. We show an efficient learning algorithm based on stochastic proximal methods that is significantly faster than previous approaches, making it possible to perform hierarchical sparse coding on a corpus of billions of word tokens. Experiments on various benchmark tasks---word similarity ranking, analogies, sentence completion, and sentiment analysis---demonstrate that the method outperforms or is competitive with state-of-the-art methods. Our word representations are available at \url{http://www.ark.cs.cmu.edu/dyogatam/wordvecs/}.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
AI Wizards at CheckThat! 2025: Enhancing Transformer-Based Embeddings with Sentiment for Subjectivity Detection in News Articles
When Certainty Is an Artifact: Keyword Lexicon Blindness and the (Mis)Measurement of Rhetorical Stance
DIBERT: Dependency Injected Bidirectional Encoder Representations from Transformers
Aspect Based Sentiment Analysis with Self-Attention and Gated Convolutional Networks
Aspect-level Sentiment Classification with HEAT (HiErarchical ATtention) Network
Mitigating Object Hallucinations via Sentence-Level Early Intervention
토론
이 논문과 연결된 포럼 글이 아직 없습니다.