用两阶段训练提升可扩展性,让逻辑机器更懂上下文
Scalable Multi-phase Word Embedding Using Conjunctive Propositional Clauses
- 分两阶段训练,先提取词汇知识再构建序列嵌入
- 在IMDB数据集上表现接近人工基准,且可解释性强
- 适合需要透明决策过程的NLP应用
Tsetlin Machine(TM)架构在机器学习中表现出色,尤其在自然语言处理领域。以往方法通过输入词序列生成统一的词嵌入表示,但随输入规模增大面临可扩展性挑战。本文提出一种新方法,采用两阶段训练:首先将每个词的知识封装进词汇表,再利用这些知识构建序列嵌入。该方法不仅提升了模型可扩展性,还保持了高度可解释性。实验表明,所提方法性能与先前方法相当,并在人类标注基准上表现优异。进一步应用于IMDB情感分析任务,结合TM嵌入与分类器,实现了具备竞争力的端到端可解释解决方案。
原文摘要 · Abstract (English)
The Tsetlin Machine (TM) architecture has recently demonstrated effectiveness in Machine Learning (ML), particularly within Natural Language Processing (NLP). It has been utilized to construct word embedding using conjunctive propositional clauses, thereby significantly enhancing our understanding and interpretation of machine-derived decisions. The previous approach performed the word embedding over a sequence of input words to consolidate the information into a cohesive and unified representation. However, that approach encounters scalability challenges as the input size increases. In this study, we introduce a novel approach incorporating two-phase training to discover contextual embeddings of input sequences. Specifically, this method encapsulates the knowledge for each input word within the dataset's vocabulary, subsequently constructing embeddings for a sequence of input words utilizing the extracted knowledge. This technique not only facilitates the design of a scalable model but also preserves interpretability. Our experimental findings revealed that the proposed method yields competitive performance compared to the previous approaches, demonstrating promising results in contrast to human-generated benchmarks. Furthermore, we applied the proposed approach to sentiment analysis on the IMDB dataset, where the TM embedding and the TM classifier, along with other interpretable classifiers, offered a transparent end-to-end solution with competitive performance.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。