Vec2Node: Self-training with Tensor Augmentation for Text Classification with Few Labels
Recent advances in state-of-the-art machine learning models like deep neural networks heavily rely on large amounts of labeled training data which is difficult to obtain for many applications. To address label scarcity, recent work has focused on data augmentation techniques to create synthetic training data. In this work, we propose a novel approach of data augmentation leveraging tensor decomposition to generate synthetic samples by exploiting local and global information in text and reducing concept drift. We develop Vec2Node that leverages self-training from in-domain un-labeled data augmented with tensorized word embeddings that significantly improves over state-of-the-art models, particularly in low-resource settings. For instance, with only 1% of labeled training data,Vec2Node obtains a 21.5% improvement over the base model with augmentation. Furthermore,Vec2Node generates interpretable explanations for the augmented data leveraging tensor embeddings
Code (0)
등록된 구현이 없습니다.
Tasks
Data AugmentationTensor Decompositiontext-classificationText ClassificationWord EmbeddingsSimilar Papers 제목 키워드 기반
Self-Attention Graph Residual Convolutional Networks for Event Detection with dependency relations
Event detection (ED) task aims to classify events by identifying key event trigger words embedded in a piece of text. Previous research have proved the validity of fusing syntactic dependency relations into Graph Convolu…
Event DetectionSentenceToward Robust Graph Semi-Supervised Learning against Extreme Data Scarcity
The success of graph neural networks on graph-based web mining highly relies on abundant human-annotated data, which is laborious to obtain in practice. When only few labeled nodes are available, how to improve their rob…
Data AugmentationNode ClassificationATD: Augmenting CP Tensor Decomposition by Self Supervision
Tensor decompositions are powerful tools for dimensionality reduction and feature interpretation of multidimensional data such as signals. Existing tensor decomposition objectives (e.g., Frobenius norm) are designed for …
Data AugmentationDimensionality ReductionSelf-Supervised LearningStochastic Optimization+1Outlier-aware Tensor Robust Principal Component Analysis with Self-guided Data Augmentation
Tensor Robust Principal Component Analysis (TRPCA) is a fundamental technique for decomposing multi-dimensional data into a low-rank tensor and an outlier tensor, yet existing methods relying on sparse outlier assumption…
Computational EfficiencyData AugmentationDenoisingTensor train rank minimization with nonlocal self-similarity for tensor completion
The tensor train (TT) rank has received increasing attention in tensor completion due to its ability to capture the global correlation of high-order tensors ($\textrm{order} >3$). For third order visual data, direct TT r…